/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_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:22:36,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:22:36,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:22:36,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:22:36,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:22:36,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:22:36,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:22:36,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:22:36,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:22:36,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:22:36,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:22:36,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:22:36,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:22:36,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:22:36,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:22:36,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:22:36,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:22:36,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:22:36,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:22:36,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:22:36,448 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:22:36,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:22:36,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:22:36,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:22:36,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:22:36,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:22:36,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:22:36,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:22:36,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:22:36,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:22:36,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:22:36,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:22:36,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:22:36,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:22:36,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:22:36,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:22:36,464 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:22:36,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:22:36,464 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:22:36,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:22:36,465 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:22:36,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:22:36,467 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 11:22:36,477 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:22:36,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:22:36,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:22:36,479 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:22:36,479 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:22:36,479 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:22:36,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:22:36,479 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:22:36,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:22:36,480 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:22:36,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:22:36,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:22:36,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:22:36,481 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:22:36,481 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:22:36,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:22:36,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:22:36,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:22:36,481 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:22:36,481 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:22:36,481 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:22:36,481 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:22:36,482 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 11:22:36,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:22:36,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:22:36,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:22:36,733 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:22:36,733 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:22:36,734 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound2.c [2022-04-28 11:22:36,786 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b638339d1/6316ce03335248219b3e32b7a6cacfa7/FLAG585035477 [2022-04-28 11:22:37,079 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:22:37,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound2.c [2022-04-28 11:22:37,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b638339d1/6316ce03335248219b3e32b7a6cacfa7/FLAG585035477 [2022-04-28 11:22:37,514 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b638339d1/6316ce03335248219b3e32b7a6cacfa7 [2022-04-28 11:22:37,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:22:37,517 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:22:37,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:22:37,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:22:37,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:22:37,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:22:37" (1/1) ... [2022-04-28 11:22:37,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e493beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:37, skipping insertion in model container [2022-04-28 11:22:37,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:22:37" (1/1) ... [2022-04-28 11:22:37,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:22:37,538 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:22:37,668 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_unwindbound2.c[576,589] [2022-04-28 11:22:37,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:22:37,696 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:22:37,705 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_unwindbound2.c[576,589] [2022-04-28 11:22:37,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:22:37,724 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:22:37,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:37 WrapperNode [2022-04-28 11:22:37,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:22:37,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:22:37,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:22:37,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:22:37,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:37" (1/1) ... [2022-04-28 11:22:37,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:37" (1/1) ... [2022-04-28 11:22:37,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:37" (1/1) ... [2022-04-28 11:22:37,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:37" (1/1) ... [2022-04-28 11:22:37,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:37" (1/1) ... [2022-04-28 11:22:37,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:37" (1/1) ... [2022-04-28 11:22:37,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:37" (1/1) ... [2022-04-28 11:22:37,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:22:37,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:22:37,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:22:37,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:22:37,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:37" (1/1) ... [2022-04-28 11:22:37,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:22:37,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:37,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 11:22:37,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 11:22:37,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:22:37,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:22:37,843 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:22:37,843 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:22:37,843 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:22:37,844 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:22:37,844 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:22:37,844 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:22:37,844 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:22:37,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:22:37,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 11:22:37,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:22:37,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:22:37,846 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:22:37,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:22:37,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:22:37,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:22:37,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:22:37,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:22:37,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:22:37,891 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:22:37,892 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:22:38,080 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:22:38,086 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:22:38,099 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 11:22:38,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:22:38 BoogieIcfgContainer [2022-04-28 11:22:38,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:22:38,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:22:38,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:22:38,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:22:38,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:22:37" (1/3) ... [2022-04-28 11:22:38,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6376bc25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:22:38, skipping insertion in model container [2022-04-28 11:22:38,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:37" (2/3) ... [2022-04-28 11:22:38,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6376bc25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:22:38, skipping insertion in model container [2022-04-28 11:22:38,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:22:38" (3/3) ... [2022-04-28 11:22:38,107 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound2.c [2022-04-28 11:22:38,119 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:22:38,120 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:22:38,163 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:22:38,173 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@20f9e690, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2f964c07 [2022-04-28 11:22:38,173 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:22:38,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:22:38,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:22:38,196 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:38,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:22:38,197 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:38,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:38,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 1 times [2022-04-28 11:22:38,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:38,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1615987450] [2022-04-28 11:22:38,224 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:22:38,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 2 times [2022-04-28 11:22:38,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:38,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387967305] [2022-04-28 11:22:38,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:38,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:38,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:22:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:38,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41#true} is VALID [2022-04-28 11:22:38,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-28 11:22:38,446 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-28 11:22:38,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:22:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:38,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 11:22:38,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 11:22:38,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 11:22:38,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-28 11:22:38,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:22:38,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41#true} is VALID [2022-04-28 11:22:38,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-28 11:22:38,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-28 11:22:38,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret8 := main(); {41#true} is VALID [2022-04-28 11:22:38,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {41#true} is VALID [2022-04-28 11:22:38,470 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {41#true} is VALID [2022-04-28 11:22:38,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 11:22:38,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 11:22:38,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 11:22:38,471 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-28 11:22:38,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {42#false} is VALID [2022-04-28 11:22:38,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#false} assume !true; {42#false} is VALID [2022-04-28 11:22:38,472 INFO L272 TraceCheckUtils]: 13: Hoare triple {42#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {42#false} is VALID [2022-04-28 11:22:38,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-28 11:22:38,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-28 11:22:38,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-28 11:22:38,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:22:38,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:38,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387967305] [2022-04-28 11:22:38,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387967305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:38,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:38,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:22:38,478 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:38,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1615987450] [2022-04-28 11:22:38,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1615987450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:38,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:38,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:22:38,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907813180] [2022-04-28 11:22:38,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:38,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:22:38,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:38,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:38,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:38,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:22:38,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:38,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:22:38,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:22:38,544 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:38,702 INFO L93 Difference]: Finished difference Result 68 states and 101 transitions. [2022-04-28 11:22:38,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:22:38,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:22:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:38,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:22:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:22:38,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-28 11:22:38,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:38,827 INFO L225 Difference]: With dead ends: 68 [2022-04-28 11:22:38,827 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 11:22:38,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:22:38,833 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:38,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:22:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 11:22:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-28 11:22:38,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:38,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:22:38,862 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:22:38,862 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:22:38,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:38,866 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 11:22:38,866 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 11:22:38,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:38,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:38,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-28 11:22:38,868 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-28 11:22:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:38,871 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 11:22:38,871 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 11:22:38,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:38,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:38,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:38,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:38,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:22:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-04-28 11:22:38,876 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2022-04-28 11:22:38,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:38,877 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-04-28 11:22:38,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:38,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 42 transitions. [2022-04-28 11:22:38,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:38,919 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-04-28 11:22:38,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 11:22:38,919 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:38,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:22:38,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:22:38,920 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:38,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:38,921 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 1 times [2022-04-28 11:22:38,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:38,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [866034408] [2022-04-28 11:22:38,921 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:22:38,922 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 2 times [2022-04-28 11:22:38,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:38,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499686710] [2022-04-28 11:22:38,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:38,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:38,938 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:38,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1888064124] [2022-04-28 11:22:38,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:22:38,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:38,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:38,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:22:38,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 11:22:38,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 11:22:38,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:38,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 11:22:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:39,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:22:39,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2022-04-28 11:22:39,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:39,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:39,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#(<= ~counter~0 0)} {323#true} #93#return; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:39,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {331#(<= ~counter~0 0)} call #t~ret8 := main(); {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:39,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {331#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:39,160 INFO L272 TraceCheckUtils]: 6: Hoare triple {331#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:39,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(<= ~counter~0 0)} ~cond := #in~cond; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:39,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#(<= ~counter~0 0)} assume !(0 == ~cond); {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:39,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:39,162 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {331#(<= ~counter~0 0)} {331#(<= ~counter~0 0)} #77#return; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:39,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {331#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:39,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {331#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {365#(<= |main_#t~post6| 0)} is VALID [2022-04-28 11:22:39,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#(<= |main_#t~post6| 0)} assume !(#t~post6 < 2);havoc #t~post6; {324#false} is VALID [2022-04-28 11:22:39,164 INFO L272 TraceCheckUtils]: 14: Hoare triple {324#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {324#false} is VALID [2022-04-28 11:22:39,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-28 11:22:39,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-28 11:22:39,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-28 11:22:39,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:22:39,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:22:39,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:39,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499686710] [2022-04-28 11:22:39,166 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:39,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888064124] [2022-04-28 11:22:39,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888064124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:39,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:39,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:22:39,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:39,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [866034408] [2022-04-28 11:22:39,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [866034408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:39,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:39,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:22:39,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400968324] [2022-04-28 11:22:39,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:39,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 11:22:39,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:39,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:22:39,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:39,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 11:22:39,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:39,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 11:22:39,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 11:22:39,187 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:22:39,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:39,296 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 11:22:39,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 11:22:39,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 11:22:39,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:22:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-28 11:22:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:22:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-28 11:22:39,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-28 11:22:39,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:39,371 INFO L225 Difference]: With dead ends: 42 [2022-04-28 11:22:39,371 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 11:22:39,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 11:22:39,374 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:39,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:22:39,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 11:22:39,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 11:22:39,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:39,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:22:39,399 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:22:39,400 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:22:39,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:39,402 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:22:39,403 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:22:39,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:39,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:39,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-28 11:22:39,404 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-28 11:22:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:39,407 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:22:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:22:39,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:39,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:39,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:39,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:39,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:22:39,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-28 11:22:39,411 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 18 [2022-04-28 11:22:39,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:39,411 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-28 11:22:39,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:22:39,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-28 11:22:39,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:39,455 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:22:39,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 11:22:39,458 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:39,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:22:39,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 11:22:39,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:39,672 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:39,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:39,672 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 1 times [2022-04-28 11:22:39,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:39,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1037446075] [2022-04-28 11:22:39,673 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:22:39,673 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 2 times [2022-04-28 11:22:39,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:39,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312408688] [2022-04-28 11:22:39,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:39,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:39,690 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:39,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1562234102] [2022-04-28 11:22:39,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:22:39,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:39,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:39,692 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:22:39,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 11:22:39,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 11:22:39,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:39,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:22:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:39,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:22:40,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {604#true} call ULTIMATE.init(); {604#true} is VALID [2022-04-28 11:22:40,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {604#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {604#true} is VALID [2022-04-28 11:22:40,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-28 11:22:40,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {604#true} {604#true} #93#return; {604#true} is VALID [2022-04-28 11:22:40,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {604#true} call #t~ret8 := main(); {604#true} is VALID [2022-04-28 11:22:40,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {604#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {604#true} is VALID [2022-04-28 11:22:40,944 INFO L272 TraceCheckUtils]: 6: Hoare triple {604#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {604#true} is VALID [2022-04-28 11:22:40,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#true} ~cond := #in~cond; {604#true} is VALID [2022-04-28 11:22:40,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#true} assume !(0 == ~cond); {604#true} is VALID [2022-04-28 11:22:40,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-28 11:22:40,945 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {604#true} {604#true} #77#return; {604#true} is VALID [2022-04-28 11:22:40,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {604#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 11:22:40,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 11:22:40,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} assume !!(#t~post6 < 2);havoc #t~post6; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 11:22:40,949 INFO L272 TraceCheckUtils]: 14: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:40,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:40,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {605#false} is VALID [2022-04-28 11:22:40,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {605#false} assume !false; {605#false} is VALID [2022-04-28 11:22:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:22:40,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:22:40,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:40,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312408688] [2022-04-28 11:22:40,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:40,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562234102] [2022-04-28 11:22:40,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562234102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:40,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:40,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:22:40,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:40,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1037446075] [2022-04-28 11:22:40,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1037446075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:40,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:40,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:22:40,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596204645] [2022-04-28 11:22:40,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:40,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 11:22:40,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:40,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:40,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:40,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:22:40,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:40,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:22:40,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:22:40,971 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:41,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:41,160 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 11:22:41,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:22:41,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 11:22:41,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 11:22:41,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 11:22:41,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-28 11:22:41,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:41,227 INFO L225 Difference]: With dead ends: 45 [2022-04-28 11:22:41,227 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 11:22:41,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:22:41,230 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:41,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 145 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:22:41,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 11:22:41,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-28 11:22:41,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:41,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:22:41,251 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:22:41,252 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:22:41,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:41,256 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-28 11:22:41,256 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 11:22:41,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:41,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:41,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-28 11:22:41,257 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-28 11:22:41,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:41,259 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-28 11:22:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 11:22:41,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:41,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:41,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:41,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:41,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:22:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-28 11:22:41,263 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 18 [2022-04-28 11:22:41,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:41,263 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-28 11:22:41,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:41,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 49 transitions. [2022-04-28 11:22:41,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:41,306 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-28 11:22:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 11:22:41,306 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:41,306 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:22:41,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 11:22:41,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 11:22:41,520 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:41,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:41,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 1 times [2022-04-28 11:22:41,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:41,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [177939817] [2022-04-28 11:22:41,521 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:22:41,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 2 times [2022-04-28 11:22:41,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:41,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142151337] [2022-04-28 11:22:41,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:41,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:41,536 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:41,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410467642] [2022-04-28 11:22:41,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:22:41,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:41,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:41,543 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:22:41,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 11:22:41,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:22:41,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:41,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:22:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:41,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:22:45,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {920#true} call ULTIMATE.init(); {920#true} is VALID [2022-04-28 11:22:45,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {920#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {920#true} is VALID [2022-04-28 11:22:45,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-28 11:22:45,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {920#true} {920#true} #93#return; {920#true} is VALID [2022-04-28 11:22:45,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {920#true} call #t~ret8 := main(); {920#true} is VALID [2022-04-28 11:22:45,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {920#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {920#true} is VALID [2022-04-28 11:22:45,251 INFO L272 TraceCheckUtils]: 6: Hoare triple {920#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {920#true} is VALID [2022-04-28 11:22:45,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-28 11:22:45,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-28 11:22:45,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-28 11:22:45,251 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {920#true} {920#true} #77#return; {920#true} is VALID [2022-04-28 11:22:45,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {920#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:22:45,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:22:45,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 2);havoc #t~post6; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:22:45,253 INFO L272 TraceCheckUtils]: 14: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {920#true} is VALID [2022-04-28 11:22:45,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-28 11:22:45,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-28 11:22:45,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-28 11:22:45,255 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {920#true} {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:22:45,256 INFO L272 TraceCheckUtils]: 19: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {983#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:45,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {983#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {987#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:45,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {987#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {921#false} is VALID [2022-04-28 11:22:45,257 INFO L290 TraceCheckUtils]: 22: Hoare triple {921#false} assume !false; {921#false} is VALID [2022-04-28 11:22:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:22:45,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:22:45,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:45,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142151337] [2022-04-28 11:22:45,258 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:45,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410467642] [2022-04-28 11:22:45,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410467642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:45,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:45,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:22:45,258 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:45,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [177939817] [2022-04-28 11:22:45,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [177939817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:45,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:45,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:22:45,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711601578] [2022-04-28 11:22:45,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:45,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 11:22:45,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:45,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:22:45,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:45,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:22:45,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:45,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:22:45,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:22:45,285 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:22:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:45,523 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-28 11:22:45,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:22:45,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 11:22:45,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:45,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:22:45,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-28 11:22:45,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:22:45,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-28 11:22:45,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-28 11:22:45,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:45,596 INFO L225 Difference]: With dead ends: 58 [2022-04-28 11:22:45,596 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 11:22:45,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:22:45,598 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:45,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:22:45,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 11:22:45,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-28 11:22:45,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:45,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:22:45,628 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:22:45,629 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:22:45,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:45,634 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-28 11:22:45,634 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-28 11:22:45,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:45,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:45,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-28 11:22:45,639 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-28 11:22:45,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:45,642 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-28 11:22:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-28 11:22:45,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:45,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:45,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:45,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:22:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-28 11:22:45,646 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 23 [2022-04-28 11:22:45,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:45,646 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-28 11:22:45,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:22:45,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 69 transitions. [2022-04-28 11:22:45,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:45,714 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-28 11:22:45,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 11:22:45,714 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:45,714 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:22:45,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 11:22:45,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:45,939 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:45,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:45,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 1 times [2022-04-28 11:22:45,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:45,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1245070748] [2022-04-28 11:22:45,940 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:22:45,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 2 times [2022-04-28 11:22:45,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:45,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13570166] [2022-04-28 11:22:45,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:45,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:45,954 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:45,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2050294006] [2022-04-28 11:22:45,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:22:45,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:45,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:45,956 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:22:45,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 11:22:46,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:22:46,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:46,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:22:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:46,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:22:46,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {1329#true} call ULTIMATE.init(); {1329#true} is VALID [2022-04-28 11:22:46,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {1329#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1329#true} is VALID [2022-04-28 11:22:46,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-28 11:22:46,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1329#true} {1329#true} #93#return; {1329#true} is VALID [2022-04-28 11:22:46,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {1329#true} call #t~ret8 := main(); {1329#true} is VALID [2022-04-28 11:22:46,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {1329#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1329#true} is VALID [2022-04-28 11:22:46,132 INFO L272 TraceCheckUtils]: 6: Hoare triple {1329#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1329#true} is VALID [2022-04-28 11:22:46,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-28 11:22:46,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-28 11:22:46,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-28 11:22:46,133 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1329#true} {1329#true} #77#return; {1329#true} is VALID [2022-04-28 11:22:46,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {1329#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1329#true} is VALID [2022-04-28 11:22:46,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {1329#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1329#true} is VALID [2022-04-28 11:22:46,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {1329#true} assume !!(#t~post6 < 2);havoc #t~post6; {1329#true} is VALID [2022-04-28 11:22:46,133 INFO L272 TraceCheckUtils]: 14: Hoare triple {1329#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1329#true} is VALID [2022-04-28 11:22:46,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-28 11:22:46,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-28 11:22:46,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-28 11:22:46,134 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1329#true} {1329#true} #79#return; {1329#true} is VALID [2022-04-28 11:22:46,136 INFO L272 TraceCheckUtils]: 19: Hoare triple {1329#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1329#true} is VALID [2022-04-28 11:22:46,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-28 11:22:46,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-28 11:22:46,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-28 11:22:46,137 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1329#true} {1329#true} #81#return; {1329#true} is VALID [2022-04-28 11:22:46,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {1329#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-28 11:22:46,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-28 11:22:46,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} assume !!(#t~post7 < 2);havoc #t~post7; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-28 11:22:46,139 INFO L272 TraceCheckUtils]: 27: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1416#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:46,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {1416#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1420#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:46,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {1420#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1330#false} is VALID [2022-04-28 11:22:46,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {1330#false} assume !false; {1330#false} is VALID [2022-04-28 11:22:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:22:46,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:22:46,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:46,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13570166] [2022-04-28 11:22:46,142 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:46,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050294006] [2022-04-28 11:22:46,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050294006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:46,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:46,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:22:46,143 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:46,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1245070748] [2022-04-28 11:22:46,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1245070748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:46,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:46,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:22:46,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719974131] [2022-04-28 11:22:46,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:46,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-28 11:22:46,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:46,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:22:46,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:46,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:22:46,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:46,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:22:46,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:22:46,168 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:22:46,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:46,419 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2022-04-28 11:22:46,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:22:46,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-28 11:22:46,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:22:46,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-28 11:22:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:22:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-28 11:22:46,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-04-28 11:22:46,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:46,488 INFO L225 Difference]: With dead ends: 83 [2022-04-28 11:22:46,488 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 11:22:46,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:22:46,489 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:46,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 145 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:22:46,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 11:22:46,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-04-28 11:22:46,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:46,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:22:46,514 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:22:46,515 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:22:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:46,519 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-28 11:22:46,519 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-28 11:22:46,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:46,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:46,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 81 states. [2022-04-28 11:22:46,520 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 81 states. [2022-04-28 11:22:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:46,524 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-28 11:22:46,524 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-28 11:22:46,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:46,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:46,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:46,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:46,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:22:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2022-04-28 11:22:46,529 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 31 [2022-04-28 11:22:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:46,529 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2022-04-28 11:22:46,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:22:46,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 100 transitions. [2022-04-28 11:22:46,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:46,649 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2022-04-28 11:22:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 11:22:46,650 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:46,650 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:22:46,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 11:22:46,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:46,873 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:46,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:46,873 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 1 times [2022-04-28 11:22:46,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:46,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [989285076] [2022-04-28 11:22:54,409 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:22:54,410 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:22:54,410 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 2 times [2022-04-28 11:22:54,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:54,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598011475] [2022-04-28 11:22:54,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:54,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:54,422 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:54,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [509345087] [2022-04-28 11:22:54,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:22:54,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:54,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:54,431 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:22:54,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 11:22:54,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:22:54,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:54,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:22:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:54,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:22:54,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {1904#true} call ULTIMATE.init(); {1904#true} is VALID [2022-04-28 11:22:54,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {1904#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1912#(<= ~counter~0 0)} {1904#true} #93#return; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {1912#(<= ~counter~0 0)} call #t~ret8 := main(); {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {1912#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,657 INFO L272 TraceCheckUtils]: 6: Hoare triple {1912#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {1912#(<= ~counter~0 0)} ~cond := #in~cond; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {1912#(<= ~counter~0 0)} assume !(0 == ~cond); {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1912#(<= ~counter~0 0)} {1912#(<= ~counter~0 0)} #77#return; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {1912#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {1912#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:22:54,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {1946#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:22:54,670 INFO L272 TraceCheckUtils]: 14: Hoare triple {1946#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:22:54,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {1946#(<= ~counter~0 1)} ~cond := #in~cond; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:22:54,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {1946#(<= ~counter~0 1)} assume !(0 == ~cond); {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:22:54,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {1946#(<= ~counter~0 1)} assume true; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:22:54,672 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1946#(<= ~counter~0 1)} {1946#(<= ~counter~0 1)} #79#return; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:22:54,672 INFO L272 TraceCheckUtils]: 19: Hoare triple {1946#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:22:54,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {1946#(<= ~counter~0 1)} ~cond := #in~cond; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:22:54,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {1946#(<= ~counter~0 1)} assume !(0 == ~cond); {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:22:54,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {1946#(<= ~counter~0 1)} assume true; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:22:54,674 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1946#(<= ~counter~0 1)} {1946#(<= ~counter~0 1)} #81#return; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:22:54,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {1946#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:22:54,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {1946#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1986#(<= |main_#t~post7| 1)} is VALID [2022-04-28 11:22:54,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {1986#(<= |main_#t~post7| 1)} assume !(#t~post7 < 2);havoc #t~post7; {1905#false} is VALID [2022-04-28 11:22:54,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {1905#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {1905#false} is VALID [2022-04-28 11:22:54,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {1905#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1905#false} is VALID [2022-04-28 11:22:54,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {1905#false} assume !(#t~post6 < 2);havoc #t~post6; {1905#false} is VALID [2022-04-28 11:22:54,676 INFO L272 TraceCheckUtils]: 30: Hoare triple {1905#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1905#false} is VALID [2022-04-28 11:22:54,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {1905#false} ~cond := #in~cond; {1905#false} is VALID [2022-04-28 11:22:54,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {1905#false} assume 0 == ~cond; {1905#false} is VALID [2022-04-28 11:22:54,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {1905#false} assume !false; {1905#false} is VALID [2022-04-28 11:22:54,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:22:54,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:22:54,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:54,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598011475] [2022-04-28 11:22:54,677 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:54,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509345087] [2022-04-28 11:22:54,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509345087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:54,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:54,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:22:54,677 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:54,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [989285076] [2022-04-28 11:22:54,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [989285076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:54,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:54,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:22:54,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668572886] [2022-04-28 11:22:54,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:54,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-28 11:22:54,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:54,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:22:54,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:54,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:22:54,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:54,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:22:54,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:22:54,702 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:22:54,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:54,818 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2022-04-28 11:22:54,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:22:54,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-28 11:22:54,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:22:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-28 11:22:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:22:54,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-28 11:22:54,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 85 transitions. [2022-04-28 11:22:54,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:54,884 INFO L225 Difference]: With dead ends: 113 [2022-04-28 11:22:54,884 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 11:22:54,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:22:54,886 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:54,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 114 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:22:54,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 11:22:54,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-28 11:22:54,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:54,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:22:54,930 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:22:54,930 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:22:54,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:54,935 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-28 11:22:54,935 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-28 11:22:54,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:54,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:54,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 78 states. [2022-04-28 11:22:54,937 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 78 states. [2022-04-28 11:22:54,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:54,940 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-28 11:22:54,941 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-28 11:22:54,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:54,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:54,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:54,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:22:54,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2022-04-28 11:22:54,945 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 34 [2022-04-28 11:22:54,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:54,945 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2022-04-28 11:22:54,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:22:54,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 102 transitions. [2022-04-28 11:22:55,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-28 11:22:55,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 11:22:55,041 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:55,041 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:22:55,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 11:22:55,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:55,242 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:55,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:55,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 1 times [2022-04-28 11:22:55,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:55,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [953432947] [2022-04-28 11:22:55,243 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:22:55,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 2 times [2022-04-28 11:22:55,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:55,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432371295] [2022-04-28 11:22:55,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:55,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:55,271 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:55,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1341845765] [2022-04-28 11:22:55,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:22:55,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:55,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:55,276 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:22:55,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 11:22:55,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:22:55,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:55,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:22:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:55,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:22:55,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2022-04-28 11:22:55,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {2548#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2548#true} is VALID [2022-04-28 11:22:55,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:22:55,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2548#true} {2548#true} #93#return; {2548#true} is VALID [2022-04-28 11:22:55,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {2548#true} call #t~ret8 := main(); {2548#true} is VALID [2022-04-28 11:22:55,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {2548#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2548#true} is VALID [2022-04-28 11:22:55,522 INFO L272 TraceCheckUtils]: 6: Hoare triple {2548#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:22:55,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {2548#true} ~cond := #in~cond; {2574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:22:55,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {2574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:22:55,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {2578#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:22:55,524 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2578#(not (= |assume_abort_if_not_#in~cond| 0))} {2548#true} #77#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:22:55,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {2585#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:22:55,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {2585#(<= 1 main_~y~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:22:55,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {2585#(<= 1 main_~y~0)} assume !!(#t~post6 < 2);havoc #t~post6; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:22:55,525 INFO L272 TraceCheckUtils]: 14: Hoare triple {2585#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:22:55,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 11:22:55,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 11:22:55,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:22:55,527 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2548#true} {2585#(<= 1 main_~y~0)} #79#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:22:55,527 INFO L272 TraceCheckUtils]: 19: Hoare triple {2585#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:22:55,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 11:22:55,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 11:22:55,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:22:55,529 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2548#true} {2585#(<= 1 main_~y~0)} #81#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:22:55,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {2585#(<= 1 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:22:55,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {2628#(<= 1 main_~r~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:22:55,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {2628#(<= 1 main_~r~0)} assume !!(#t~post7 < 2);havoc #t~post7; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:22:55,531 INFO L272 TraceCheckUtils]: 27: Hoare triple {2628#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:22:55,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 11:22:55,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 11:22:55,531 INFO L290 TraceCheckUtils]: 30: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:22:55,532 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2548#true} {2628#(<= 1 main_~r~0)} #83#return; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:22:55,532 INFO L272 TraceCheckUtils]: 32: Hoare triple {2628#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:22:55,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 11:22:55,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 11:22:55,532 INFO L290 TraceCheckUtils]: 35: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:22:55,533 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2548#true} {2628#(<= 1 main_~r~0)} #85#return; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:22:55,533 INFO L272 TraceCheckUtils]: 37: Hoare triple {2628#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2668#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:55,534 INFO L290 TraceCheckUtils]: 38: Hoare triple {2668#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2672#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:55,534 INFO L290 TraceCheckUtils]: 39: Hoare triple {2672#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2549#false} is VALID [2022-04-28 11:22:55,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-28 11:22:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 11:22:55,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:22:55,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:55,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432371295] [2022-04-28 11:22:55,539 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:55,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341845765] [2022-04-28 11:22:55,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341845765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:55,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:55,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:22:55,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:55,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [953432947] [2022-04-28 11:22:55,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [953432947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:55,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:55,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:22:55,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398357387] [2022-04-28 11:22:55,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:55,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-04-28 11:22:55,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:55,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:22:55,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:55,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:22:55,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:55,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:22:55,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:22:55,565 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:22:55,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:55,897 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2022-04-28 11:22:55,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:22:55,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-04-28 11:22:55,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:22:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 11:22:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:22:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 11:22:55,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 11:22:55,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:55,939 INFO L225 Difference]: With dead ends: 84 [2022-04-28 11:22:55,939 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 11:22:55,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:22:55,940 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:55,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:22:55,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 11:22:56,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-28 11:22:56,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:56,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:22:56,028 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:22:56,029 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:22:56,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:56,032 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-28 11:22:56,032 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-28 11:22:56,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:56,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:56,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-28 11:22:56,034 INFO L87 Difference]: Start difference. First operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-28 11:22:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:56,038 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-28 11:22:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-28 11:22:56,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:56,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:56,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:56,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:22:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2022-04-28 11:22:56,043 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 41 [2022-04-28 11:22:56,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:56,043 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2022-04-28 11:22:56,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:22:56,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 105 transitions. [2022-04-28 11:22:56,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-28 11:22:56,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 11:22:56,158 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:56,158 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:22:56,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 11:22:56,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:56,367 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:56,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:56,368 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 1 times [2022-04-28 11:22:56,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:56,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [947032843] [2022-04-28 11:22:56,369 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:22:56,369 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 2 times [2022-04-28 11:22:56,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:56,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997309047] [2022-04-28 11:22:56,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:56,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:56,391 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:56,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847180166] [2022-04-28 11:22:56,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:22:56,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:56,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:56,393 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:22:56,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 11:22:56,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:22:56,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:56,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:22:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:56,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:22:56,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {3180#true} call ULTIMATE.init(); {3180#true} is VALID [2022-04-28 11:22:56,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {3180#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3180#true} is VALID [2022-04-28 11:22:56,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:22:56,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3180#true} {3180#true} #93#return; {3180#true} is VALID [2022-04-28 11:22:56,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {3180#true} call #t~ret8 := main(); {3180#true} is VALID [2022-04-28 11:22:56,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {3180#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3180#true} is VALID [2022-04-28 11:22:56,691 INFO L272 TraceCheckUtils]: 6: Hoare triple {3180#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:22:56,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:22:56,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:22:56,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:22:56,695 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3180#true} {3180#true} #77#return; {3180#true} is VALID [2022-04-28 11:22:56,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {3180#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3180#true} is VALID [2022-04-28 11:22:56,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3180#true} is VALID [2022-04-28 11:22:56,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#true} assume !!(#t~post6 < 2);havoc #t~post6; {3180#true} is VALID [2022-04-28 11:22:56,696 INFO L272 TraceCheckUtils]: 14: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:22:56,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:22:56,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:22:56,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:22:56,696 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3180#true} {3180#true} #79#return; {3180#true} is VALID [2022-04-28 11:22:56,696 INFO L272 TraceCheckUtils]: 19: Hoare triple {3180#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:22:56,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:22:56,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:22:56,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:22:56,697 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3180#true} {3180#true} #81#return; {3180#true} is VALID [2022-04-28 11:22:56,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {3180#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3180#true} is VALID [2022-04-28 11:22:56,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {3180#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3180#true} is VALID [2022-04-28 11:22:56,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {3180#true} assume !!(#t~post7 < 2);havoc #t~post7; {3180#true} is VALID [2022-04-28 11:22:56,697 INFO L272 TraceCheckUtils]: 27: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:22:56,698 INFO L290 TraceCheckUtils]: 28: Hoare triple {3180#true} ~cond := #in~cond; {3269#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:56,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {3269#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:56,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:56,699 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} {3180#true} #83#return; {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 11:22:56,699 INFO L272 TraceCheckUtils]: 32: Hoare triple {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:22:56,700 INFO L290 TraceCheckUtils]: 33: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:22:56,700 INFO L290 TraceCheckUtils]: 34: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:22:56,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:22:56,701 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3180#true} {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} #85#return; {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 11:22:56,701 INFO L272 TraceCheckUtils]: 37: Hoare triple {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:22:56,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:22:56,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:22:56,701 INFO L290 TraceCheckUtils]: 40: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:22:56,702 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3180#true} {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} #87#return; {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 11:22:56,702 INFO L290 TraceCheckUtils]: 42: Hoare triple {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-28 11:22:56,703 INFO L272 TraceCheckUtils]: 43: Hoare triple {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:56,703 INFO L290 TraceCheckUtils]: 44: Hoare triple {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:56,704 INFO L290 TraceCheckUtils]: 45: Hoare triple {3322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3181#false} is VALID [2022-04-28 11:22:56,704 INFO L290 TraceCheckUtils]: 46: Hoare triple {3181#false} assume !false; {3181#false} is VALID [2022-04-28 11:22:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 11:22:56,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:23:02,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {3181#false} assume !false; {3181#false} is VALID [2022-04-28 11:23:02,922 INFO L290 TraceCheckUtils]: 45: Hoare triple {3322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3181#false} is VALID [2022-04-28 11:23:02,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:02,923 INFO L272 TraceCheckUtils]: 43: Hoare triple {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:23:02,923 INFO L290 TraceCheckUtils]: 42: Hoare triple {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} assume !!(~r~0 >= 2 * ~b~0); {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-28 11:23:02,924 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3180#true} {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #87#return; {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 11:23:02,924 INFO L290 TraceCheckUtils]: 40: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:23:02,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:23:02,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:23:02,924 INFO L272 TraceCheckUtils]: 37: Hoare triple {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:23:02,925 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3180#true} {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #85#return; {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 11:23:02,925 INFO L290 TraceCheckUtils]: 35: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:23:02,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:23:02,925 INFO L290 TraceCheckUtils]: 33: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:23:02,926 INFO L272 TraceCheckUtils]: 32: Hoare triple {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:23:02,926 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} {3180#true} #83#return; {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 11:23:02,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:02,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {3384#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:02,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {3180#true} ~cond := #in~cond; {3384#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:23:02,928 INFO L272 TraceCheckUtils]: 27: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:23:02,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {3180#true} assume !!(#t~post7 < 2);havoc #t~post7; {3180#true} is VALID [2022-04-28 11:23:02,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {3180#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3180#true} is VALID [2022-04-28 11:23:02,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {3180#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3180#true} is VALID [2022-04-28 11:23:02,928 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3180#true} {3180#true} #81#return; {3180#true} is VALID [2022-04-28 11:23:02,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:23:02,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:23:02,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:23:02,929 INFO L272 TraceCheckUtils]: 19: Hoare triple {3180#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:23:02,929 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3180#true} {3180#true} #79#return; {3180#true} is VALID [2022-04-28 11:23:02,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:23:02,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:23:02,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:23:02,929 INFO L272 TraceCheckUtils]: 14: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:23:02,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#true} assume !!(#t~post6 < 2);havoc #t~post6; {3180#true} is VALID [2022-04-28 11:23:02,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3180#true} is VALID [2022-04-28 11:23:02,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {3180#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3180#true} is VALID [2022-04-28 11:23:02,930 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3180#true} {3180#true} #77#return; {3180#true} is VALID [2022-04-28 11:23:02,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:23:02,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:23:02,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:23:02,930 INFO L272 TraceCheckUtils]: 6: Hoare triple {3180#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:23:02,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {3180#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3180#true} is VALID [2022-04-28 11:23:02,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {3180#true} call #t~ret8 := main(); {3180#true} is VALID [2022-04-28 11:23:02,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3180#true} {3180#true} #93#return; {3180#true} is VALID [2022-04-28 11:23:02,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:23:02,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {3180#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3180#true} is VALID [2022-04-28 11:23:02,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {3180#true} call ULTIMATE.init(); {3180#true} is VALID [2022-04-28 11:23:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 11:23:02,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:23:02,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997309047] [2022-04-28 11:23:02,932 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:23:02,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847180166] [2022-04-28 11:23:02,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847180166] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:23:02,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:23:02,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 11:23:02,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:23:02,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [947032843] [2022-04-28 11:23:02,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [947032843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:02,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:02,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:23:02,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372615144] [2022-04-28 11:23:02,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:23:02,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-28 11:23:02,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:23:02,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 11:23:02,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:02,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:23:02,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:02,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:23:02,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:23:02,968 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 11:23:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:03,307 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2022-04-28 11:23:03,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:23:03,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-28 11:23:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:23:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 11:23:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 11:23:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 11:23:03,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 11:23:03,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 11:23:03,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:03,359 INFO L225 Difference]: With dead ends: 88 [2022-04-28 11:23:03,359 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 11:23:03,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:23:03,360 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:23:03,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 115 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:23:03,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 11:23:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-28 11:23:03,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:23:03,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:23:03,444 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:23:03,445 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:23:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:03,448 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-28 11:23:03,448 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-28 11:23:03,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:03,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:03,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 86 states. [2022-04-28 11:23:03,449 INFO L87 Difference]: Start difference. First operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 86 states. [2022-04-28 11:23:03,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:03,452 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-28 11:23:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-28 11:23:03,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:03,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:03,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:23:03,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:23:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:23:03,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2022-04-28 11:23:03,456 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 47 [2022-04-28 11:23:03,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:23:03,456 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2022-04-28 11:23:03,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 11:23:03,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 108 transitions. [2022-04-28 11:23:03,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:03,561 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-28 11:23:03,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 11:23:03,562 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:23:03,562 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:23:03,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 11:23:03,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:23:03,767 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:23:03,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:23:03,768 INFO L85 PathProgramCache]: Analyzing trace with hash -589126939, now seen corresponding path program 1 times [2022-04-28 11:23:03,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:03,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1313329575] [2022-04-28 11:23:18,021 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:23:18,021 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:23:18,021 INFO L85 PathProgramCache]: Analyzing trace with hash -589126939, now seen corresponding path program 2 times [2022-04-28 11:23:18,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:23:18,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558947620] [2022-04-28 11:23:18,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:23:18,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:23:18,033 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:23:18,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [149588300] [2022-04-28 11:23:18,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:23:18,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:23:18,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:23:18,039 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:23:18,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 11:23:18,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:23:18,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:23:18,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:23:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:23:18,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:23:18,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {3997#true} call ULTIMATE.init(); {3997#true} is VALID [2022-04-28 11:23:18,354 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; {3997#true} is VALID [2022-04-28 11:23:18,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:18,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3997#true} {3997#true} #93#return; {3997#true} is VALID [2022-04-28 11:23:18,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {3997#true} call #t~ret8 := main(); {3997#true} is VALID [2022-04-28 11:23:18,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {3997#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; {3997#true} is VALID [2022-04-28 11:23:18,355 INFO L272 TraceCheckUtils]: 6: Hoare triple {3997#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:23:18,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:23:18,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:23:18,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:18,355 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3997#true} {3997#true} #77#return; {3997#true} is VALID [2022-04-28 11:23:18,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {3997#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:18,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:18,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 2);havoc #t~post6; {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:18,356 INFO L272 TraceCheckUtils]: 14: Hoare triple {4035#(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)); {3997#true} is VALID [2022-04-28 11:23:18,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:23:18,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:23:18,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:18,357 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3997#true} {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:18,357 INFO L272 TraceCheckUtils]: 19: Hoare triple {4035#(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)); {3997#true} is VALID [2022-04-28 11:23:18,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:23:18,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:23:18,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:18,358 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3997#true} {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:18,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {4075#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:18,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {4075#(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; {4075#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:18,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {4075#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 2);havoc #t~post7; {4075#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:18,360 INFO L272 TraceCheckUtils]: 27: Hoare triple {4075#(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)); {3997#true} is VALID [2022-04-28 11:23:18,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:23:18,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:23:18,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:18,361 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3997#true} {4075#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {4075#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:18,361 INFO L272 TraceCheckUtils]: 32: Hoare triple {4075#(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)); {3997#true} is VALID [2022-04-28 11:23:18,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:23:18,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:23:18,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:18,361 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3997#true} {4075#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {4075#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:18,361 INFO L272 TraceCheckUtils]: 37: Hoare triple {4075#(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)); {3997#true} is VALID [2022-04-28 11:23:18,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:23:18,362 INFO L290 TraceCheckUtils]: 39: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:23:18,362 INFO L290 TraceCheckUtils]: 40: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:18,362 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3997#true} {4075#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {4075#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:18,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {4075#(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); {4075#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:18,363 INFO L290 TraceCheckUtils]: 43: Hoare triple {4075#(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; {4133#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-28 11:23:18,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {4133#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4133#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-28 11:23:18,364 INFO L290 TraceCheckUtils]: 45: Hoare triple {4133#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} assume !(#t~post6 < 2);havoc #t~post6; {4133#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-28 11:23:18,365 INFO L272 TraceCheckUtils]: 46: Hoare triple {4133#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4143#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:23:18,365 INFO L290 TraceCheckUtils]: 47: Hoare triple {4143#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4147#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:18,365 INFO L290 TraceCheckUtils]: 48: Hoare triple {4147#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3998#false} is VALID [2022-04-28 11:23:18,365 INFO L290 TraceCheckUtils]: 49: Hoare triple {3998#false} assume !false; {3998#false} is VALID [2022-04-28 11:23:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 11:23:18,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:23:29,977 INFO L290 TraceCheckUtils]: 49: Hoare triple {3998#false} assume !false; {3998#false} is VALID [2022-04-28 11:23:29,980 INFO L290 TraceCheckUtils]: 48: Hoare triple {4147#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3998#false} is VALID [2022-04-28 11:23:29,980 INFO L290 TraceCheckUtils]: 47: Hoare triple {4143#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4147#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:29,981 INFO L272 TraceCheckUtils]: 46: Hoare triple {4163#(= (+ (* 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)); {4143#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:23:29,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {4163#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 2);havoc #t~post6; {4163#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:29,982 INFO L290 TraceCheckUtils]: 44: Hoare triple {4163#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4163#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:29,991 INFO L290 TraceCheckUtils]: 43: Hoare triple {4173#(= 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; {4163#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:29,992 INFO L290 TraceCheckUtils]: 42: Hoare triple {4173#(= 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); {4173#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:23:29,992 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3997#true} {4173#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #87#return; {4173#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:23:29,992 INFO L290 TraceCheckUtils]: 40: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:29,992 INFO L290 TraceCheckUtils]: 39: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:23:29,993 INFO L290 TraceCheckUtils]: 38: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:23:29,993 INFO L272 TraceCheckUtils]: 37: Hoare triple {4173#(= 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)); {3997#true} is VALID [2022-04-28 11:23:29,993 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3997#true} {4173#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #85#return; {4173#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:23:29,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:29,994 INFO L290 TraceCheckUtils]: 34: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:23:29,994 INFO L290 TraceCheckUtils]: 33: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:23:29,994 INFO L272 TraceCheckUtils]: 32: Hoare triple {4173#(= 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)); {3997#true} is VALID [2022-04-28 11:23:29,994 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3997#true} {4173#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #83#return; {4173#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:23:29,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:29,995 INFO L290 TraceCheckUtils]: 29: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:23:29,995 INFO L290 TraceCheckUtils]: 28: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:23:29,995 INFO L272 TraceCheckUtils]: 27: Hoare triple {4173#(= 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)); {3997#true} is VALID [2022-04-28 11:23:29,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {4173#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !!(#t~post7 < 2);havoc #t~post7; {4173#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:23:29,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {4173#(= 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; {4173#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:23:29,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {4173#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:23:29,997 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3997#true} {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:29,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:29,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:23:29,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:23:29,998 INFO L272 TraceCheckUtils]: 19: Hoare triple {4035#(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)); {3997#true} is VALID [2022-04-28 11:23:29,998 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3997#true} {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:29,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:29,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:23:29,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:23:29,999 INFO L272 TraceCheckUtils]: 14: Hoare triple {4035#(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)); {3997#true} is VALID [2022-04-28 11:23:29,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 2);havoc #t~post6; {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:30,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:30,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {3997#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {4035#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:30,000 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3997#true} {3997#true} #77#return; {3997#true} is VALID [2022-04-28 11:23:30,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:30,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:23:30,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:23:30,001 INFO L272 TraceCheckUtils]: 6: Hoare triple {3997#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:23:30,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {3997#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; {3997#true} is VALID [2022-04-28 11:23:30,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {3997#true} call #t~ret8 := main(); {3997#true} is VALID [2022-04-28 11:23:30,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3997#true} {3997#true} #93#return; {3997#true} is VALID [2022-04-28 11:23:30,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:30,004 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; {3997#true} is VALID [2022-04-28 11:23:30,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {3997#true} call ULTIMATE.init(); {3997#true} is VALID [2022-04-28 11:23:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 11:23:30,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:23:30,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558947620] [2022-04-28 11:23:30,004 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:23:30,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149588300] [2022-04-28 11:23:30,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149588300] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:23:30,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:23:30,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 11:23:30,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:23:30,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1313329575] [2022-04-28 11:23:30,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1313329575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:30,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:30,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:23:30,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850505366] [2022-04-28 11:23:30,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:23:30,006 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 50 [2022-04-28 11:23:30,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:23:30,006 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:23:30,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:30,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:23:30,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:30,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:23:30,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:23:30,044 INFO L87 Difference]: Start difference. First operand 86 states and 108 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:23:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:30,672 INFO L93 Difference]: Finished difference Result 122 states and 158 transitions. [2022-04-28 11:23:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:23:30,672 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 50 [2022-04-28 11:23:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:23:30,673 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:23:30,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2022-04-28 11:23:30,675 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:23:30,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2022-04-28 11:23:30,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 108 transitions. [2022-04-28 11:23:30,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:30,786 INFO L225 Difference]: With dead ends: 122 [2022-04-28 11:23:30,786 INFO L226 Difference]: Without dead ends: 119 [2022-04-28 11:23:30,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:23:30,787 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 25 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:23:30,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 235 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:23:30,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-28 11:23:30,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2022-04-28 11:23:30,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:23:30,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 114 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 72 states have internal predecessors, (85), 32 states have call successors, (32), 12 states have call predecessors, (32), 11 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:23:30,901 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 114 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 72 states have internal predecessors, (85), 32 states have call successors, (32), 12 states have call predecessors, (32), 11 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:23:30,901 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 114 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 72 states have internal predecessors, (85), 32 states have call successors, (32), 12 states have call predecessors, (32), 11 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:23:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:30,905 INFO L93 Difference]: Finished difference Result 119 states and 153 transitions. [2022-04-28 11:23:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 153 transitions. [2022-04-28 11:23:30,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:30,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:30,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 72 states have internal predecessors, (85), 32 states have call successors, (32), 12 states have call predecessors, (32), 11 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 119 states. [2022-04-28 11:23:30,906 INFO L87 Difference]: Start difference. First operand has 114 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 72 states have internal predecessors, (85), 32 states have call successors, (32), 12 states have call predecessors, (32), 11 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 119 states. [2022-04-28 11:23:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:30,910 INFO L93 Difference]: Finished difference Result 119 states and 153 transitions. [2022-04-28 11:23:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 153 transitions. [2022-04-28 11:23:30,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:30,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:30,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:23:30,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:23:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 72 states have internal predecessors, (85), 32 states have call successors, (32), 12 states have call predecessors, (32), 11 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:23:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 147 transitions. [2022-04-28 11:23:30,915 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 147 transitions. Word has length 50 [2022-04-28 11:23:30,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:23:30,915 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 147 transitions. [2022-04-28 11:23:30,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 11:23:30,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 147 transitions. [2022-04-28 11:23:31,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 147 transitions. [2022-04-28 11:23:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 11:23:31,084 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:23:31,085 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:23:31,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 11:23:31,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 11:23:31,292 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:23:31,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:23:31,292 INFO L85 PathProgramCache]: Analyzing trace with hash 765609565, now seen corresponding path program 1 times [2022-04-28 11:23:31,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:31,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2010155632] [2022-04-28 11:23:42,167 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:23:42,168 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:23:42,168 INFO L85 PathProgramCache]: Analyzing trace with hash 765609565, now seen corresponding path program 2 times [2022-04-28 11:23:42,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:23:42,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417211875] [2022-04-28 11:23:42,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:23:42,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:23:42,196 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:23:42,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [259335238] [2022-04-28 11:23:42,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:23:42,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:23:42,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:23:42,200 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:23:42,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 11:23:42,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:23:42,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:23:42,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 11:23:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:23:42,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:23:42,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {5017#true} call ULTIMATE.init(); {5017#true} is VALID [2022-04-28 11:23:42,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {5017#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; {5017#true} is VALID [2022-04-28 11:23:42,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {5017#true} assume true; {5017#true} is VALID [2022-04-28 11:23:42,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5017#true} {5017#true} #93#return; {5017#true} is VALID [2022-04-28 11:23:42,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {5017#true} call #t~ret8 := main(); {5017#true} is VALID [2022-04-28 11:23:42,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {5017#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; {5017#true} is VALID [2022-04-28 11:23:42,693 INFO L272 TraceCheckUtils]: 6: Hoare triple {5017#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5017#true} is VALID [2022-04-28 11:23:42,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {5017#true} ~cond := #in~cond; {5043#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:23:42,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {5043#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {5047#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:23:42,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {5047#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5047#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:23:42,696 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5047#(not (= |assume_abort_if_not_#in~cond| 0))} {5017#true} #77#return; {5054#(<= 1 main_~y~0)} is VALID [2022-04-28 11:23:42,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {5054#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {5058#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:23:42,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {5058#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5058#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:23:42,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {5058#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post6 < 2);havoc #t~post6; {5058#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:23:42,698 INFO L272 TraceCheckUtils]: 14: Hoare triple {5058#(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)); {5017#true} is VALID [2022-04-28 11:23:42,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {5017#true} ~cond := #in~cond; {5017#true} is VALID [2022-04-28 11:23:42,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {5017#true} assume !(0 == ~cond); {5017#true} is VALID [2022-04-28 11:23:42,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {5017#true} assume true; {5017#true} is VALID [2022-04-28 11:23:42,698 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5017#true} {5058#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #79#return; {5058#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:23:42,698 INFO L272 TraceCheckUtils]: 19: Hoare triple {5058#(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)); {5017#true} is VALID [2022-04-28 11:23:42,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {5017#true} ~cond := #in~cond; {5017#true} is VALID [2022-04-28 11:23:42,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {5017#true} assume !(0 == ~cond); {5017#true} is VALID [2022-04-28 11:23:42,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {5017#true} assume true; {5017#true} is VALID [2022-04-28 11:23:42,699 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5017#true} {5058#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #81#return; {5058#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:23:42,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {5058#(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; {5098#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:23:42,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {5098#(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; {5098#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:23:42,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {5098#(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 < 2);havoc #t~post7; {5098#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:23:42,700 INFO L272 TraceCheckUtils]: 27: Hoare triple {5098#(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)); {5017#true} is VALID [2022-04-28 11:23:42,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {5017#true} ~cond := #in~cond; {5017#true} is VALID [2022-04-28 11:23:42,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {5017#true} assume !(0 == ~cond); {5017#true} is VALID [2022-04-28 11:23:42,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {5017#true} assume true; {5017#true} is VALID [2022-04-28 11:23:42,703 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5017#true} {5098#(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; {5098#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:23:42,704 INFO L272 TraceCheckUtils]: 32: Hoare triple {5098#(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)); {5017#true} is VALID [2022-04-28 11:23:42,704 INFO L290 TraceCheckUtils]: 33: Hoare triple {5017#true} ~cond := #in~cond; {5017#true} is VALID [2022-04-28 11:23:42,704 INFO L290 TraceCheckUtils]: 34: Hoare triple {5017#true} assume !(0 == ~cond); {5017#true} is VALID [2022-04-28 11:23:42,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {5017#true} assume true; {5017#true} is VALID [2022-04-28 11:23:42,705 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5017#true} {5098#(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; {5098#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:23:42,705 INFO L272 TraceCheckUtils]: 37: Hoare triple {5098#(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)); {5017#true} is VALID [2022-04-28 11:23:42,705 INFO L290 TraceCheckUtils]: 38: Hoare triple {5017#true} ~cond := #in~cond; {5017#true} is VALID [2022-04-28 11:23:42,705 INFO L290 TraceCheckUtils]: 39: Hoare triple {5017#true} assume !(0 == ~cond); {5017#true} is VALID [2022-04-28 11:23:42,705 INFO L290 TraceCheckUtils]: 40: Hoare triple {5017#true} assume true; {5017#true} is VALID [2022-04-28 11:23:42,706 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5017#true} {5098#(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; {5098#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:23:42,706 INFO L290 TraceCheckUtils]: 42: Hoare triple {5098#(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); {5098#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:23:42,706 INFO L272 TraceCheckUtils]: 43: Hoare triple {5098#(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)); {5017#true} is VALID [2022-04-28 11:23:42,706 INFO L290 TraceCheckUtils]: 44: Hoare triple {5017#true} ~cond := #in~cond; {5017#true} is VALID [2022-04-28 11:23:42,706 INFO L290 TraceCheckUtils]: 45: Hoare triple {5017#true} assume !(0 == ~cond); {5017#true} is VALID [2022-04-28 11:23:42,706 INFO L290 TraceCheckUtils]: 46: Hoare triple {5017#true} assume true; {5017#true} is VALID [2022-04-28 11:23:42,707 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5017#true} {5098#(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; {5098#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:23:42,707 INFO L290 TraceCheckUtils]: 48: Hoare triple {5098#(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; {5171#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:23:42,708 INFO L290 TraceCheckUtils]: 49: Hoare triple {5171#(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; {5171#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:23:42,708 INFO L290 TraceCheckUtils]: 50: Hoare triple {5171#(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 < 2);havoc #t~post7; {5171#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:23:42,709 INFO L290 TraceCheckUtils]: 51: Hoare triple {5171#(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))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {5181#(and (= main_~q~0 2) (<= 1 main_~y~0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:23:42,709 INFO L290 TraceCheckUtils]: 52: Hoare triple {5181#(and (= main_~q~0 2) (<= 1 main_~y~0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5181#(and (= main_~q~0 2) (<= 1 main_~y~0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:23:42,710 INFO L290 TraceCheckUtils]: 53: Hoare triple {5181#(and (= main_~q~0 2) (<= 1 main_~y~0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} assume !(#t~post6 < 2);havoc #t~post6; {5181#(and (= main_~q~0 2) (<= 1 main_~y~0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:23:42,710 INFO L272 TraceCheckUtils]: 54: Hoare triple {5181#(and (= main_~q~0 2) (<= 1 main_~y~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)); {5191#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:23:42,711 INFO L290 TraceCheckUtils]: 55: Hoare triple {5191#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5195#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:42,711 INFO L290 TraceCheckUtils]: 56: Hoare triple {5195#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5018#false} is VALID [2022-04-28 11:23:42,711 INFO L290 TraceCheckUtils]: 57: Hoare triple {5018#false} assume !false; {5018#false} is VALID [2022-04-28 11:23:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:23:42,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:23:43,005 INFO L290 TraceCheckUtils]: 57: Hoare triple {5018#false} assume !false; {5018#false} is VALID [2022-04-28 11:23:43,005 INFO L290 TraceCheckUtils]: 56: Hoare triple {5195#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5018#false} is VALID [2022-04-28 11:23:43,006 INFO L290 TraceCheckUtils]: 55: Hoare triple {5191#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5195#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:43,007 INFO L272 TraceCheckUtils]: 54: Hoare triple {5211#(= (+ (* 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)); {5191#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:23:43,007 INFO L290 TraceCheckUtils]: 53: Hoare triple {5211#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 2);havoc #t~post6; {5211#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:43,007 INFO L290 TraceCheckUtils]: 52: Hoare triple {5211#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5211#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:43,016 INFO L290 TraceCheckUtils]: 51: Hoare triple {5221#(= 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; {5211#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:43,017 INFO L290 TraceCheckUtils]: 50: Hoare triple {5221#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(#t~post7 < 2);havoc #t~post7; {5221#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:23:43,017 INFO L290 TraceCheckUtils]: 49: Hoare triple {5221#(= 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; {5221#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:23:43,021 INFO L290 TraceCheckUtils]: 48: Hoare triple {5231#(= (+ (* (- 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; {5221#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:23:43,021 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5017#true} {5231#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #89#return; {5231#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:43,021 INFO L290 TraceCheckUtils]: 46: Hoare triple {5017#true} assume true; {5017#true} is VALID [2022-04-28 11:23:43,021 INFO L290 TraceCheckUtils]: 45: Hoare triple {5017#true} assume !(0 == ~cond); {5017#true} is VALID [2022-04-28 11:23:43,022 INFO L290 TraceCheckUtils]: 44: Hoare triple {5017#true} ~cond := #in~cond; {5017#true} is VALID [2022-04-28 11:23:43,022 INFO L272 TraceCheckUtils]: 43: Hoare triple {5231#(= (+ (* (- 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)); {5017#true} is VALID [2022-04-28 11:23:43,022 INFO L290 TraceCheckUtils]: 42: Hoare triple {5231#(= (+ (* (- 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); {5231#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:43,023 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5017#true} {5231#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #87#return; {5231#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:43,023 INFO L290 TraceCheckUtils]: 40: Hoare triple {5017#true} assume true; {5017#true} is VALID [2022-04-28 11:23:43,023 INFO L290 TraceCheckUtils]: 39: Hoare triple {5017#true} assume !(0 == ~cond); {5017#true} is VALID [2022-04-28 11:23:43,023 INFO L290 TraceCheckUtils]: 38: Hoare triple {5017#true} ~cond := #in~cond; {5017#true} is VALID [2022-04-28 11:23:43,023 INFO L272 TraceCheckUtils]: 37: Hoare triple {5231#(= (+ (* (- 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)); {5017#true} is VALID [2022-04-28 11:23:43,024 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5017#true} {5231#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #85#return; {5231#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:43,024 INFO L290 TraceCheckUtils]: 35: Hoare triple {5017#true} assume true; {5017#true} is VALID [2022-04-28 11:23:43,024 INFO L290 TraceCheckUtils]: 34: Hoare triple {5017#true} assume !(0 == ~cond); {5017#true} is VALID [2022-04-28 11:23:43,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {5017#true} ~cond := #in~cond; {5017#true} is VALID [2022-04-28 11:23:43,024 INFO L272 TraceCheckUtils]: 32: Hoare triple {5231#(= (+ (* (- 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)); {5017#true} is VALID [2022-04-28 11:23:43,025 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5017#true} {5231#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #83#return; {5231#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:43,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {5017#true} assume true; {5017#true} is VALID [2022-04-28 11:23:43,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {5017#true} assume !(0 == ~cond); {5017#true} is VALID [2022-04-28 11:23:43,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {5017#true} ~cond := #in~cond; {5017#true} is VALID [2022-04-28 11:23:43,025 INFO L272 TraceCheckUtils]: 27: Hoare triple {5231#(= (+ (* (- 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)); {5017#true} is VALID [2022-04-28 11:23:43,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {5231#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 2);havoc #t~post7; {5231#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:43,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {5231#(= (+ (* (- 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; {5231#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:43,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {5211#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {5231#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:43,027 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5017#true} {5211#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #81#return; {5211#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:43,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {5017#true} assume true; {5017#true} is VALID [2022-04-28 11:23:43,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {5017#true} assume !(0 == ~cond); {5017#true} is VALID [2022-04-28 11:23:43,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {5017#true} ~cond := #in~cond; {5017#true} is VALID [2022-04-28 11:23:43,028 INFO L272 TraceCheckUtils]: 19: Hoare triple {5211#(= (+ (* 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)); {5017#true} is VALID [2022-04-28 11:23:43,028 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5017#true} {5211#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {5211#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:43,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {5017#true} assume true; {5017#true} is VALID [2022-04-28 11:23:43,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {5017#true} assume !(0 == ~cond); {5017#true} is VALID [2022-04-28 11:23:43,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {5017#true} ~cond := #in~cond; {5017#true} is VALID [2022-04-28 11:23:43,029 INFO L272 TraceCheckUtils]: 14: Hoare triple {5211#(= (+ (* 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)); {5017#true} is VALID [2022-04-28 11:23:43,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {5211#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 2);havoc #t~post6; {5211#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:43,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {5211#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5211#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:43,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {5017#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {5211#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:43,030 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5017#true} {5017#true} #77#return; {5017#true} is VALID [2022-04-28 11:23:43,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {5017#true} assume true; {5017#true} is VALID [2022-04-28 11:23:43,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {5017#true} assume !(0 == ~cond); {5017#true} is VALID [2022-04-28 11:23:43,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {5017#true} ~cond := #in~cond; {5017#true} is VALID [2022-04-28 11:23:43,030 INFO L272 TraceCheckUtils]: 6: Hoare triple {5017#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5017#true} is VALID [2022-04-28 11:23:43,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {5017#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; {5017#true} is VALID [2022-04-28 11:23:43,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {5017#true} call #t~ret8 := main(); {5017#true} is VALID [2022-04-28 11:23:43,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5017#true} {5017#true} #93#return; {5017#true} is VALID [2022-04-28 11:23:43,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {5017#true} assume true; {5017#true} is VALID [2022-04-28 11:23:43,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {5017#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; {5017#true} is VALID [2022-04-28 11:23:43,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {5017#true} call ULTIMATE.init(); {5017#true} is VALID [2022-04-28 11:23:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-04-28 11:23:43,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:23:43,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417211875] [2022-04-28 11:23:43,031 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:23:43,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259335238] [2022-04-28 11:23:43,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259335238] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:23:43,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:23:43,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2022-04-28 11:23:43,032 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:23:43,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2010155632] [2022-04-28 11:23:43,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2010155632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:43,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:43,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 11:23:43,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055722413] [2022-04-28 11:23:43,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:23:43,033 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 58 [2022-04-28 11:23:43,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:23:43,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:23:43,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:43,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 11:23:43,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:43,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 11:23:43,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:23:43,070 INFO L87 Difference]: Start difference. First operand 114 states and 147 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:23:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:44,035 INFO L93 Difference]: Finished difference Result 158 states and 211 transitions. [2022-04-28 11:23:44,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:23:44,036 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 58 [2022-04-28 11:23:44,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:23:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:23:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2022-04-28 11:23:44,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:23:44,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2022-04-28 11:23:44,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 123 transitions. [2022-04-28 11:23:44,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:44,165 INFO L225 Difference]: With dead ends: 158 [2022-04-28 11:23:44,166 INFO L226 Difference]: Without dead ends: 155 [2022-04-28 11:23:44,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-04-28 11:23:44,166 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 62 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:23:44,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 295 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 11:23:44,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-28 11:23:44,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 130. [2022-04-28 11:23:44,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:23:44,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 130 states, 80 states have (on average 1.2125) internal successors, (97), 83 states have internal predecessors, (97), 37 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 11:23:44,302 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 130 states, 80 states have (on average 1.2125) internal successors, (97), 83 states have internal predecessors, (97), 37 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 11:23:44,303 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 130 states, 80 states have (on average 1.2125) internal successors, (97), 83 states have internal predecessors, (97), 37 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 11:23:44,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:44,308 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2022-04-28 11:23:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 206 transitions. [2022-04-28 11:23:44,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:44,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:44,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 80 states have (on average 1.2125) internal successors, (97), 83 states have internal predecessors, (97), 37 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) Second operand 155 states. [2022-04-28 11:23:44,309 INFO L87 Difference]: Start difference. First operand has 130 states, 80 states have (on average 1.2125) internal successors, (97), 83 states have internal predecessors, (97), 37 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) Second operand 155 states. [2022-04-28 11:23:44,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:44,314 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2022-04-28 11:23:44,314 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 206 transitions. [2022-04-28 11:23:44,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:44,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:44,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:23:44,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:23:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.2125) internal successors, (97), 83 states have internal predecessors, (97), 37 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 11:23:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 169 transitions. [2022-04-28 11:23:44,319 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 169 transitions. Word has length 58 [2022-04-28 11:23:44,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:23:44,319 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 169 transitions. [2022-04-28 11:23:44,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:23:44,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 169 transitions. [2022-04-28 11:23:44,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 169 transitions. [2022-04-28 11:23:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 11:23:44,531 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:23:44,531 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:23:44,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 11:23:44,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 11:23:44,732 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:23:44,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:23:44,733 INFO L85 PathProgramCache]: Analyzing trace with hash 78053411, now seen corresponding path program 1 times [2022-04-28 11:23:44,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:44,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [969009169] [2022-04-28 11:24:03,311 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:24:03,312 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:24:03,312 INFO L85 PathProgramCache]: Analyzing trace with hash 78053411, now seen corresponding path program 2 times [2022-04-28 11:24:03,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:03,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346757466] [2022-04-28 11:24:03,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:03,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:03,325 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:03,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1754311336] [2022-04-28 11:24:03,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:24:03,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:03,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:03,328 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:24:03,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 11:24:03,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:24:03,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:03,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:24:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:03,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:03,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {6268#true} call ULTIMATE.init(); {6268#true} is VALID [2022-04-28 11:24:03,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {6268#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; {6276#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:03,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {6276#(<= 0 ~counter~0)} assume true; {6276#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:03,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6276#(<= 0 ~counter~0)} {6268#true} #93#return; {6276#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:03,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {6276#(<= 0 ~counter~0)} call #t~ret8 := main(); {6276#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:03,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {6276#(<= 0 ~counter~0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6276#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:03,645 INFO L272 TraceCheckUtils]: 6: Hoare triple {6276#(<= 0 ~counter~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6276#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:03,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {6276#(<= 0 ~counter~0)} ~cond := #in~cond; {6276#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:03,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {6276#(<= 0 ~counter~0)} assume !(0 == ~cond); {6276#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:03,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {6276#(<= 0 ~counter~0)} assume true; {6276#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:03,655 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6276#(<= 0 ~counter~0)} {6276#(<= 0 ~counter~0)} #77#return; {6276#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:03,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {6276#(<= 0 ~counter~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {6276#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:03,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {6276#(<= 0 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6310#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:03,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {6310#(<= 1 ~counter~0)} assume !!(#t~post6 < 2);havoc #t~post6; {6310#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:03,656 INFO L272 TraceCheckUtils]: 14: Hoare triple {6310#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6310#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:03,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {6310#(<= 1 ~counter~0)} ~cond := #in~cond; {6310#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:03,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {6310#(<= 1 ~counter~0)} assume !(0 == ~cond); {6310#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:03,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {6310#(<= 1 ~counter~0)} assume true; {6310#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:03,658 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6310#(<= 1 ~counter~0)} {6310#(<= 1 ~counter~0)} #79#return; {6310#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:03,658 INFO L272 TraceCheckUtils]: 19: Hoare triple {6310#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6310#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:03,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {6310#(<= 1 ~counter~0)} ~cond := #in~cond; {6310#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:03,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {6310#(<= 1 ~counter~0)} assume !(0 == ~cond); {6310#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:03,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {6310#(<= 1 ~counter~0)} assume true; {6310#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:03,665 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6310#(<= 1 ~counter~0)} {6310#(<= 1 ~counter~0)} #81#return; {6310#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:03,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {6310#(<= 1 ~counter~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {6310#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:03,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {6310#(<= 1 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {6350#(<= 2 ~counter~0)} assume !!(#t~post7 < 2);havoc #t~post7; {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,667 INFO L272 TraceCheckUtils]: 27: Hoare triple {6350#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,667 INFO L290 TraceCheckUtils]: 28: Hoare triple {6350#(<= 2 ~counter~0)} ~cond := #in~cond; {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {6350#(<= 2 ~counter~0)} assume !(0 == ~cond); {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {6350#(<= 2 ~counter~0)} assume true; {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,668 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6350#(<= 2 ~counter~0)} {6350#(<= 2 ~counter~0)} #83#return; {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,669 INFO L272 TraceCheckUtils]: 32: Hoare triple {6350#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {6350#(<= 2 ~counter~0)} ~cond := #in~cond; {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {6350#(<= 2 ~counter~0)} assume !(0 == ~cond); {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {6350#(<= 2 ~counter~0)} assume true; {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,670 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6350#(<= 2 ~counter~0)} {6350#(<= 2 ~counter~0)} #85#return; {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,671 INFO L272 TraceCheckUtils]: 37: Hoare triple {6350#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {6350#(<= 2 ~counter~0)} ~cond := #in~cond; {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,671 INFO L290 TraceCheckUtils]: 39: Hoare triple {6350#(<= 2 ~counter~0)} assume !(0 == ~cond); {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,671 INFO L290 TraceCheckUtils]: 40: Hoare triple {6350#(<= 2 ~counter~0)} assume true; {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,672 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6350#(<= 2 ~counter~0)} {6350#(<= 2 ~counter~0)} #87#return; {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {6350#(<= 2 ~counter~0)} assume !(~r~0 >= 2 * ~b~0); {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,672 INFO L290 TraceCheckUtils]: 43: Hoare triple {6350#(<= 2 ~counter~0)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,673 INFO L290 TraceCheckUtils]: 44: Hoare triple {6350#(<= 2 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6408#(<= 2 |main_#t~post6|)} is VALID [2022-04-28 11:24:03,673 INFO L290 TraceCheckUtils]: 45: Hoare triple {6408#(<= 2 |main_#t~post6|)} assume !!(#t~post6 < 2);havoc #t~post6; {6269#false} is VALID [2022-04-28 11:24:03,673 INFO L272 TraceCheckUtils]: 46: Hoare triple {6269#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6269#false} is VALID [2022-04-28 11:24:03,673 INFO L290 TraceCheckUtils]: 47: Hoare triple {6269#false} ~cond := #in~cond; {6269#false} is VALID [2022-04-28 11:24:03,673 INFO L290 TraceCheckUtils]: 48: Hoare triple {6269#false} assume !(0 == ~cond); {6269#false} is VALID [2022-04-28 11:24:03,673 INFO L290 TraceCheckUtils]: 49: Hoare triple {6269#false} assume true; {6269#false} is VALID [2022-04-28 11:24:03,673 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6269#false} {6269#false} #79#return; {6269#false} is VALID [2022-04-28 11:24:03,673 INFO L272 TraceCheckUtils]: 51: Hoare triple {6269#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6269#false} is VALID [2022-04-28 11:24:03,673 INFO L290 TraceCheckUtils]: 52: Hoare triple {6269#false} ~cond := #in~cond; {6269#false} is VALID [2022-04-28 11:24:03,673 INFO L290 TraceCheckUtils]: 53: Hoare triple {6269#false} assume !(0 == ~cond); {6269#false} is VALID [2022-04-28 11:24:03,673 INFO L290 TraceCheckUtils]: 54: Hoare triple {6269#false} assume true; {6269#false} is VALID [2022-04-28 11:24:03,673 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6269#false} {6269#false} #81#return; {6269#false} is VALID [2022-04-28 11:24:03,674 INFO L290 TraceCheckUtils]: 56: Hoare triple {6269#false} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {6269#false} is VALID [2022-04-28 11:24:03,674 INFO L290 TraceCheckUtils]: 57: Hoare triple {6269#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6269#false} is VALID [2022-04-28 11:24:03,674 INFO L290 TraceCheckUtils]: 58: Hoare triple {6269#false} assume !(#t~post7 < 2);havoc #t~post7; {6269#false} is VALID [2022-04-28 11:24:03,674 INFO L290 TraceCheckUtils]: 59: Hoare triple {6269#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {6269#false} is VALID [2022-04-28 11:24:03,674 INFO L290 TraceCheckUtils]: 60: Hoare triple {6269#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6269#false} is VALID [2022-04-28 11:24:03,674 INFO L290 TraceCheckUtils]: 61: Hoare triple {6269#false} assume !(#t~post6 < 2);havoc #t~post6; {6269#false} is VALID [2022-04-28 11:24:03,674 INFO L272 TraceCheckUtils]: 62: Hoare triple {6269#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6269#false} is VALID [2022-04-28 11:24:03,674 INFO L290 TraceCheckUtils]: 63: Hoare triple {6269#false} ~cond := #in~cond; {6269#false} is VALID [2022-04-28 11:24:03,674 INFO L290 TraceCheckUtils]: 64: Hoare triple {6269#false} assume 0 == ~cond; {6269#false} is VALID [2022-04-28 11:24:03,674 INFO L290 TraceCheckUtils]: 65: Hoare triple {6269#false} assume !false; {6269#false} is VALID [2022-04-28 11:24:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 11:24:03,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:24:03,943 INFO L290 TraceCheckUtils]: 65: Hoare triple {6269#false} assume !false; {6269#false} is VALID [2022-04-28 11:24:03,943 INFO L290 TraceCheckUtils]: 64: Hoare triple {6269#false} assume 0 == ~cond; {6269#false} is VALID [2022-04-28 11:24:03,943 INFO L290 TraceCheckUtils]: 63: Hoare triple {6269#false} ~cond := #in~cond; {6269#false} is VALID [2022-04-28 11:24:03,943 INFO L272 TraceCheckUtils]: 62: Hoare triple {6269#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6269#false} is VALID [2022-04-28 11:24:03,943 INFO L290 TraceCheckUtils]: 61: Hoare triple {6269#false} assume !(#t~post6 < 2);havoc #t~post6; {6269#false} is VALID [2022-04-28 11:24:03,943 INFO L290 TraceCheckUtils]: 60: Hoare triple {6269#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6269#false} is VALID [2022-04-28 11:24:03,943 INFO L290 TraceCheckUtils]: 59: Hoare triple {6269#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {6269#false} is VALID [2022-04-28 11:24:03,943 INFO L290 TraceCheckUtils]: 58: Hoare triple {6269#false} assume !(#t~post7 < 2);havoc #t~post7; {6269#false} is VALID [2022-04-28 11:24:03,943 INFO L290 TraceCheckUtils]: 57: Hoare triple {6269#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6269#false} is VALID [2022-04-28 11:24:03,944 INFO L290 TraceCheckUtils]: 56: Hoare triple {6269#false} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {6269#false} is VALID [2022-04-28 11:24:03,944 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6268#true} {6269#false} #81#return; {6269#false} is VALID [2022-04-28 11:24:03,944 INFO L290 TraceCheckUtils]: 54: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-28 11:24:03,944 INFO L290 TraceCheckUtils]: 53: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-28 11:24:03,944 INFO L290 TraceCheckUtils]: 52: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-28 11:24:03,944 INFO L272 TraceCheckUtils]: 51: Hoare triple {6269#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6268#true} is VALID [2022-04-28 11:24:03,944 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6268#true} {6269#false} #79#return; {6269#false} is VALID [2022-04-28 11:24:03,944 INFO L290 TraceCheckUtils]: 49: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-28 11:24:03,944 INFO L290 TraceCheckUtils]: 48: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-28 11:24:03,944 INFO L290 TraceCheckUtils]: 47: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-28 11:24:03,944 INFO L272 TraceCheckUtils]: 46: Hoare triple {6269#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6268#true} is VALID [2022-04-28 11:24:03,944 INFO L290 TraceCheckUtils]: 45: Hoare triple {6408#(<= 2 |main_#t~post6|)} assume !!(#t~post6 < 2);havoc #t~post6; {6269#false} is VALID [2022-04-28 11:24:03,945 INFO L290 TraceCheckUtils]: 44: Hoare triple {6350#(<= 2 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6408#(<= 2 |main_#t~post6|)} is VALID [2022-04-28 11:24:03,945 INFO L290 TraceCheckUtils]: 43: Hoare triple {6350#(<= 2 ~counter~0)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {6350#(<= 2 ~counter~0)} assume !(~r~0 >= 2 * ~b~0); {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,946 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6268#true} {6350#(<= 2 ~counter~0)} #87#return; {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,946 INFO L290 TraceCheckUtils]: 40: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-28 11:24:03,946 INFO L290 TraceCheckUtils]: 39: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-28 11:24:03,946 INFO L290 TraceCheckUtils]: 38: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-28 11:24:03,946 INFO L272 TraceCheckUtils]: 37: Hoare triple {6350#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {6268#true} is VALID [2022-04-28 11:24:03,947 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6268#true} {6350#(<= 2 ~counter~0)} #85#return; {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-28 11:24:03,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-28 11:24:03,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-28 11:24:03,947 INFO L272 TraceCheckUtils]: 32: Hoare triple {6350#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6268#true} is VALID [2022-04-28 11:24:03,947 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6268#true} {6350#(<= 2 ~counter~0)} #83#return; {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-28 11:24:03,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-28 11:24:03,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-28 11:24:03,947 INFO L272 TraceCheckUtils]: 27: Hoare triple {6350#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6268#true} is VALID [2022-04-28 11:24:03,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {6350#(<= 2 ~counter~0)} assume !!(#t~post7 < 2);havoc #t~post7; {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {6310#(<= 1 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6350#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:03,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {6310#(<= 1 ~counter~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {6310#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:03,949 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6268#true} {6310#(<= 1 ~counter~0)} #81#return; {6310#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:03,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-28 11:24:03,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-28 11:24:03,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-28 11:24:03,949 INFO L272 TraceCheckUtils]: 19: Hoare triple {6310#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6268#true} is VALID [2022-04-28 11:24:03,950 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6268#true} {6310#(<= 1 ~counter~0)} #79#return; {6310#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:03,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-28 11:24:03,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-28 11:24:03,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-28 11:24:03,950 INFO L272 TraceCheckUtils]: 14: Hoare triple {6310#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6268#true} is VALID [2022-04-28 11:24:03,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {6310#(<= 1 ~counter~0)} assume !!(#t~post6 < 2);havoc #t~post6; {6310#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:03,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {6276#(<= 0 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6310#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:03,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {6276#(<= 0 ~counter~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {6276#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:03,951 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6268#true} {6276#(<= 0 ~counter~0)} #77#return; {6276#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:03,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-28 11:24:03,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-28 11:24:03,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-28 11:24:03,952 INFO L272 TraceCheckUtils]: 6: Hoare triple {6276#(<= 0 ~counter~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6268#true} is VALID [2022-04-28 11:24:03,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {6276#(<= 0 ~counter~0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6276#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:03,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {6276#(<= 0 ~counter~0)} call #t~ret8 := main(); {6276#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:03,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6276#(<= 0 ~counter~0)} {6268#true} #93#return; {6276#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:03,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {6276#(<= 0 ~counter~0)} assume true; {6276#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:03,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {6268#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; {6276#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:03,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {6268#true} call ULTIMATE.init(); {6268#true} is VALID [2022-04-28 11:24:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 11:24:03,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:03,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346757466] [2022-04-28 11:24:03,954 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:03,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754311336] [2022-04-28 11:24:03,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754311336] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:24:03,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:24:03,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-04-28 11:24:03,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:03,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [969009169] [2022-04-28 11:24:03,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [969009169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:03,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:03,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:24:03,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653270645] [2022-04-28 11:24:03,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:03,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 66 [2022-04-28 11:24:03,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:03,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 11:24:03,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:03,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:24:03,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:03,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:24:03,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:24:03,994 INFO L87 Difference]: Start difference. First operand 130 states and 169 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 11:24:04,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:04,223 INFO L93 Difference]: Finished difference Result 148 states and 185 transitions. [2022-04-28 11:24:04,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:24:04,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 66 [2022-04-28 11:24:04,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 11:24:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-04-28 11:24:04,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 11:24:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-04-28 11:24:04,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2022-04-28 11:24:04,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:04,293 INFO L225 Difference]: With dead ends: 148 [2022-04-28 11:24:04,293 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 11:24:04,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 11:24:04,294 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 29 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:04,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 93 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:24:04,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 11:24:04,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-28 11:24:04,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:04,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 17 states have call successors, (17), 11 states have call predecessors, (17), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 11:24:04,384 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 17 states have call successors, (17), 11 states have call predecessors, (17), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 11:24:04,385 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 17 states have call successors, (17), 11 states have call predecessors, (17), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 11:24:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:04,386 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-04-28 11:24:04,386 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-04-28 11:24:04,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:04,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:04,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 17 states have call successors, (17), 11 states have call predecessors, (17), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 75 states. [2022-04-28 11:24:04,387 INFO L87 Difference]: Start difference. First operand has 75 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 17 states have call successors, (17), 11 states have call predecessors, (17), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 75 states. [2022-04-28 11:24:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:04,388 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-04-28 11:24:04,388 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-04-28 11:24:04,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:04,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:04,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:04,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:04,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 17 states have call successors, (17), 11 states have call predecessors, (17), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 11:24:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-04-28 11:24:04,391 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 66 [2022-04-28 11:24:04,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:04,391 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-04-28 11:24:04,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-28 11:24:04,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 82 transitions. [2022-04-28 11:24:04,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:04,484 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-04-28 11:24:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 11:24:04,484 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:04,484 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:24:04,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 11:24:04,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 11:24:04,685 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:04,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:04,685 INFO L85 PathProgramCache]: Analyzing trace with hash -554329876, now seen corresponding path program 3 times [2022-04-28 11:24:04,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:04,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1417771935] [2022-04-28 11:24:22,019 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:24:22,019 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:24:22,019 INFO L85 PathProgramCache]: Analyzing trace with hash -554329876, now seen corresponding path program 4 times [2022-04-28 11:24:22,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:22,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826135062] [2022-04-28 11:24:22,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:22,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:22,033 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:22,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887936947] [2022-04-28 11:24:22,034 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:24:22,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:22,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:22,041 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:24:22,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 11:24:22,099 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:24:22,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:22,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 11:24:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:22,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:22,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {7267#true} call ULTIMATE.init(); {7267#true} is VALID [2022-04-28 11:24:22,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {7267#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; {7267#true} is VALID [2022-04-28 11:24:22,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:22,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7267#true} {7267#true} #93#return; {7267#true} is VALID [2022-04-28 11:24:22,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {7267#true} call #t~ret8 := main(); {7267#true} is VALID [2022-04-28 11:24:22,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {7267#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; {7267#true} is VALID [2022-04-28 11:24:22,700 INFO L272 TraceCheckUtils]: 6: Hoare triple {7267#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7267#true} is VALID [2022-04-28 11:24:22,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {7267#true} ~cond := #in~cond; {7293#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:24:22,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {7293#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {7297#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:24:22,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {7297#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {7297#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:24:22,702 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7297#(not (= |assume_abort_if_not_#in~cond| 0))} {7267#true} #77#return; {7304#(<= 1 main_~y~0)} is VALID [2022-04-28 11:24:22,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {7304#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {7308#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {7308#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7308#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {7308#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post6 < 2);havoc #t~post6; {7308#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,703 INFO L272 TraceCheckUtils]: 14: Hoare triple {7308#(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)); {7267#true} is VALID [2022-04-28 11:24:22,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:22,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:22,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:22,703 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7267#true} {7308#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #79#return; {7308#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,704 INFO L272 TraceCheckUtils]: 19: Hoare triple {7308#(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)); {7267#true} is VALID [2022-04-28 11:24:22,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:22,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:22,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:22,712 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7267#true} {7308#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #81#return; {7308#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {7308#(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; {7348#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {7348#(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; {7348#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {7348#(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 < 2);havoc #t~post7; {7348#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,714 INFO L272 TraceCheckUtils]: 27: Hoare triple {7348#(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)); {7267#true} is VALID [2022-04-28 11:24:22,714 INFO L290 TraceCheckUtils]: 28: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:22,714 INFO L290 TraceCheckUtils]: 29: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:22,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:22,715 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7267#true} {7348#(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; {7348#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,716 INFO L272 TraceCheckUtils]: 32: Hoare triple {7348#(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)); {7267#true} is VALID [2022-04-28 11:24:22,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:22,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:22,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:22,717 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7267#true} {7348#(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; {7348#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,717 INFO L272 TraceCheckUtils]: 37: Hoare triple {7348#(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)); {7267#true} is VALID [2022-04-28 11:24:22,717 INFO L290 TraceCheckUtils]: 38: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:22,717 INFO L290 TraceCheckUtils]: 39: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:22,717 INFO L290 TraceCheckUtils]: 40: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:22,718 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7267#true} {7348#(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; {7348#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,718 INFO L290 TraceCheckUtils]: 42: Hoare triple {7348#(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); {7348#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,718 INFO L272 TraceCheckUtils]: 43: Hoare triple {7348#(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)); {7267#true} is VALID [2022-04-28 11:24:22,718 INFO L290 TraceCheckUtils]: 44: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:22,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:22,718 INFO L290 TraceCheckUtils]: 46: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:22,719 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7267#true} {7348#(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; {7348#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,720 INFO L290 TraceCheckUtils]: 48: Hoare triple {7348#(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; {7421#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,720 INFO L290 TraceCheckUtils]: 49: Hoare triple {7421#(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; {7421#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,721 INFO L290 TraceCheckUtils]: 50: Hoare triple {7421#(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 < 2);havoc #t~post7; {7421#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,721 INFO L272 TraceCheckUtils]: 51: Hoare triple {7421#(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)); {7267#true} is VALID [2022-04-28 11:24:22,721 INFO L290 TraceCheckUtils]: 52: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:22,721 INFO L290 TraceCheckUtils]: 53: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:22,721 INFO L290 TraceCheckUtils]: 54: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:22,722 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7267#true} {7421#(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; {7421#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,722 INFO L272 TraceCheckUtils]: 56: Hoare triple {7421#(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)); {7267#true} is VALID [2022-04-28 11:24:22,722 INFO L290 TraceCheckUtils]: 57: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:22,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:22,722 INFO L290 TraceCheckUtils]: 59: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:22,723 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7267#true} {7421#(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; {7421#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,723 INFO L272 TraceCheckUtils]: 61: Hoare triple {7421#(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)); {7267#true} is VALID [2022-04-28 11:24:22,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:22,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:22,723 INFO L290 TraceCheckUtils]: 64: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:22,724 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {7267#true} {7421#(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; {7421#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,724 INFO L290 TraceCheckUtils]: 66: Hoare triple {7421#(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); {7421#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,724 INFO L272 TraceCheckUtils]: 67: Hoare triple {7421#(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)); {7267#true} is VALID [2022-04-28 11:24:22,724 INFO L290 TraceCheckUtils]: 68: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:22,724 INFO L290 TraceCheckUtils]: 69: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:22,725 INFO L290 TraceCheckUtils]: 70: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:22,725 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7267#true} {7421#(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; {7421#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,726 INFO L290 TraceCheckUtils]: 72: Hoare triple {7421#(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; {7494#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 4))} is VALID [2022-04-28 11:24:22,727 INFO L290 TraceCheckUtils]: 73: Hoare triple {7494#(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; {7494#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 4))} is VALID [2022-04-28 11:24:22,727 INFO L290 TraceCheckUtils]: 74: Hoare triple {7494#(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 < 2);havoc #t~post7; {7494#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 4))} is VALID [2022-04-28 11:24:22,728 INFO L290 TraceCheckUtils]: 75: Hoare triple {7494#(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; {7504#(and (= main_~r~0 (+ (* main_~y~0 (- 4)) main_~x~0)) (= main_~q~0 4) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,728 INFO L290 TraceCheckUtils]: 76: Hoare triple {7504#(and (= main_~r~0 (+ (* main_~y~0 (- 4)) main_~x~0)) (= main_~q~0 4) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7504#(and (= main_~r~0 (+ (* main_~y~0 (- 4)) main_~x~0)) (= main_~q~0 4) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,729 INFO L290 TraceCheckUtils]: 77: Hoare triple {7504#(and (= main_~r~0 (+ (* main_~y~0 (- 4)) main_~x~0)) (= main_~q~0 4) (<= 1 main_~y~0))} assume !(#t~post6 < 2);havoc #t~post6; {7504#(and (= main_~r~0 (+ (* main_~y~0 (- 4)) main_~x~0)) (= main_~q~0 4) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:22,730 INFO L272 TraceCheckUtils]: 78: Hoare triple {7504#(and (= main_~r~0 (+ (* main_~y~0 (- 4)) main_~x~0)) (= main_~q~0 4) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {7514#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:22,730 INFO L290 TraceCheckUtils]: 79: Hoare triple {7514#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7518#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:22,730 INFO L290 TraceCheckUtils]: 80: Hoare triple {7518#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7268#false} is VALID [2022-04-28 11:24:22,731 INFO L290 TraceCheckUtils]: 81: Hoare triple {7268#false} assume !false; {7268#false} is VALID [2022-04-28 11:24:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 11:24:22,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:24:23,136 INFO L290 TraceCheckUtils]: 81: Hoare triple {7268#false} assume !false; {7268#false} is VALID [2022-04-28 11:24:23,136 INFO L290 TraceCheckUtils]: 80: Hoare triple {7518#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7268#false} is VALID [2022-04-28 11:24:23,137 INFO L290 TraceCheckUtils]: 79: Hoare triple {7514#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7518#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:23,137 INFO L272 TraceCheckUtils]: 78: Hoare triple {7534#(= (+ (* 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)); {7514#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:23,137 INFO L290 TraceCheckUtils]: 77: Hoare triple {7534#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 2);havoc #t~post6; {7534#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:23,138 INFO L290 TraceCheckUtils]: 76: Hoare triple {7534#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7534#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:23,145 INFO L290 TraceCheckUtils]: 75: Hoare triple {7544#(= 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; {7534#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:23,145 INFO L290 TraceCheckUtils]: 74: Hoare triple {7544#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(#t~post7 < 2);havoc #t~post7; {7544#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:24:23,146 INFO L290 TraceCheckUtils]: 73: Hoare triple {7544#(= 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; {7544#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:24:23,149 INFO L290 TraceCheckUtils]: 72: Hoare triple {7554#(= (+ (* (- 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; {7544#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:24:23,149 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7267#true} {7554#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #89#return; {7554#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:23,149 INFO L290 TraceCheckUtils]: 70: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:23,149 INFO L290 TraceCheckUtils]: 69: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:23,150 INFO L290 TraceCheckUtils]: 68: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:23,150 INFO L272 TraceCheckUtils]: 67: Hoare triple {7554#(= (+ (* (- 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)); {7267#true} is VALID [2022-04-28 11:24:23,150 INFO L290 TraceCheckUtils]: 66: Hoare triple {7554#(= (+ (* (- 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); {7554#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:23,151 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {7267#true} {7554#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #87#return; {7554#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:23,151 INFO L290 TraceCheckUtils]: 64: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:23,151 INFO L290 TraceCheckUtils]: 63: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:23,151 INFO L290 TraceCheckUtils]: 62: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:23,151 INFO L272 TraceCheckUtils]: 61: Hoare triple {7554#(= (+ (* (- 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)); {7267#true} is VALID [2022-04-28 11:24:23,151 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7267#true} {7554#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #85#return; {7554#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:23,151 INFO L290 TraceCheckUtils]: 59: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:23,152 INFO L290 TraceCheckUtils]: 58: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:23,152 INFO L290 TraceCheckUtils]: 57: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:23,152 INFO L272 TraceCheckUtils]: 56: Hoare triple {7554#(= (+ (* (- 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)); {7267#true} is VALID [2022-04-28 11:24:23,152 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7267#true} {7554#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #83#return; {7554#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:23,152 INFO L290 TraceCheckUtils]: 54: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:23,152 INFO L290 TraceCheckUtils]: 53: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:23,152 INFO L290 TraceCheckUtils]: 52: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:23,152 INFO L272 TraceCheckUtils]: 51: Hoare triple {7554#(= (+ (* (- 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)); {7267#true} is VALID [2022-04-28 11:24:23,153 INFO L290 TraceCheckUtils]: 50: Hoare triple {7554#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 2);havoc #t~post7; {7554#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:23,153 INFO L290 TraceCheckUtils]: 49: Hoare triple {7554#(= (+ (* (- 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; {7554#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:23,156 INFO L290 TraceCheckUtils]: 48: Hoare triple {7627#(= (+ (* 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; {7554#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:23,156 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7267#true} {7627#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #89#return; {7627#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:24:23,156 INFO L290 TraceCheckUtils]: 46: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:23,156 INFO L290 TraceCheckUtils]: 45: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:23,157 INFO L290 TraceCheckUtils]: 44: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:23,157 INFO L272 TraceCheckUtils]: 43: Hoare triple {7627#(= (+ (* 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)); {7267#true} is VALID [2022-04-28 11:24:23,157 INFO L290 TraceCheckUtils]: 42: Hoare triple {7627#(= (+ (* 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); {7627#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:24:23,157 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7267#true} {7627#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #87#return; {7627#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:24:23,158 INFO L290 TraceCheckUtils]: 40: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:23,158 INFO L290 TraceCheckUtils]: 39: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:23,158 INFO L290 TraceCheckUtils]: 38: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:23,158 INFO L272 TraceCheckUtils]: 37: Hoare triple {7627#(= (+ (* 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)); {7267#true} is VALID [2022-04-28 11:24:23,158 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7267#true} {7627#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #85#return; {7627#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:24:23,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:23,158 INFO L290 TraceCheckUtils]: 34: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:23,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:23,159 INFO L272 TraceCheckUtils]: 32: Hoare triple {7627#(= (+ (* 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)); {7267#true} is VALID [2022-04-28 11:24:23,161 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7267#true} {7627#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #83#return; {7627#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:24:23,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:23,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:23,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:23,162 INFO L272 TraceCheckUtils]: 27: Hoare triple {7627#(= (+ (* 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)); {7267#true} is VALID [2022-04-28 11:24:23,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {7627#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} assume !!(#t~post7 < 2);havoc #t~post7; {7627#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:24:23,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {7627#(= (+ (* 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; {7627#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:24:23,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {7534#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {7627#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:24:23,163 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7267#true} {7534#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #81#return; {7534#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:23,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:23,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:23,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:23,164 INFO L272 TraceCheckUtils]: 19: Hoare triple {7534#(= (+ (* 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)); {7267#true} is VALID [2022-04-28 11:24:23,164 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7267#true} {7534#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {7534#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:23,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:23,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:23,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:23,164 INFO L272 TraceCheckUtils]: 14: Hoare triple {7534#(= (+ (* 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)); {7267#true} is VALID [2022-04-28 11:24:23,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {7534#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 2);havoc #t~post6; {7534#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:23,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {7534#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7534#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:23,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {7267#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {7534#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:23,165 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7267#true} {7267#true} #77#return; {7267#true} is VALID [2022-04-28 11:24:23,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:23,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {7267#true} assume !(0 == ~cond); {7267#true} is VALID [2022-04-28 11:24:23,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {7267#true} ~cond := #in~cond; {7267#true} is VALID [2022-04-28 11:24:23,166 INFO L272 TraceCheckUtils]: 6: Hoare triple {7267#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7267#true} is VALID [2022-04-28 11:24:23,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {7267#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; {7267#true} is VALID [2022-04-28 11:24:23,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {7267#true} call #t~ret8 := main(); {7267#true} is VALID [2022-04-28 11:24:23,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7267#true} {7267#true} #93#return; {7267#true} is VALID [2022-04-28 11:24:23,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {7267#true} assume true; {7267#true} is VALID [2022-04-28 11:24:23,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {7267#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; {7267#true} is VALID [2022-04-28 11:24:23,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {7267#true} call ULTIMATE.init(); {7267#true} is VALID [2022-04-28 11:24:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-04-28 11:24:23,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:23,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826135062] [2022-04-28 11:24:23,169 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:23,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887936947] [2022-04-28 11:24:23,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887936947] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:24:23,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:24:23,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2022-04-28 11:24:23,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:23,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1417771935] [2022-04-28 11:24:23,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1417771935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:23,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:23,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 11:24:23,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954894105] [2022-04-28 11:24:23,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:23,172 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 82 [2022-04-28 11:24:23,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:23,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:24:23,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:23,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 11:24:23,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:23,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 11:24:23,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-28 11:24:23,219 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:24:24,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:24,282 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2022-04-28 11:24:24,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 11:24:24,282 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 82 [2022-04-28 11:24:24,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:24:24,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2022-04-28 11:24:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:24:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2022-04-28 11:24:24,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 89 transitions. [2022-04-28 11:24:24,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:24,368 INFO L225 Difference]: With dead ends: 97 [2022-04-28 11:24:24,368 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 11:24:24,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:24:24,369 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 47 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:24,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 292 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 11:24:24,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 11:24:24,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-04-28 11:24:24,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:24,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 87 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 21 states have call successors, (21), 12 states have call predecessors, (21), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:24:24,489 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 87 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 21 states have call successors, (21), 12 states have call predecessors, (21), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:24:24,490 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 87 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 21 states have call successors, (21), 12 states have call predecessors, (21), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:24:24,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:24,491 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2022-04-28 11:24:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2022-04-28 11:24:24,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:24,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:24,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 21 states have call successors, (21), 12 states have call predecessors, (21), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 89 states. [2022-04-28 11:24:24,492 INFO L87 Difference]: Start difference. First operand has 87 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 21 states have call successors, (21), 12 states have call predecessors, (21), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 89 states. [2022-04-28 11:24:24,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:24,493 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2022-04-28 11:24:24,493 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2022-04-28 11:24:24,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:24,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:24,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:24,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 21 states have call successors, (21), 12 states have call predecessors, (21), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:24:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2022-04-28 11:24:24,496 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 82 [2022-04-28 11:24:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:24,496 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2022-04-28 11:24:24,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:24:24,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 97 transitions. [2022-04-28 11:24:24,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2022-04-28 11:24:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 11:24:24,637 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:24,637 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:24:24,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 11:24:24,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 11:24:24,838 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:24,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:24,838 INFO L85 PathProgramCache]: Analyzing trace with hash -689049989, now seen corresponding path program 5 times [2022-04-28 11:24:24,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:24,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [312755452] [2022-04-28 11:24:49,928 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:24:49,928 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:24:49,928 INFO L85 PathProgramCache]: Analyzing trace with hash -689049989, now seen corresponding path program 6 times [2022-04-28 11:24:49,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:49,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384971772] [2022-04-28 11:24:49,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:49,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:49,941 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:49,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1170193155] [2022-04-28 11:24:49,942 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:24:49,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:49,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:49,944 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:24:49,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 11:24:50,001 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 11:24:50,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:50,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:24:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:50,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:50,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {8324#true} call ULTIMATE.init(); {8324#true} is VALID [2022-04-28 11:24:50,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {8324#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; {8332#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:50,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {8332#(<= 0 ~counter~0)} assume true; {8332#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:50,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8332#(<= 0 ~counter~0)} {8324#true} #93#return; {8332#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:50,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {8332#(<= 0 ~counter~0)} call #t~ret8 := main(); {8332#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:50,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {8332#(<= 0 ~counter~0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8332#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:50,300 INFO L272 TraceCheckUtils]: 6: Hoare triple {8332#(<= 0 ~counter~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8332#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:50,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {8332#(<= 0 ~counter~0)} ~cond := #in~cond; {8332#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:50,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {8332#(<= 0 ~counter~0)} assume !(0 == ~cond); {8332#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:50,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {8332#(<= 0 ~counter~0)} assume true; {8332#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:50,302 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8332#(<= 0 ~counter~0)} {8332#(<= 0 ~counter~0)} #77#return; {8332#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:50,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {8332#(<= 0 ~counter~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {8332#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:50,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {8332#(<= 0 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8366#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:50,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {8366#(<= 1 ~counter~0)} assume !!(#t~post6 < 2);havoc #t~post6; {8366#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:50,303 INFO L272 TraceCheckUtils]: 14: Hoare triple {8366#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8366#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:50,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {8366#(<= 1 ~counter~0)} ~cond := #in~cond; {8366#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:50,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {8366#(<= 1 ~counter~0)} assume !(0 == ~cond); {8366#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:50,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {8366#(<= 1 ~counter~0)} assume true; {8366#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:50,304 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8366#(<= 1 ~counter~0)} {8366#(<= 1 ~counter~0)} #79#return; {8366#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:50,305 INFO L272 TraceCheckUtils]: 19: Hoare triple {8366#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8366#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:50,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {8366#(<= 1 ~counter~0)} ~cond := #in~cond; {8366#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:50,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {8366#(<= 1 ~counter~0)} assume !(0 == ~cond); {8366#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:50,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {8366#(<= 1 ~counter~0)} assume true; {8366#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:50,307 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8366#(<= 1 ~counter~0)} {8366#(<= 1 ~counter~0)} #81#return; {8366#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:50,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {8366#(<= 1 ~counter~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {8366#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:50,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {8366#(<= 1 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {8406#(<= 2 ~counter~0)} assume !!(#t~post7 < 2);havoc #t~post7; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,308 INFO L272 TraceCheckUtils]: 27: Hoare triple {8406#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {8406#(<= 2 ~counter~0)} ~cond := #in~cond; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,309 INFO L290 TraceCheckUtils]: 29: Hoare triple {8406#(<= 2 ~counter~0)} assume !(0 == ~cond); {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,309 INFO L290 TraceCheckUtils]: 30: Hoare triple {8406#(<= 2 ~counter~0)} assume true; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,310 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8406#(<= 2 ~counter~0)} {8406#(<= 2 ~counter~0)} #83#return; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,310 INFO L272 TraceCheckUtils]: 32: Hoare triple {8406#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,310 INFO L290 TraceCheckUtils]: 33: Hoare triple {8406#(<= 2 ~counter~0)} ~cond := #in~cond; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {8406#(<= 2 ~counter~0)} assume !(0 == ~cond); {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {8406#(<= 2 ~counter~0)} assume true; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,311 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8406#(<= 2 ~counter~0)} {8406#(<= 2 ~counter~0)} #85#return; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,312 INFO L272 TraceCheckUtils]: 37: Hoare triple {8406#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {8406#(<= 2 ~counter~0)} ~cond := #in~cond; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {8406#(<= 2 ~counter~0)} assume !(0 == ~cond); {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {8406#(<= 2 ~counter~0)} assume true; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,315 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8406#(<= 2 ~counter~0)} {8406#(<= 2 ~counter~0)} #87#return; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {8406#(<= 2 ~counter~0)} assume !!(~r~0 >= 2 * ~b~0); {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,316 INFO L272 TraceCheckUtils]: 43: Hoare triple {8406#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {8406#(<= 2 ~counter~0)} ~cond := #in~cond; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,317 INFO L290 TraceCheckUtils]: 45: Hoare triple {8406#(<= 2 ~counter~0)} assume !(0 == ~cond); {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,317 INFO L290 TraceCheckUtils]: 46: Hoare triple {8406#(<= 2 ~counter~0)} assume true; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,318 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8406#(<= 2 ~counter~0)} {8406#(<= 2 ~counter~0)} #89#return; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {8406#(<= 2 ~counter~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,318 INFO L290 TraceCheckUtils]: 49: Hoare triple {8406#(<= 2 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8479#(<= 2 |main_#t~post7|)} is VALID [2022-04-28 11:24:50,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {8479#(<= 2 |main_#t~post7|)} assume !!(#t~post7 < 2);havoc #t~post7; {8325#false} is VALID [2022-04-28 11:24:50,319 INFO L272 TraceCheckUtils]: 51: Hoare triple {8325#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8325#false} is VALID [2022-04-28 11:24:50,319 INFO L290 TraceCheckUtils]: 52: Hoare triple {8325#false} ~cond := #in~cond; {8325#false} is VALID [2022-04-28 11:24:50,319 INFO L290 TraceCheckUtils]: 53: Hoare triple {8325#false} assume !(0 == ~cond); {8325#false} is VALID [2022-04-28 11:24:50,319 INFO L290 TraceCheckUtils]: 54: Hoare triple {8325#false} assume true; {8325#false} is VALID [2022-04-28 11:24:50,319 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8325#false} {8325#false} #83#return; {8325#false} is VALID [2022-04-28 11:24:50,319 INFO L272 TraceCheckUtils]: 56: Hoare triple {8325#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8325#false} is VALID [2022-04-28 11:24:50,319 INFO L290 TraceCheckUtils]: 57: Hoare triple {8325#false} ~cond := #in~cond; {8325#false} is VALID [2022-04-28 11:24:50,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {8325#false} assume !(0 == ~cond); {8325#false} is VALID [2022-04-28 11:24:50,320 INFO L290 TraceCheckUtils]: 59: Hoare triple {8325#false} assume true; {8325#false} is VALID [2022-04-28 11:24:50,320 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8325#false} {8325#false} #85#return; {8325#false} is VALID [2022-04-28 11:24:50,320 INFO L272 TraceCheckUtils]: 61: Hoare triple {8325#false} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8325#false} is VALID [2022-04-28 11:24:50,320 INFO L290 TraceCheckUtils]: 62: Hoare triple {8325#false} ~cond := #in~cond; {8325#false} is VALID [2022-04-28 11:24:50,320 INFO L290 TraceCheckUtils]: 63: Hoare triple {8325#false} assume !(0 == ~cond); {8325#false} is VALID [2022-04-28 11:24:50,320 INFO L290 TraceCheckUtils]: 64: Hoare triple {8325#false} assume true; {8325#false} is VALID [2022-04-28 11:24:50,320 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {8325#false} {8325#false} #87#return; {8325#false} is VALID [2022-04-28 11:24:50,320 INFO L290 TraceCheckUtils]: 66: Hoare triple {8325#false} assume !!(~r~0 >= 2 * ~b~0); {8325#false} is VALID [2022-04-28 11:24:50,320 INFO L272 TraceCheckUtils]: 67: Hoare triple {8325#false} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {8325#false} is VALID [2022-04-28 11:24:50,320 INFO L290 TraceCheckUtils]: 68: Hoare triple {8325#false} ~cond := #in~cond; {8325#false} is VALID [2022-04-28 11:24:50,320 INFO L290 TraceCheckUtils]: 69: Hoare triple {8325#false} assume !(0 == ~cond); {8325#false} is VALID [2022-04-28 11:24:50,320 INFO L290 TraceCheckUtils]: 70: Hoare triple {8325#false} assume true; {8325#false} is VALID [2022-04-28 11:24:50,321 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8325#false} {8325#false} #89#return; {8325#false} is VALID [2022-04-28 11:24:50,321 INFO L290 TraceCheckUtils]: 72: Hoare triple {8325#false} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {8325#false} is VALID [2022-04-28 11:24:50,321 INFO L290 TraceCheckUtils]: 73: Hoare triple {8325#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8325#false} is VALID [2022-04-28 11:24:50,321 INFO L290 TraceCheckUtils]: 74: Hoare triple {8325#false} assume !!(#t~post7 < 2);havoc #t~post7; {8325#false} is VALID [2022-04-28 11:24:50,321 INFO L272 TraceCheckUtils]: 75: Hoare triple {8325#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8325#false} is VALID [2022-04-28 11:24:50,321 INFO L290 TraceCheckUtils]: 76: Hoare triple {8325#false} ~cond := #in~cond; {8325#false} is VALID [2022-04-28 11:24:50,321 INFO L290 TraceCheckUtils]: 77: Hoare triple {8325#false} assume !(0 == ~cond); {8325#false} is VALID [2022-04-28 11:24:50,321 INFO L290 TraceCheckUtils]: 78: Hoare triple {8325#false} assume true; {8325#false} is VALID [2022-04-28 11:24:50,321 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {8325#false} {8325#false} #83#return; {8325#false} is VALID [2022-04-28 11:24:50,321 INFO L272 TraceCheckUtils]: 80: Hoare triple {8325#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8325#false} is VALID [2022-04-28 11:24:50,321 INFO L290 TraceCheckUtils]: 81: Hoare triple {8325#false} ~cond := #in~cond; {8325#false} is VALID [2022-04-28 11:24:50,321 INFO L290 TraceCheckUtils]: 82: Hoare triple {8325#false} assume !(0 == ~cond); {8325#false} is VALID [2022-04-28 11:24:50,321 INFO L290 TraceCheckUtils]: 83: Hoare triple {8325#false} assume true; {8325#false} is VALID [2022-04-28 11:24:50,322 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {8325#false} {8325#false} #85#return; {8325#false} is VALID [2022-04-28 11:24:50,322 INFO L272 TraceCheckUtils]: 85: Hoare triple {8325#false} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8325#false} is VALID [2022-04-28 11:24:50,322 INFO L290 TraceCheckUtils]: 86: Hoare triple {8325#false} ~cond := #in~cond; {8325#false} is VALID [2022-04-28 11:24:50,322 INFO L290 TraceCheckUtils]: 87: Hoare triple {8325#false} assume !(0 == ~cond); {8325#false} is VALID [2022-04-28 11:24:50,322 INFO L290 TraceCheckUtils]: 88: Hoare triple {8325#false} assume true; {8325#false} is VALID [2022-04-28 11:24:50,322 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {8325#false} {8325#false} #87#return; {8325#false} is VALID [2022-04-28 11:24:50,322 INFO L290 TraceCheckUtils]: 90: Hoare triple {8325#false} assume !!(~r~0 >= 2 * ~b~0); {8325#false} is VALID [2022-04-28 11:24:50,322 INFO L272 TraceCheckUtils]: 91: Hoare triple {8325#false} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {8325#false} is VALID [2022-04-28 11:24:50,322 INFO L290 TraceCheckUtils]: 92: Hoare triple {8325#false} ~cond := #in~cond; {8325#false} is VALID [2022-04-28 11:24:50,322 INFO L290 TraceCheckUtils]: 93: Hoare triple {8325#false} assume !(0 == ~cond); {8325#false} is VALID [2022-04-28 11:24:50,322 INFO L290 TraceCheckUtils]: 94: Hoare triple {8325#false} assume true; {8325#false} is VALID [2022-04-28 11:24:50,322 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {8325#false} {8325#false} #89#return; {8325#false} is VALID [2022-04-28 11:24:50,323 INFO L290 TraceCheckUtils]: 96: Hoare triple {8325#false} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {8325#false} is VALID [2022-04-28 11:24:50,323 INFO L290 TraceCheckUtils]: 97: Hoare triple {8325#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8325#false} is VALID [2022-04-28 11:24:50,323 INFO L290 TraceCheckUtils]: 98: Hoare triple {8325#false} assume !(#t~post7 < 2);havoc #t~post7; {8325#false} is VALID [2022-04-28 11:24:50,323 INFO L290 TraceCheckUtils]: 99: Hoare triple {8325#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {8325#false} is VALID [2022-04-28 11:24:50,323 INFO L290 TraceCheckUtils]: 100: Hoare triple {8325#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8325#false} is VALID [2022-04-28 11:24:50,323 INFO L290 TraceCheckUtils]: 101: Hoare triple {8325#false} assume !(#t~post6 < 2);havoc #t~post6; {8325#false} is VALID [2022-04-28 11:24:50,323 INFO L272 TraceCheckUtils]: 102: Hoare triple {8325#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8325#false} is VALID [2022-04-28 11:24:50,323 INFO L290 TraceCheckUtils]: 103: Hoare triple {8325#false} ~cond := #in~cond; {8325#false} is VALID [2022-04-28 11:24:50,323 INFO L290 TraceCheckUtils]: 104: Hoare triple {8325#false} assume 0 == ~cond; {8325#false} is VALID [2022-04-28 11:24:50,323 INFO L290 TraceCheckUtils]: 105: Hoare triple {8325#false} assume !false; {8325#false} is VALID [2022-04-28 11:24:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 259 proven. 1 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-04-28 11:24:50,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:24:50,679 INFO L290 TraceCheckUtils]: 105: Hoare triple {8325#false} assume !false; {8325#false} is VALID [2022-04-28 11:24:50,679 INFO L290 TraceCheckUtils]: 104: Hoare triple {8325#false} assume 0 == ~cond; {8325#false} is VALID [2022-04-28 11:24:50,679 INFO L290 TraceCheckUtils]: 103: Hoare triple {8325#false} ~cond := #in~cond; {8325#false} is VALID [2022-04-28 11:24:50,679 INFO L272 TraceCheckUtils]: 102: Hoare triple {8325#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8325#false} is VALID [2022-04-28 11:24:50,680 INFO L290 TraceCheckUtils]: 101: Hoare triple {8325#false} assume !(#t~post6 < 2);havoc #t~post6; {8325#false} is VALID [2022-04-28 11:24:50,680 INFO L290 TraceCheckUtils]: 100: Hoare triple {8325#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8325#false} is VALID [2022-04-28 11:24:50,680 INFO L290 TraceCheckUtils]: 99: Hoare triple {8325#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {8325#false} is VALID [2022-04-28 11:24:50,680 INFO L290 TraceCheckUtils]: 98: Hoare triple {8325#false} assume !(#t~post7 < 2);havoc #t~post7; {8325#false} is VALID [2022-04-28 11:24:50,680 INFO L290 TraceCheckUtils]: 97: Hoare triple {8325#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8325#false} is VALID [2022-04-28 11:24:50,680 INFO L290 TraceCheckUtils]: 96: Hoare triple {8325#false} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {8325#false} is VALID [2022-04-28 11:24:50,680 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {8324#true} {8325#false} #89#return; {8325#false} is VALID [2022-04-28 11:24:50,680 INFO L290 TraceCheckUtils]: 94: Hoare triple {8324#true} assume true; {8324#true} is VALID [2022-04-28 11:24:50,680 INFO L290 TraceCheckUtils]: 93: Hoare triple {8324#true} assume !(0 == ~cond); {8324#true} is VALID [2022-04-28 11:24:50,680 INFO L290 TraceCheckUtils]: 92: Hoare triple {8324#true} ~cond := #in~cond; {8324#true} is VALID [2022-04-28 11:24:50,680 INFO L272 TraceCheckUtils]: 91: Hoare triple {8325#false} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {8324#true} is VALID [2022-04-28 11:24:50,680 INFO L290 TraceCheckUtils]: 90: Hoare triple {8325#false} assume !!(~r~0 >= 2 * ~b~0); {8325#false} is VALID [2022-04-28 11:24:50,680 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {8324#true} {8325#false} #87#return; {8325#false} is VALID [2022-04-28 11:24:50,680 INFO L290 TraceCheckUtils]: 88: Hoare triple {8324#true} assume true; {8324#true} is VALID [2022-04-28 11:24:50,680 INFO L290 TraceCheckUtils]: 87: Hoare triple {8324#true} assume !(0 == ~cond); {8324#true} is VALID [2022-04-28 11:24:50,680 INFO L290 TraceCheckUtils]: 86: Hoare triple {8324#true} ~cond := #in~cond; {8324#true} is VALID [2022-04-28 11:24:50,680 INFO L272 TraceCheckUtils]: 85: Hoare triple {8325#false} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8324#true} is VALID [2022-04-28 11:24:50,680 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {8324#true} {8325#false} #85#return; {8325#false} is VALID [2022-04-28 11:24:50,681 INFO L290 TraceCheckUtils]: 83: Hoare triple {8324#true} assume true; {8324#true} is VALID [2022-04-28 11:24:50,681 INFO L290 TraceCheckUtils]: 82: Hoare triple {8324#true} assume !(0 == ~cond); {8324#true} is VALID [2022-04-28 11:24:50,681 INFO L290 TraceCheckUtils]: 81: Hoare triple {8324#true} ~cond := #in~cond; {8324#true} is VALID [2022-04-28 11:24:50,681 INFO L272 TraceCheckUtils]: 80: Hoare triple {8325#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8324#true} is VALID [2022-04-28 11:24:50,681 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {8324#true} {8325#false} #83#return; {8325#false} is VALID [2022-04-28 11:24:50,681 INFO L290 TraceCheckUtils]: 78: Hoare triple {8324#true} assume true; {8324#true} is VALID [2022-04-28 11:24:50,681 INFO L290 TraceCheckUtils]: 77: Hoare triple {8324#true} assume !(0 == ~cond); {8324#true} is VALID [2022-04-28 11:24:50,681 INFO L290 TraceCheckUtils]: 76: Hoare triple {8324#true} ~cond := #in~cond; {8324#true} is VALID [2022-04-28 11:24:50,681 INFO L272 TraceCheckUtils]: 75: Hoare triple {8325#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8324#true} is VALID [2022-04-28 11:24:50,681 INFO L290 TraceCheckUtils]: 74: Hoare triple {8325#false} assume !!(#t~post7 < 2);havoc #t~post7; {8325#false} is VALID [2022-04-28 11:24:50,681 INFO L290 TraceCheckUtils]: 73: Hoare triple {8325#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8325#false} is VALID [2022-04-28 11:24:50,682 INFO L290 TraceCheckUtils]: 72: Hoare triple {8325#false} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {8325#false} is VALID [2022-04-28 11:24:50,682 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8324#true} {8325#false} #89#return; {8325#false} is VALID [2022-04-28 11:24:50,682 INFO L290 TraceCheckUtils]: 70: Hoare triple {8324#true} assume true; {8324#true} is VALID [2022-04-28 11:24:50,682 INFO L290 TraceCheckUtils]: 69: Hoare triple {8324#true} assume !(0 == ~cond); {8324#true} is VALID [2022-04-28 11:24:50,682 INFO L290 TraceCheckUtils]: 68: Hoare triple {8324#true} ~cond := #in~cond; {8324#true} is VALID [2022-04-28 11:24:50,682 INFO L272 TraceCheckUtils]: 67: Hoare triple {8325#false} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {8324#true} is VALID [2022-04-28 11:24:50,682 INFO L290 TraceCheckUtils]: 66: Hoare triple {8325#false} assume !!(~r~0 >= 2 * ~b~0); {8325#false} is VALID [2022-04-28 11:24:50,682 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {8324#true} {8325#false} #87#return; {8325#false} is VALID [2022-04-28 11:24:50,682 INFO L290 TraceCheckUtils]: 64: Hoare triple {8324#true} assume true; {8324#true} is VALID [2022-04-28 11:24:50,682 INFO L290 TraceCheckUtils]: 63: Hoare triple {8324#true} assume !(0 == ~cond); {8324#true} is VALID [2022-04-28 11:24:50,682 INFO L290 TraceCheckUtils]: 62: Hoare triple {8324#true} ~cond := #in~cond; {8324#true} is VALID [2022-04-28 11:24:50,683 INFO L272 TraceCheckUtils]: 61: Hoare triple {8325#false} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8324#true} is VALID [2022-04-28 11:24:50,683 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8324#true} {8325#false} #85#return; {8325#false} is VALID [2022-04-28 11:24:50,683 INFO L290 TraceCheckUtils]: 59: Hoare triple {8324#true} assume true; {8324#true} is VALID [2022-04-28 11:24:50,683 INFO L290 TraceCheckUtils]: 58: Hoare triple {8324#true} assume !(0 == ~cond); {8324#true} is VALID [2022-04-28 11:24:50,683 INFO L290 TraceCheckUtils]: 57: Hoare triple {8324#true} ~cond := #in~cond; {8324#true} is VALID [2022-04-28 11:24:50,683 INFO L272 TraceCheckUtils]: 56: Hoare triple {8325#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8324#true} is VALID [2022-04-28 11:24:50,683 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8324#true} {8325#false} #83#return; {8325#false} is VALID [2022-04-28 11:24:50,683 INFO L290 TraceCheckUtils]: 54: Hoare triple {8324#true} assume true; {8324#true} is VALID [2022-04-28 11:24:50,683 INFO L290 TraceCheckUtils]: 53: Hoare triple {8324#true} assume !(0 == ~cond); {8324#true} is VALID [2022-04-28 11:24:50,683 INFO L290 TraceCheckUtils]: 52: Hoare triple {8324#true} ~cond := #in~cond; {8324#true} is VALID [2022-04-28 11:24:50,683 INFO L272 TraceCheckUtils]: 51: Hoare triple {8325#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8324#true} is VALID [2022-04-28 11:24:50,684 INFO L290 TraceCheckUtils]: 50: Hoare triple {8479#(<= 2 |main_#t~post7|)} assume !!(#t~post7 < 2);havoc #t~post7; {8325#false} is VALID [2022-04-28 11:24:50,685 INFO L290 TraceCheckUtils]: 49: Hoare triple {8406#(<= 2 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8479#(<= 2 |main_#t~post7|)} is VALID [2022-04-28 11:24:50,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {8406#(<= 2 ~counter~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,685 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8324#true} {8406#(<= 2 ~counter~0)} #89#return; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,686 INFO L290 TraceCheckUtils]: 46: Hoare triple {8324#true} assume true; {8324#true} is VALID [2022-04-28 11:24:50,686 INFO L290 TraceCheckUtils]: 45: Hoare triple {8324#true} assume !(0 == ~cond); {8324#true} is VALID [2022-04-28 11:24:50,686 INFO L290 TraceCheckUtils]: 44: Hoare triple {8324#true} ~cond := #in~cond; {8324#true} is VALID [2022-04-28 11:24:50,686 INFO L272 TraceCheckUtils]: 43: Hoare triple {8406#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {8324#true} is VALID [2022-04-28 11:24:50,686 INFO L290 TraceCheckUtils]: 42: Hoare triple {8406#(<= 2 ~counter~0)} assume !!(~r~0 >= 2 * ~b~0); {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,686 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8324#true} {8406#(<= 2 ~counter~0)} #87#return; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,687 INFO L290 TraceCheckUtils]: 40: Hoare triple {8324#true} assume true; {8324#true} is VALID [2022-04-28 11:24:50,687 INFO L290 TraceCheckUtils]: 39: Hoare triple {8324#true} assume !(0 == ~cond); {8324#true} is VALID [2022-04-28 11:24:50,687 INFO L290 TraceCheckUtils]: 38: Hoare triple {8324#true} ~cond := #in~cond; {8324#true} is VALID [2022-04-28 11:24:50,687 INFO L272 TraceCheckUtils]: 37: Hoare triple {8406#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8324#true} is VALID [2022-04-28 11:24:50,687 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8324#true} {8406#(<= 2 ~counter~0)} #85#return; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {8324#true} assume true; {8324#true} is VALID [2022-04-28 11:24:50,688 INFO L290 TraceCheckUtils]: 34: Hoare triple {8324#true} assume !(0 == ~cond); {8324#true} is VALID [2022-04-28 11:24:50,688 INFO L290 TraceCheckUtils]: 33: Hoare triple {8324#true} ~cond := #in~cond; {8324#true} is VALID [2022-04-28 11:24:50,688 INFO L272 TraceCheckUtils]: 32: Hoare triple {8406#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8324#true} is VALID [2022-04-28 11:24:50,688 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8324#true} {8406#(<= 2 ~counter~0)} #83#return; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {8324#true} assume true; {8324#true} is VALID [2022-04-28 11:24:50,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {8324#true} assume !(0 == ~cond); {8324#true} is VALID [2022-04-28 11:24:50,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {8324#true} ~cond := #in~cond; {8324#true} is VALID [2022-04-28 11:24:50,688 INFO L272 TraceCheckUtils]: 27: Hoare triple {8406#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8324#true} is VALID [2022-04-28 11:24:50,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {8406#(<= 2 ~counter~0)} assume !!(#t~post7 < 2);havoc #t~post7; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {8366#(<= 1 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8406#(<= 2 ~counter~0)} is VALID [2022-04-28 11:24:50,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {8366#(<= 1 ~counter~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {8366#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:50,690 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8324#true} {8366#(<= 1 ~counter~0)} #81#return; {8366#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:50,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {8324#true} assume true; {8324#true} is VALID [2022-04-28 11:24:50,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {8324#true} assume !(0 == ~cond); {8324#true} is VALID [2022-04-28 11:24:50,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {8324#true} ~cond := #in~cond; {8324#true} is VALID [2022-04-28 11:24:50,690 INFO L272 TraceCheckUtils]: 19: Hoare triple {8366#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8324#true} is VALID [2022-04-28 11:24:50,691 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8324#true} {8366#(<= 1 ~counter~0)} #79#return; {8366#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:50,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {8324#true} assume true; {8324#true} is VALID [2022-04-28 11:24:50,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {8324#true} assume !(0 == ~cond); {8324#true} is VALID [2022-04-28 11:24:50,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {8324#true} ~cond := #in~cond; {8324#true} is VALID [2022-04-28 11:24:50,691 INFO L272 TraceCheckUtils]: 14: Hoare triple {8366#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8324#true} is VALID [2022-04-28 11:24:50,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {8366#(<= 1 ~counter~0)} assume !!(#t~post6 < 2);havoc #t~post6; {8366#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:50,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {8332#(<= 0 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8366#(<= 1 ~counter~0)} is VALID [2022-04-28 11:24:50,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {8332#(<= 0 ~counter~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {8332#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:50,693 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8324#true} {8332#(<= 0 ~counter~0)} #77#return; {8332#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:50,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {8324#true} assume true; {8324#true} is VALID [2022-04-28 11:24:50,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {8324#true} assume !(0 == ~cond); {8324#true} is VALID [2022-04-28 11:24:50,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {8324#true} ~cond := #in~cond; {8324#true} is VALID [2022-04-28 11:24:50,693 INFO L272 TraceCheckUtils]: 6: Hoare triple {8332#(<= 0 ~counter~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8324#true} is VALID [2022-04-28 11:24:50,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {8332#(<= 0 ~counter~0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8332#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:50,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {8332#(<= 0 ~counter~0)} call #t~ret8 := main(); {8332#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:50,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8332#(<= 0 ~counter~0)} {8324#true} #93#return; {8332#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:50,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {8332#(<= 0 ~counter~0)} assume true; {8332#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:50,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {8324#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; {8332#(<= 0 ~counter~0)} is VALID [2022-04-28 11:24:50,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {8324#true} call ULTIMATE.init(); {8324#true} is VALID [2022-04-28 11:24:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 51 proven. 1 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2022-04-28 11:24:50,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:50,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384971772] [2022-04-28 11:24:50,695 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:50,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170193155] [2022-04-28 11:24:50,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170193155] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:24:50,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:24:50,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-04-28 11:24:50,696 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:50,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [312755452] [2022-04-28 11:24:50,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [312755452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:50,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:50,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:24:50,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862417188] [2022-04-28 11:24:50,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:50,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 106 [2022-04-28 11:24:50,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:50,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:24:50,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:50,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:24:50,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:50,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:24:50,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:24:50,743 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:24:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:50,890 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2022-04-28 11:24:50,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:24:50,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 106 [2022-04-28 11:24:50,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:50,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:24:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-04-28 11:24:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:24:50,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-04-28 11:24:50,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2022-04-28 11:24:50,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:50,935 INFO L225 Difference]: With dead ends: 99 [2022-04-28 11:24:50,935 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 11:24:50,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 11:24:50,937 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:50,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:24:50,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 11:24:50,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 11:24:50,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:50,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:24:50,939 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:24:50,939 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:24:50,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:50,939 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:24:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:24:50,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:50,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:50,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:24:50,939 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:24:50,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:50,939 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:24:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:24:50,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:50,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:50,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:50,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:50,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:24:50,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 11:24:50,940 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2022-04-28 11:24:50,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:50,940 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 11:24:50,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:24:50,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 11:24:50,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:24:50,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:50,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 11:24:50,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 11:24:51,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 11:24:51,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 11:24:52,222 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 11:24:52,222 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 11:24:52,222 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 11:24:52,222 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-28 11:24:52,222 INFO L895 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: (or (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (not (<= 0 ~counter~0)) (not (<= ~counter~0 0))) [2022-04-28 11:24:52,222 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 13) the Hoare annotation is: (or (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) (not (<= 0 ~counter~0)) (not (<= ~counter~0 0))) [2022-04-28 11:24:52,222 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 11 13) the Hoare annotation is: (or (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) (not (<= 0 ~counter~0)) (not (<= ~counter~0 0))) [2022-04-28 11:24:52,222 INFO L895 garLoopResultBuilder]: At program point L37-4(lines 37 61) the Hoare annotation is: (let ((.cse0 (<= 1 main_~y~0)) (.cse1 (= main_~b~0 (* main_~a~0 main_~y~0)))) (or (and (<= 2 ~counter~0) (= main_~r~0 (+ (* main_~y~0 (- 4)) main_~x~0)) (= main_~q~0 4) .cse0 .cse1) (and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) .cse0 .cse1) (not (<= |old(~counter~0)| 0)) (and (= main_~q~0 2) .cse0 .cse1 (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0)))) (and (= main_~x~0 main_~r~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-28 11:24:52,222 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 23 65) the Hoare annotation is: true [2022-04-28 11:24:52,222 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (or (let ((.cse0 (* main_~a~0 main_~y~0))) (and (<= 2 ~counter~0) (= main_~x~0 main_~r~0) (<= (* 2 .cse0) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~b~0 .cse0))) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:24:52,222 INFO L895 garLoopResultBuilder]: At program point L54-1(line 54) the Hoare annotation is: (or (let ((.cse0 (* main_~a~0 main_~y~0))) (and (<= 2 ~counter~0) (= main_~x~0 main_~r~0) (<= (* 2 .cse0) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~b~0 .cse0))) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:24:52,222 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (or (and (<= 2 ~counter~0) (= main_~x~0 main_~r~0) (<= 1 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:24:52,222 INFO L895 garLoopResultBuilder]: At program point L46-1(lines 46 58) the Hoare annotation is: (let ((.cse0 (<= 2 ~counter~0)) (.cse1 (= main_~x~0 main_~r~0)) (.cse2 (<= 1 main_~r~0)) (.cse3 (= main_~q~0 0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~b~0 (* main_~a~0 main_~y~0)))) (or (and .cse0 .cse1 (<= 2 |main_#t~post7|) .cse2 .cse3 (= main_~a~0 2) .cse4 .cse5) (not (<= |old(~counter~0)| 0)) (and .cse0 (<= |main_#t~post7| 1) .cse1 .cse2 (= main_~b~0 main_~y~0) .cse3 .cse4 .cse5) (not (<= 0 |old(~counter~0)|)))) [2022-04-28 11:24:52,222 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 23 65) the Hoare annotation is: true [2022-04-28 11:24:52,223 INFO L895 garLoopResultBuilder]: At program point L46-3(lines 46 58) the Hoare annotation is: (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse1 (<= 1 main_~r~0)) (.cse2 (= main_~q~0 0)) (.cse3 (<= 1 main_~y~0)) (.cse4 (= main_~b~0 (* main_~a~0 main_~y~0)))) (or (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 .cse1 .cse2 (= main_~a~0 2) .cse3 .cse4) (and .cse0 (<= ~counter~0 1) (<= 1 ~counter~0) .cse1 (= main_~b~0 main_~y~0) .cse2 .cse3 .cse4) (not (<= 0 |old(~counter~0)|)))) [2022-04-28 11:24:52,223 INFO L895 garLoopResultBuilder]: At program point L46-4(lines 46 58) the Hoare annotation is: (let ((.cse0 (<= 2 ~counter~0)) (.cse1 (= main_~x~0 main_~r~0)) (.cse2 (<= 1 main_~r~0)) (.cse3 (= main_~q~0 0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~b~0 (* main_~a~0 main_~y~0)))) (or (and .cse0 .cse1 .cse2 (= main_~b~0 main_~y~0) .cse3 .cse4 .cse5) (not (<= |old(~counter~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 (= main_~a~0 2) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= main_~a~0 4)) (not (<= 0 |old(~counter~0)|)))) [2022-04-28 11:24:52,223 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~x~0 main_~r~0) (= main_~b~0 0) (<= ~counter~0 1) (<= 1 ~counter~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:24:52,223 INFO L895 garLoopResultBuilder]: At program point L38-1(line 38) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~x~0 main_~r~0) (<= ~counter~0 1) (<= 1 ~counter~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:24:52,223 INFO L902 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: true [2022-04-28 11:24:52,223 INFO L895 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:24:52,223 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 23 65) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:24:52,223 INFO L895 garLoopResultBuilder]: At program point L30-1(line 30) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0) (<= 1 main_~y~0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:24:52,227 INFO L895 garLoopResultBuilder]: At program point L49(lines 46 58) the Hoare annotation is: (or (and (<= 2 ~counter~0) (= main_~x~0 main_~r~0) (<= 1 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:24:52,227 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (or (and (<= 2 ~counter~0) (= main_~x~0 main_~r~0) (<= 1 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:24:52,228 INFO L895 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (or (and (<= 2 ~counter~0) (= main_~x~0 main_~r~0) (<= 1 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:24:52,228 INFO L895 garLoopResultBuilder]: At program point L39(lines 37 61) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~x~0 main_~r~0) (<= ~counter~0 1) (<= 1 ~counter~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:24:52,228 INFO L895 garLoopResultBuilder]: At program point L37-1(lines 37 61) the Hoare annotation is: (let ((.cse0 (<= 2 ~counter~0)) (.cse1 (<= 2 |main_#t~post6|)) (.cse2 (<= 1 main_~y~0)) (.cse3 (= main_~b~0 (* main_~a~0 main_~y~0)))) (or (and .cse0 (= main_~q~0 2) .cse1 (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) .cse2 .cse3) (and .cse0 .cse1 (= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse2 .cse3) (not (<= |old(~counter~0)| 0)) (and .cse0 (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) .cse1 (= main_~q~0 4) .cse2 .cse3) (and (= main_~x~0 main_~r~0) (= main_~b~0 0) (<= ~counter~0 1) (<= 1 ~counter~0) (<= |main_#t~post6| 0) (= main_~q~0 0) .cse2 .cse3) (not (<= 0 |old(~counter~0)|)))) [2022-04-28 11:24:52,228 INFO L895 garLoopResultBuilder]: At program point L37-3(lines 37 61) the Hoare annotation is: (let ((.cse0 (<= 2 ~counter~0)) (.cse1 (<= 1 main_~y~0)) (.cse2 (= main_~b~0 (* main_~a~0 main_~y~0)))) (or (and .cse0 (= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse1 .cse2) (not (<= |old(~counter~0)| 0)) (and .cse0 (= main_~q~0 2) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) .cse1 .cse2) (and .cse0 (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4) .cse1 .cse2) (and (= main_~x~0 main_~r~0) (= main_~b~0 0) (<= 0 ~counter~0) (<= ~counter~0 0) (= main_~q~0 0) .cse1 .cse2) (not (<= 0 |old(~counter~0)|)))) [2022-04-28 11:24:52,228 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-28 11:24:52,228 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 11:24:52,228 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-28 11:24:52,228 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:24:52,228 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-28 11:24:52,228 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 11:24:52,229 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:24:52,229 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 11:24:52,229 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 11:24:52,229 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 11:24:52,229 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (not (<= 1 ~counter~0)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 11:24:52,229 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (not (<= 1 ~counter~0)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 11:24:52,229 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 11:24:52,231 INFO L356 BasicCegarLoop]: Path program histogram: [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 11:24:52,233 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 11:24:52,236 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 11:24:52,242 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 11:24:52,286 INFO L163 areAnnotationChecker]: CFG has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 11:24:52,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 11:24:52 BoogieIcfgContainer [2022-04-28 11:24:52,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 11:24:52,298 INFO L158 Benchmark]: Toolchain (without parser) took 134780.41ms. Allocated memory was 195.0MB in the beginning and 272.6MB in the end (delta: 77.6MB). Free memory was 147.1MB in the beginning and 161.3MB in the end (delta: -14.2MB). Peak memory consumption was 130.8MB. Max. memory is 8.0GB. [2022-04-28 11:24:52,298 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 195.0MB. Free memory is still 163.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 11:24:52,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.19ms. Allocated memory is still 195.0MB. Free memory was 146.9MB in the beginning and 171.1MB in the end (delta: -24.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 11:24:52,298 INFO L158 Benchmark]: Boogie Preprocessor took 39.57ms. Allocated memory is still 195.0MB. Free memory was 171.1MB in the beginning and 169.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 11:24:52,298 INFO L158 Benchmark]: RCFGBuilder took 335.97ms. Allocated memory is still 195.0MB. Free memory was 169.4MB in the beginning and 156.9MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 11:24:52,299 INFO L158 Benchmark]: TraceAbstraction took 134194.35ms. Allocated memory was 195.0MB in the beginning and 272.6MB in the end (delta: 77.6MB). Free memory was 156.4MB in the beginning and 161.3MB in the end (delta: -4.9MB). Peak memory consumption was 140.8MB. Max. memory is 8.0GB. [2022-04-28 11:24:52,300 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 195.0MB. Free memory is still 163.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.19ms. Allocated memory is still 195.0MB. Free memory was 146.9MB in the beginning and 171.1MB in the end (delta: -24.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.57ms. Allocated memory is still 195.0MB. Free memory was 171.1MB in the beginning and 169.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 335.97ms. Allocated memory is still 195.0MB. Free memory was 169.4MB in the beginning and 156.9MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 134194.35ms. Allocated memory was 195.0MB in the beginning and 272.6MB in the end (delta: 77.6MB). Free memory was 156.4MB in the beginning and 161.3MB in the end (delta: -4.9MB). Peak memory consumption was 140.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 134.1s, OverallIterations: 13, TraceHistogramMax: 15, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 316 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 1978 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1409 mSDsCounter, 167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1302 IncrementalHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 167 mSolverCounterUnsat, 569 mSDtfsCounter, 1302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 994 GetRequests, 899 SyntacticMatches, 9 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=10, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 44 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 38 LocationsWithAnnotation, 404 PreInvPairs, 488 NumberOfFragments, 967 HoareAnnotationTreeSize, 404 FomulaSimplifications, 40 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 38 FomulaSimplificationsInter, 801 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((!(\old(counter) <= 0) || ((((((2 <= counter && x == r) && 1 <= r) && q == 0) && a == 2) && 1 <= y) && b == a * y)) || (((((((x == r && counter <= 1) && 1 <= counter) && 1 <= r) && b == y) && q == 0) && 1 <= y) && b == a * y)) || !(0 <= \old(counter)) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((((((((2 <= counter && b == y) && x == y + r) && q == 1) && 1 <= y) && b == a * y) || !(\old(counter) <= 0)) || ((((2 <= counter && q == 2) && x == r + y * 2) && 1 <= y) && b == a * y)) || ((((2 <= counter && x == r + y * 4) && q == 4) && 1 <= y) && b == a * y)) || ((((((x == r && b == 0) && 0 <= counter) && counter <= 0) && q == 0) && 1 <= y) && b == a * y)) || !(0 <= \old(counter)) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: ((!(\old(cond) == 0) && cond == \old(cond)) || !(0 <= counter)) || !(counter <= 0) - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (!(1 <= counter) || \old(cond) == cond) || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-28 11:24:52,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...