/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench/cohendiv-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 17:12:34,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 17:12:34,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 17:12:34,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 17:12:34,729 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 17:12:34,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 17:12:34,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 17:12:34,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 17:12:34,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 17:12:34,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 17:12:34,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 17:12:34,743 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 17:12:34,743 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 17:12:34,744 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 17:12:34,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 17:12:34,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 17:12:34,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 17:12:34,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 17:12:34,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 17:12:34,754 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 17:12:34,756 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 17:12:34,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 17:12:34,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 17:12:34,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 17:12:34,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 17:12:34,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 17:12:34,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 17:12:34,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 17:12:34,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 17:12:34,764 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 17:12:34,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 17:12:34,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 17:12:34,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 17:12:34,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 17:12:34,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 17:12:34,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 17:12:34,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 17:12:34,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 17:12:34,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 17:12:34,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 17:12:34,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 17:12:34,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 17:12:34,770 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 17:12:34,778 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 17:12:34,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 17:12:34,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 17:12:34,779 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 17:12:34,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 17:12:34,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 17:12:34,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 17:12:34,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 17:12:34,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 17:12:34,780 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 17:12:34,781 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 17:12:34,781 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 17:12:34,781 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 17:12:34,781 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 17:12:34,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 17:12:34,781 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 17:12:34,781 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 17:12:34,781 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 17:12:34,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:12:34,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 17:12:34,782 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 17:12:34,782 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 17:12:34,782 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-27 17:12:34,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 17:12:34,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 17:12:34,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 17:12:35,000 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 17:12:35,016 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 17:12:35,017 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/cohendiv-ll.c [2022-04-27 17:12:35,070 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ccffdcb/4427a1ec7e1d411da60ec733eea2bea0/FLAGe67f9c182 [2022-04-27 17:12:35,448 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 17:12:35,448 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/cohendiv-ll.c [2022-04-27 17:12:35,453 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ccffdcb/4427a1ec7e1d411da60ec733eea2bea0/FLAGe67f9c182 [2022-04-27 17:12:35,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ccffdcb/4427a1ec7e1d411da60ec733eea2bea0 [2022-04-27 17:12:35,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 17:12:35,470 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 17:12:35,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 17:12:35,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 17:12:35,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 17:12:35,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:12:35" (1/1) ... [2022-04-27 17:12:35,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bfa8e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:12:35, skipping insertion in model container [2022-04-27 17:12:35,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:12:35" (1/1) ... [2022-04-27 17:12:35,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 17:12:35,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 17:12:35,639 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/cohendiv-ll.c[576,589] [2022-04-27 17:12:35,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:12:35,669 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 17:12:35,683 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/cohendiv-ll.c[576,589] [2022-04-27 17:12:35,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:12:35,706 INFO L208 MainTranslator]: Completed translation [2022-04-27 17:12:35,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:12:35 WrapperNode [2022-04-27 17:12:35,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 17:12:35,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 17:12:35,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 17:12:35,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 17:12:35,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:12:35" (1/1) ... [2022-04-27 17:12:35,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:12:35" (1/1) ... [2022-04-27 17:12:35,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:12:35" (1/1) ... [2022-04-27 17:12:35,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:12:35" (1/1) ... [2022-04-27 17:12:35,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:12:35" (1/1) ... [2022-04-27 17:12:35,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:12:35" (1/1) ... [2022-04-27 17:12:35,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:12:35" (1/1) ... [2022-04-27 17:12:35,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 17:12:35,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 17:12:35,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 17:12:35,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 17:12:35,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:12:35" (1/1) ... [2022-04-27 17:12:35,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:12:35,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:12:35,767 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-27 17:12:35,787 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-27 17:12:35,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 17:12:35,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 17:12:35,810 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 17:12:35,811 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 17:12:35,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 17:12:35,811 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 17:12:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 17:12:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 17:12:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 17:12:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 17:12:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 17:12:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 17:12:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 17:12:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 17:12:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 17:12:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 17:12:35,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 17:12:35,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 17:12:35,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 17:12:35,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 17:12:35,850 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 17:12:35,851 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 17:12:36,023 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 17:12:36,028 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 17:12:36,028 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 17:12:36,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:12:36 BoogieIcfgContainer [2022-04-27 17:12:36,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 17:12:36,030 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 17:12:36,030 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 17:12:36,031 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 17:12:36,041 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:12:36" (1/1) ... [2022-04-27 17:12:36,043 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 17:12:36,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:12:36 BasicIcfg [2022-04-27 17:12:36,076 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 17:12:36,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 17:12:36,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 17:12:36,081 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 17:12:36,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 05:12:35" (1/4) ... [2022-04-27 17:12:36,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d22f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:12:36, skipping insertion in model container [2022-04-27 17:12:36,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:12:35" (2/4) ... [2022-04-27 17:12:36,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d22f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:12:36, skipping insertion in model container [2022-04-27 17:12:36,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:12:36" (3/4) ... [2022-04-27 17:12:36,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d22f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:12:36, skipping insertion in model container [2022-04-27 17:12:36,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:12:36" (4/4) ... [2022-04-27 17:12:36,083 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll.cJordan [2022-04-27 17:12:36,093 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 17:12:36,093 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 17:12:36,128 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 17:12:36,133 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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@553c6502, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c71d967 [2022-04-27 17:12:36,134 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 17:12:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 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-27 17:12:36,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 17:12:36,143 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:12:36,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:12:36,143 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:12:36,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:12:36,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1858340770, now seen corresponding path program 1 times [2022-04-27 17:12:36,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:12:36,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084613594] [2022-04-27 17:12:36,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:12:36,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:12:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:12:36,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:12:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:12:36,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {39#true} is VALID [2022-04-27 17:12:36,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-27 17:12:36,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-27 17:12:36,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 17:12:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:12:36,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} [102] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {39#true} is VALID [2022-04-27 17:12:36,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} [106] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-27 17:12:36,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-27 17:12:36,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {40#false} is VALID [2022-04-27 17:12:36,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:12:36,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {39#true} is VALID [2022-04-27 17:12:36,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-27 17:12:36,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-27 17:12:36,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#true} is VALID [2022-04-27 17:12:36,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {39#true} is VALID [2022-04-27 17:12:36,333 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {39#true} is VALID [2022-04-27 17:12:36,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} [102] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {39#true} is VALID [2022-04-27 17:12:36,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} [106] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-27 17:12:36,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-27 17:12:36,335 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {40#false} is VALID [2022-04-27 17:12:36,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {40#false} is VALID [2022-04-27 17:12:36,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} [103] L36-2-->L36-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-27 17:12:36,336 INFO L272 TraceCheckUtils]: 13: Hoare triple {40#false} [108] L36-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_10 (+ v_main_~r~0_18 (* v_main_~q~0_10 v_main_~y~0_19))) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_19, main_~x~0=v_main_~x~0_10, main_~r~0=v_main_~r~0_18} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {40#false} is VALID [2022-04-27 17:12:36,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {40#false} is VALID [2022-04-27 17:12:36,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-27 17:12:36,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#false} is VALID [2022-04-27 17:12:36,336 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-27 17:12:36,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:12:36,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084613594] [2022-04-27 17:12:36,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084613594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:12:36,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:12:36,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 17:12:36,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246131930] [2022-04-27 17:12:36,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:12:36,342 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-27 17:12:36,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:12:36,347 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-27 17:12:36,368 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-27 17:12:36,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 17:12:36,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:12:36,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 17:12:36,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 17:12:36,391 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 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-27 17:12:36,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:12:36,512 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-27 17:12:36,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 17:12:36,513 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-27 17:12:36,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:12:36,514 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-27 17:12:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-04-27 17:12:36,519 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-27 17:12:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-04-27 17:12:36,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2022-04-27 17:12:36,564 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-27 17:12:36,570 INFO L225 Difference]: With dead ends: 36 [2022-04-27 17:12:36,570 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 17:12:36,571 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-27 17:12:36,573 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:12:36,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:12:36,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 17:12:36,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 17:12:36,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:12:36,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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-27 17:12:36,591 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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-27 17:12:36,592 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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-27 17:12:36,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:12:36,595 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-27 17:12:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-27 17:12:36,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:12:36,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:12:36,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 31 states. [2022-04-27 17:12:36,596 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 31 states. [2022-04-27 17:12:36,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:12:36,599 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-27 17:12:36,599 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-27 17:12:36,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:12:36,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:12:36,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:12:36,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:12:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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-27 17:12:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-04-27 17:12:36,603 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 17 [2022-04-27 17:12:36,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:12:36,603 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-04-27 17:12:36,603 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-27 17:12:36,603 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-27 17:12:36,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 17:12:36,604 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:12:36,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:12:36,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 17:12:36,604 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:12:36,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:12:36,604 INFO L85 PathProgramCache]: Analyzing trace with hash 52763140, now seen corresponding path program 1 times [2022-04-27 17:12:36,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:12:36,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039325298] [2022-04-27 17:12:36,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:12:36,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:12:36,616 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:12:36,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058326390] [2022-04-27 17:12:36,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:12:36,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:12:36,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:12:36,620 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-27 17:12:36,651 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-27 17:12:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:12:36,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 17:12:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:12:36,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:12:39,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {180#true} is VALID [2022-04-27 17:12:39,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {180#true} is VALID [2022-04-27 17:12:39,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {180#true} is VALID [2022-04-27 17:12:39,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {180#true} is VALID [2022-04-27 17:12:39,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {180#true} is VALID [2022-04-27 17:12:39,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {180#true} is VALID [2022-04-27 17:12:39,853 INFO L272 TraceCheckUtils]: 6: Hoare triple {180#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {180#true} is VALID [2022-04-27 17:12:39,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {180#true} [102] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {180#true} is VALID [2022-04-27 17:12:39,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {180#true} [107] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {180#true} is VALID [2022-04-27 17:12:39,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {180#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {180#true} is VALID [2022-04-27 17:12:39,854 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {180#true} {180#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {180#true} is VALID [2022-04-27 17:12:39,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {180#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {218#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-27 17:12:39,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {218#(and (= main_~a~0 0) (= main_~b~0 0))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-27 17:12:39,856 INFO L272 TraceCheckUtils]: 13: Hoare triple {218#(and (= main_~a~0 0) (= main_~b~0 0))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {225#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:12:39,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {225#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {229#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:12:39,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {229#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {181#false} is VALID [2022-04-27 17:12:39,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {181#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#false} is VALID [2022-04-27 17:12:39,857 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-27 17:12:39,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:12:39,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:12:39,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039325298] [2022-04-27 17:12:39,858 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:12:39,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058326390] [2022-04-27 17:12:39,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058326390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:12:39,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:12:39,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 17:12:39,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208837344] [2022-04-27 17:12:39,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:12:39,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 17 [2022-04-27 17:12:39,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:12:39,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-27 17:12:39,874 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-27 17:12:39,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:12:39,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:12:39,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:12:39,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:12:39,875 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-27 17:12:40,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:12:40,018 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-27 17:12:40,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:12:40,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 17 [2022-04-27 17:12:40,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:12:40,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-27 17:12:40,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 17:12:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-27 17:12:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 17:12:40,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 17:12:40,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:12:40,062 INFO L225 Difference]: With dead ends: 40 [2022-04-27 17:12:40,062 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 17:12:40,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-27 17:12:40,063 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 129 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-27 17:12:40,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 129 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:12:40,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 17:12:40,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-04-27 17:12:40,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:12:40,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 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-27 17:12:40,068 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 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-27 17:12:40,068 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 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-27 17:12:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:12:40,070 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-27 17:12:40,070 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-27 17:12:40,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:12:40,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:12:40,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 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 40 states. [2022-04-27 17:12:40,072 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 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 40 states. [2022-04-27 17:12:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:12:40,074 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-27 17:12:40,074 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-27 17:12:40,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:12:40,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:12:40,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:12:40,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:12:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 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-27 17:12:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-04-27 17:12:40,077 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 17 [2022-04-27 17:12:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:12:40,077 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-04-27 17:12:40,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-27 17:12:40,078 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-27 17:12:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 17:12:40,078 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:12:40,078 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] [2022-04-27 17:12:40,097 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-27 17:12:40,294 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-27 17:12:40,295 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:12:40,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:12:40,295 INFO L85 PathProgramCache]: Analyzing trace with hash -791674298, now seen corresponding path program 1 times [2022-04-27 17:12:40,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:12:40,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935446630] [2022-04-27 17:12:40,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:12:40,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:12:40,306 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:12:40,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2027034145] [2022-04-27 17:12:40,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:12:40,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:12:40,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:12:40,307 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-27 17:12:40,308 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-27 17:12:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:12:40,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 17:12:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:12:40,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:12:44,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {394#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 17:12:44,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#true} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {394#true} is VALID [2022-04-27 17:12:44,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {394#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 17:12:44,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {394#true} {394#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 17:12:44,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {394#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 17:12:44,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {394#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {394#true} is VALID [2022-04-27 17:12:44,491 INFO L272 TraceCheckUtils]: 6: Hoare triple {394#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {394#true} is VALID [2022-04-27 17:12:44,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {394#true} [102] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {394#true} is VALID [2022-04-27 17:12:44,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {394#true} [107] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 17:12:44,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {394#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 17:12:44,492 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {394#true} {394#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {394#true} is VALID [2022-04-27 17:12:44,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {394#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {432#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:12:44,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {432#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:12:44,493 INFO L272 TraceCheckUtils]: 13: Hoare triple {432#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {394#true} is VALID [2022-04-27 17:12:44,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {394#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {394#true} is VALID [2022-04-27 17:12:44,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {394#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 17:12:44,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {394#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#true} is VALID [2022-04-27 17:12:44,494 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {394#true} {432#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {432#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:12:44,495 INFO L272 TraceCheckUtils]: 18: Hoare triple {432#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {454#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:12:44,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {454#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {458#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:12:44,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {458#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-27 17:12:44,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {395#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {395#false} is VALID [2022-04-27 17:12:44,497 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-27 17:12:44,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:12:44,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:12:44,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935446630] [2022-04-27 17:12:44,497 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:12:44,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027034145] [2022-04-27 17:12:44,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027034145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:12:44,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:12:44,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 17:12:44,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330053424] [2022-04-27 17:12:44,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:12:44,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 22 [2022-04-27 17:12:44,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:12:44,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-27 17:12:44,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:12:44,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:12:44,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:12:44,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:12:44,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:12:44,519 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-27 17:12:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:12:44,702 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2022-04-27 17:12:44,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:12:44,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 22 [2022-04-27 17:12:44,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:12:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-27 17:12:44,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-27 17:12:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-27 17:12:44,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-27 17:12:44,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-27 17:12:44,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:12:44,769 INFO L225 Difference]: With dead ends: 52 [2022-04-27 17:12:44,770 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 17:12:44,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-27 17:12:44,772 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 123 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.1s IncrementalHoareTripleChecker+Time [2022-04-27 17:12:44,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 123 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 17:12:44,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 17:12:44,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-27 17:12:44,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:12:44,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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-27 17:12:44,785 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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-27 17:12:44,785 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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-27 17:12:44,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:12:44,793 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-27 17:12:44,794 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-27 17:12:44,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:12:44,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:12:44,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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 51 states. [2022-04-27 17:12:44,795 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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 51 states. [2022-04-27 17:12:44,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:12:44,797 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-27 17:12:44,797 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-27 17:12:44,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:12:44,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:12:44,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:12:44,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:12:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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-27 17:12:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-27 17:12:44,800 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 22 [2022-04-27 17:12:44,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:12:44,800 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-27 17:12:44,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-27 17:12:44,801 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-27 17:12:44,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 17:12:44,801 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:12:44,801 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] [2022-04-27 17:12:44,837 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-27 17:12:45,037 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-27 17:12:45,038 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:12:45,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:12:45,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1388492510, now seen corresponding path program 1 times [2022-04-27 17:12:45,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:12:45,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692234458] [2022-04-27 17:12:45,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:12:45,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:12:45,050 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:12:45,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [482525718] [2022-04-27 17:12:45,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:12:45,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:12:45,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:12:45,051 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-27 17:12:45,052 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-27 17:12:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:12:45,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 17:12:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:12:45,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:12:45,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {670#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 17:12:45,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {670#true} is VALID [2022-04-27 17:12:45,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 17:12:45,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {670#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 17:12:45,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {670#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 17:12:45,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {670#true} is VALID [2022-04-27 17:12:45,168 INFO L272 TraceCheckUtils]: 6: Hoare triple {670#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-27 17:12:45,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#true} [102] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {670#true} is VALID [2022-04-27 17:12:45,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#true} [107] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 17:12:45,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 17:12:45,169 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {670#true} {670#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-27 17:12:45,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {670#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {670#true} is VALID [2022-04-27 17:12:45,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#true} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 17:12:45,169 INFO L272 TraceCheckUtils]: 13: Hoare triple {670#true} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {670#true} is VALID [2022-04-27 17:12:45,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {670#true} is VALID [2022-04-27 17:12:45,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {670#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 17:12:45,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {670#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 17:12:45,170 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {670#true} {670#true} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {670#true} is VALID [2022-04-27 17:12:45,170 INFO L272 TraceCheckUtils]: 18: Hoare triple {670#true} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {670#true} is VALID [2022-04-27 17:12:45,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {670#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {670#true} is VALID [2022-04-27 17:12:45,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {670#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 17:12:45,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {670#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-27 17:12:45,170 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {670#true} {670#true} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {670#true} is VALID [2022-04-27 17:12:45,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {670#true} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {744#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-27 17:12:45,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {744#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {744#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-27 17:12:45,172 INFO L272 TraceCheckUtils]: 25: Hoare triple {744#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {751#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:12:45,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {751#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {755#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:12:45,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {755#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {671#false} is VALID [2022-04-27 17:12:45,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {671#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#false} is VALID [2022-04-27 17:12:45,173 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-27 17:12:45,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:12:45,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:12:45,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692234458] [2022-04-27 17:12:45,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:12:45,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482525718] [2022-04-27 17:12:45,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482525718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:12:45,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:12:45,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 17:12:45,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146353735] [2022-04-27 17:12:45,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:12:45,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 29 [2022-04-27 17:12:45,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:12:45,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-27 17:12:45,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:12:45,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 17:12:45,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:12:45,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 17:12:45,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:12:45,191 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-27 17:12:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:12:45,370 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-04-27 17:12:45,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:12:45,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 29 [2022-04-27 17:12:45,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:12:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-27 17:12:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-27 17:12:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-27 17:12:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-27 17:12:45,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-27 17:12:45,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:12:45,430 INFO L225 Difference]: With dead ends: 74 [2022-04-27 17:12:45,430 INFO L226 Difference]: Without dead ends: 74 [2022-04-27 17:12:45,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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-27 17:12:45,433 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 126 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-27 17:12:45,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 126 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 17:12:45,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-27 17:12:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2022-04-27 17:12:45,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:12:45,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 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-27 17:12:45,442 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 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-27 17:12:45,444 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 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-27 17:12:45,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:12:45,449 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-04-27 17:12:45,449 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-04-27 17:12:45,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:12:45,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:12:45,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 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 74 states. [2022-04-27 17:12:45,454 INFO L87 Difference]: Start difference. First operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 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 74 states. [2022-04-27 17:12:45,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:12:45,461 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-04-27 17:12:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-04-27 17:12:45,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:12:45,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:12:45,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:12:45,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:12:45,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 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-27 17:12:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2022-04-27 17:12:45,465 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 29 [2022-04-27 17:12:45,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:12:45,466 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2022-04-27 17:12:45,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-27 17:12:45,466 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2022-04-27 17:12:45,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 17:12:45,466 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:12:45,466 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] [2022-04-27 17:12:45,482 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-27 17:12:45,675 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-27 17:12:45,676 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:12:45,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:12:45,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1377643522, now seen corresponding path program 1 times [2022-04-27 17:12:45,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:12:45,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964437334] [2022-04-27 17:12:45,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:12:45,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:12:45,685 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:12:45,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [296691632] [2022-04-27 17:12:45,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:12:45,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:12:45,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:12:45,693 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-27 17:12:45,694 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-27 17:12:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:12:45,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 17:12:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:12:45,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:12:45,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {1052#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-27 17:12:45,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {1052#true} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1052#true} is VALID [2022-04-27 17:12:45,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {1052#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-27 17:12:45,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1052#true} {1052#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-27 17:12:45,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {1052#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-27 17:12:45,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {1052#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {1052#true} is VALID [2022-04-27 17:12:45,875 INFO L272 TraceCheckUtils]: 6: Hoare triple {1052#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1052#true} is VALID [2022-04-27 17:12:45,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {1052#true} [102] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1078#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 17:12:45,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {1078#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [107] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1082#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 17:12:45,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {1082#(not (= |assume_abort_if_not_#in~cond| 0))} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1082#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 17:12:45,877 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1082#(not (= |assume_abort_if_not_#in~cond| 0))} {1052#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1089#(<= 1 main_~y~0)} is VALID [2022-04-27 17:12:45,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {1089#(<= 1 main_~y~0)} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {1089#(<= 1 main_~y~0)} is VALID [2022-04-27 17:12:45,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {1089#(<= 1 main_~y~0)} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1089#(<= 1 main_~y~0)} is VALID [2022-04-27 17:12:45,877 INFO L272 TraceCheckUtils]: 13: Hoare triple {1089#(<= 1 main_~y~0)} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1052#true} is VALID [2022-04-27 17:12:45,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {1052#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1052#true} is VALID [2022-04-27 17:12:45,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {1052#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-27 17:12:45,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {1052#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-27 17:12:45,878 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1052#true} {1089#(<= 1 main_~y~0)} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1089#(<= 1 main_~y~0)} is VALID [2022-04-27 17:12:45,878 INFO L272 TraceCheckUtils]: 18: Hoare triple {1089#(<= 1 main_~y~0)} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1052#true} is VALID [2022-04-27 17:12:45,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {1052#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1052#true} is VALID [2022-04-27 17:12:45,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {1052#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-27 17:12:45,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {1052#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-27 17:12:45,891 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1052#true} {1089#(<= 1 main_~y~0)} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1089#(<= 1 main_~y~0)} is VALID [2022-04-27 17:12:45,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {1089#(<= 1 main_~y~0)} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1129#(<= 1 main_~r~0)} is VALID [2022-04-27 17:12:45,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {1129#(<= 1 main_~r~0)} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1129#(<= 1 main_~r~0)} is VALID [2022-04-27 17:12:45,893 INFO L272 TraceCheckUtils]: 25: Hoare triple {1129#(<= 1 main_~r~0)} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1052#true} is VALID [2022-04-27 17:12:45,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {1052#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1052#true} is VALID [2022-04-27 17:12:45,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {1052#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-27 17:12:45,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {1052#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-27 17:12:45,893 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1052#true} {1129#(<= 1 main_~r~0)} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1129#(<= 1 main_~r~0)} is VALID [2022-04-27 17:12:45,894 INFO L272 TraceCheckUtils]: 30: Hoare triple {1129#(<= 1 main_~r~0)} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1052#true} is VALID [2022-04-27 17:12:45,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {1052#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1052#true} is VALID [2022-04-27 17:12:45,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {1052#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-27 17:12:45,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {1052#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1052#true} is VALID [2022-04-27 17:12:45,895 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1052#true} {1129#(<= 1 main_~r~0)} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1129#(<= 1 main_~r~0)} is VALID [2022-04-27 17:12:45,895 INFO L272 TraceCheckUtils]: 35: Hoare triple {1129#(<= 1 main_~r~0)} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {1166#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:12:45,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {1166#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1170#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:12:45,896 INFO L290 TraceCheckUtils]: 37: Hoare triple {1170#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1053#false} is VALID [2022-04-27 17:12:45,896 INFO L290 TraceCheckUtils]: 38: Hoare triple {1053#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1053#false} is VALID [2022-04-27 17:12:45,896 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-27 17:12:45,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:12:45,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:12:45,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964437334] [2022-04-27 17:12:45,896 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:12:45,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296691632] [2022-04-27 17:12:45,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296691632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:12:45,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:12:45,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 17:12:45,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904659626] [2022-04-27 17:12:45,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:12:45,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 39 [2022-04-27 17:12:45,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:12:45,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-27 17:12:45,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:12:45,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 17:12:45,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:12:45,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 17:12:45,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-27 17:12:45,918 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-27 17:12:46,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:12:46,155 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-27 17:12:46,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 17:12:46,156 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 39 [2022-04-27 17:12:46,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:12:46,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-27 17:12:46,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-27 17:12:46,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-27 17:12:46,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-27 17:12:46,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-27 17:12:46,188 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-27 17:12:46,189 INFO L225 Difference]: With dead ends: 71 [2022-04-27 17:12:46,190 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 17:12:46,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 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-27 17:12:46,190 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 145 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-27 17:12:46,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 145 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 17:12:46,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 17:12:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-27 17:12:46,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:12:46,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 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-27 17:12:46,194 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 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-27 17:12:46,194 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 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-27 17:12:46,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:12:46,196 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-27 17:12:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-27 17:12:46,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:12:46,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:12:46,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 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 71 states. [2022-04-27 17:12:46,197 INFO L87 Difference]: Start difference. First operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 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 71 states. [2022-04-27 17:12:46,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:12:46,210 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-27 17:12:46,210 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-27 17:12:46,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:12:46,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:12:46,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:12:46,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:12:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 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-27 17:12:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2022-04-27 17:12:46,213 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 39 [2022-04-27 17:12:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:12:46,213 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2022-04-27 17:12:46,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-27 17:12:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-27 17:12:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 17:12:46,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:12:46,214 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] [2022-04-27 17:12:46,230 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-27 17:12:46,430 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-27 17:12:46,431 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:12:46,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:12:46,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1134631717, now seen corresponding path program 1 times [2022-04-27 17:12:46,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:12:46,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834284073] [2022-04-27 17:12:46,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:12:46,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:12:46,444 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:12:46,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1161069920] [2022-04-27 17:12:46,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:12:46,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:12:46,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:12:46,446 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-27 17:12:46,447 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-27 17:12:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:12:46,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 17:12:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:12:46,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:12:46,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {1466#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:46,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {1466#true} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1466#true} is VALID [2022-04-27 17:12:46,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {1466#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:46,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1466#true} {1466#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:46,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {1466#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:46,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {1466#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {1466#true} is VALID [2022-04-27 17:12:46,648 INFO L272 TraceCheckUtils]: 6: Hoare triple {1466#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1466#true} is VALID [2022-04-27 17:12:46,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {1466#true} [102] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1466#true} is VALID [2022-04-27 17:12:46,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {1466#true} [107] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:46,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {1466#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:46,648 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1466#true} {1466#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1466#true} is VALID [2022-04-27 17:12:46,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {1466#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {1466#true} is VALID [2022-04-27 17:12:46,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {1466#true} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:46,648 INFO L272 TraceCheckUtils]: 13: Hoare triple {1466#true} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1466#true} is VALID [2022-04-27 17:12:46,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1466#true} is VALID [2022-04-27 17:12:46,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {1466#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:46,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {1466#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:46,649 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1466#true} {1466#true} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1466#true} is VALID [2022-04-27 17:12:46,649 INFO L272 TraceCheckUtils]: 18: Hoare triple {1466#true} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1466#true} is VALID [2022-04-27 17:12:46,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1466#true} is VALID [2022-04-27 17:12:46,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {1466#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:46,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {1466#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:46,649 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1466#true} {1466#true} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1466#true} is VALID [2022-04-27 17:12:46,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {1466#true} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1466#true} is VALID [2022-04-27 17:12:46,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {1466#true} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:46,649 INFO L272 TraceCheckUtils]: 25: Hoare triple {1466#true} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1466#true} is VALID [2022-04-27 17:12:46,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:12:46,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {1549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:12:46,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:12:46,651 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} {1466#true} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1560#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-27 17:12:46,651 INFO L272 TraceCheckUtils]: 30: Hoare triple {1560#(= main_~b~0 (* main_~a~0 main_~y~0))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1466#true} is VALID [2022-04-27 17:12:46,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1466#true} is VALID [2022-04-27 17:12:46,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {1466#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:46,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {1466#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:46,652 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1466#true} {1560#(= main_~b~0 (* main_~a~0 main_~y~0))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1560#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-27 17:12:46,652 INFO L272 TraceCheckUtils]: 35: Hoare triple {1560#(= main_~b~0 (* main_~a~0 main_~y~0))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {1466#true} is VALID [2022-04-27 17:12:46,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1466#true} is VALID [2022-04-27 17:12:46,652 INFO L290 TraceCheckUtils]: 37: Hoare triple {1466#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:46,653 INFO L290 TraceCheckUtils]: 38: Hoare triple {1466#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:46,653 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1466#true} {1560#(= main_~b~0 (* main_~a~0 main_~y~0))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {1560#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-27 17:12:46,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {1560#(= main_~b~0 (* main_~a~0 main_~y~0))} [130] L48-->L53: Formula: (<= (* v_main_~b~0_5 2) v_main_~r~0_6) InVars {main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[] {1594#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-27 17:12:46,654 INFO L272 TraceCheckUtils]: 41: Hoare triple {1594#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} [132] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {1598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:12:46,655 INFO L290 TraceCheckUtils]: 42: Hoare triple {1598#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:12:46,655 INFO L290 TraceCheckUtils]: 43: Hoare triple {1602#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1467#false} is VALID [2022-04-27 17:12:46,655 INFO L290 TraceCheckUtils]: 44: Hoare triple {1467#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1467#false} is VALID [2022-04-27 17:12:46,656 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-27 17:12:46,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 17:12:51,049 INFO L290 TraceCheckUtils]: 44: Hoare triple {1467#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1467#false} is VALID [2022-04-27 17:12:51,049 INFO L290 TraceCheckUtils]: 43: Hoare triple {1602#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1467#false} is VALID [2022-04-27 17:12:51,050 INFO L290 TraceCheckUtils]: 42: Hoare triple {1598#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:12:51,051 INFO L272 TraceCheckUtils]: 41: Hoare triple {1594#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} [132] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {1598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:12:51,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {1621#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [130] L48-->L53: Formula: (<= (* v_main_~b~0_5 2) v_main_~r~0_6) InVars {main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[] {1594#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-27 17:12:51,052 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1466#true} {1621#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {1621#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-27 17:12:51,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {1466#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:51,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {1466#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:51,052 INFO L290 TraceCheckUtils]: 36: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1466#true} is VALID [2022-04-27 17:12:51,052 INFO L272 TraceCheckUtils]: 35: Hoare triple {1621#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {1466#true} is VALID [2022-04-27 17:12:51,055 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1466#true} {1621#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1621#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-27 17:12:51,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {1466#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:51,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {1466#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:51,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1466#true} is VALID [2022-04-27 17:12:51,056 INFO L272 TraceCheckUtils]: 30: Hoare triple {1621#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1466#true} is VALID [2022-04-27 17:12:51,057 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} {1466#true} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1621#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-27 17:12:51,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:12:51,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {1664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:12:51,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 17:12:51,058 INFO L272 TraceCheckUtils]: 25: Hoare triple {1466#true} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1466#true} is VALID [2022-04-27 17:12:51,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {1466#true} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:51,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {1466#true} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {1466#true} is VALID [2022-04-27 17:12:51,058 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1466#true} {1466#true} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1466#true} is VALID [2022-04-27 17:12:51,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {1466#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:51,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {1466#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:51,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1466#true} is VALID [2022-04-27 17:12:51,059 INFO L272 TraceCheckUtils]: 18: Hoare triple {1466#true} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {1466#true} is VALID [2022-04-27 17:12:51,059 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1466#true} {1466#true} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1466#true} is VALID [2022-04-27 17:12:51,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {1466#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:51,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {1466#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:51,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {1466#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1466#true} is VALID [2022-04-27 17:12:51,059 INFO L272 TraceCheckUtils]: 13: Hoare triple {1466#true} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {1466#true} is VALID [2022-04-27 17:12:51,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {1466#true} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:51,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {1466#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {1466#true} is VALID [2022-04-27 17:12:51,059 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1466#true} {1466#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1466#true} is VALID [2022-04-27 17:12:51,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {1466#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:51,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {1466#true} [107] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:51,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {1466#true} [102] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1466#true} is VALID [2022-04-27 17:12:51,060 INFO L272 TraceCheckUtils]: 6: Hoare triple {1466#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1466#true} is VALID [2022-04-27 17:12:51,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {1466#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {1466#true} is VALID [2022-04-27 17:12:51,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {1466#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:51,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1466#true} {1466#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:51,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {1466#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:51,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {1466#true} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1466#true} is VALID [2022-04-27 17:12:51,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {1466#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 17:12:51,060 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-27 17:12:51,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:12:51,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834284073] [2022-04-27 17:12:51,061 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:12:51,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161069920] [2022-04-27 17:12:51,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161069920] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 17:12:51,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 17:12:51,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 17:12:51,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389201570] [2022-04-27 17:12:51,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 17:12:51,062 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 45 [2022-04-27 17:12:51,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:12:51,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 17:12:51,088 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-27 17:12:51,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 17:12:51,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:12:51,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 17:12:51,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 17:12:51,089 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 17:12:51,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:12:51,381 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-27 17:12:51,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 17:12:51,381 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 45 [2022-04-27 17:12:51,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:12:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 17:12:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-27 17:12:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 17:12:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-27 17:12:51,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-27 17:12:51,416 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-27 17:12:51,418 INFO L225 Difference]: With dead ends: 75 [2022-04-27 17:12:51,418 INFO L226 Difference]: Without dead ends: 75 [2022-04-27 17:12:51,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 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-27 17:12:51,418 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 17:12:51,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 109 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 17:12:51,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-27 17:12:51,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-27 17:12:51,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:12:51,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 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-27 17:12:51,422 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 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-27 17:12:51,422 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 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-27 17:12:51,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:12:51,425 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-27 17:12:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-27 17:12:51,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:12:51,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:12:51,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 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 75 states. [2022-04-27 17:12:51,425 INFO L87 Difference]: Start difference. First operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 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 75 states. [2022-04-27 17:12:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:12:51,428 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-27 17:12:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-27 17:12:51,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:12:51,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:12:51,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:12:51,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:12:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 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-27 17:12:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2022-04-27 17:12:51,430 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 45 [2022-04-27 17:12:51,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:12:51,430 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2022-04-27 17:12:51,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 17:12:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-27 17:12:51,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-27 17:12:51,431 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:12:51,431 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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-27 17:12:51,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 17:12:51,649 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-27 17:12:51,649 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:12:51,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:12:51,650 INFO L85 PathProgramCache]: Analyzing trace with hash 239949443, now seen corresponding path program 1 times [2022-04-27 17:12:51,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:12:51,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268928953] [2022-04-27 17:12:51,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:12:51,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:12:51,659 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:12:51,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [953849895] [2022-04-27 17:12:51,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:12:51,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:12:51,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:12:51,660 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-27 17:12:51,679 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-27 17:12:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:12:51,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 17:12:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:12:51,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:12:52,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {2051#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-27 17:12:52,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {2051#true} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2051#true} is VALID [2022-04-27 17:12:52,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {2051#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-27 17:12:52,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2051#true} {2051#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-27 17:12:52,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {2051#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-27 17:12:52,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {2051#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {2051#true} is VALID [2022-04-27 17:12:52,176 INFO L272 TraceCheckUtils]: 6: Hoare triple {2051#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2051#true} is VALID [2022-04-27 17:12:52,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {2051#true} [102] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2051#true} is VALID [2022-04-27 17:12:52,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {2051#true} [107] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-27 17:12:52,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {2051#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-27 17:12:52,176 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2051#true} {2051#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2051#true} is VALID [2022-04-27 17:12:52,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {2051#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:12:52,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:12:52,179 INFO L272 TraceCheckUtils]: 13: Hoare triple {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2051#true} is VALID [2022-04-27 17:12:52,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {2051#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2051#true} is VALID [2022-04-27 17:12:52,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {2051#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-27 17:12:52,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {2051#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-27 17:12:52,179 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2051#true} {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:12:52,180 INFO L272 TraceCheckUtils]: 18: Hoare triple {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2051#true} is VALID [2022-04-27 17:12:52,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {2051#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2051#true} is VALID [2022-04-27 17:12:52,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {2051#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-27 17:12:52,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {2051#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-27 17:12:52,185 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2051#true} {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:12:52,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {2089#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:12:52,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:12:52,187 INFO L272 TraceCheckUtils]: 25: Hoare triple {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2051#true} is VALID [2022-04-27 17:12:52,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {2051#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2051#true} is VALID [2022-04-27 17:12:52,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {2051#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-27 17:12:52,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {2051#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-27 17:12:52,187 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2051#true} {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:12:52,188 INFO L272 TraceCheckUtils]: 30: Hoare triple {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2051#true} is VALID [2022-04-27 17:12:52,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {2051#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2051#true} is VALID [2022-04-27 17:12:52,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {2051#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-27 17:12:52,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {2051#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-27 17:12:52,188 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2051#true} {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:12:52,188 INFO L272 TraceCheckUtils]: 35: Hoare triple {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2051#true} is VALID [2022-04-27 17:12:52,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {2051#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2051#true} is VALID [2022-04-27 17:12:52,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {2051#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-27 17:12:52,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {2051#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2051#true} is VALID [2022-04-27 17:12:52,189 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2051#true} {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:12:52,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {2126#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [129] L48-->L45-3: Formula: (not (<= (* v_main_~b~0_3 2) v_main_~r~0_4)) InVars {main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_4} OutVars{main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {2178#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (not (<= (* main_~b~0 2) main_~r~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:12:52,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {2178#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (not (<= (* main_~b~0 2) main_~r~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [125] L45-3-->L36-2: Formula: (and (= v_main_~r~0_8 (+ (* (- 1) v_main_~b~0_8) v_main_~r~0_9)) (= (+ v_main_~a~0_7 v_main_~q~0_5) v_main_~q~0_4)) InVars {main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_9, main_~a~0=v_main_~a~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {2182#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} is VALID [2022-04-27 17:12:52,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {2182#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2182#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} is VALID [2022-04-27 17:12:52,191 INFO L272 TraceCheckUtils]: 43: Hoare triple {2182#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2051#true} is VALID [2022-04-27 17:12:52,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {2051#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2192#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:12:52,192 INFO L290 TraceCheckUtils]: 45: Hoare triple {2192#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2196#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:12:52,192 INFO L290 TraceCheckUtils]: 46: Hoare triple {2196#(not (= |__VERIFIER_assert_#in~cond| 0))} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2196#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:12:52,193 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2196#(not (= |__VERIFIER_assert_#in~cond| 0))} {2182#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2203#(and (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-27 17:12:52,193 INFO L272 TraceCheckUtils]: 48: Hoare triple {2203#(and (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2207#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:12:52,194 INFO L290 TraceCheckUtils]: 49: Hoare triple {2207#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2211#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:12:52,194 INFO L290 TraceCheckUtils]: 50: Hoare triple {2211#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2052#false} is VALID [2022-04-27 17:12:52,194 INFO L290 TraceCheckUtils]: 51: Hoare triple {2052#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2052#false} is VALID [2022-04-27 17:12:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-27 17:12:52,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 17:13:45,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:13:45,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268928953] [2022-04-27 17:13:45,545 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:13:45,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953849895] [2022-04-27 17:13:45,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953849895] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 17:13:45,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 17:13:45,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 17:13:45,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872966225] [2022-04-27 17:13:45,545 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 17:13:45,546 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 52 [2022-04-27 17:13:45,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:13:45,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 17:13:45,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:13:45,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 17:13:45,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:13:45,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 17:13:45,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-27 17:13:45,574 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 17:13:46,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:13:46,382 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2022-04-27 17:13:46,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 17:13:46,382 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 52 [2022-04-27 17:13:46,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:13:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 17:13:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2022-04-27 17:13:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 17:13:46,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2022-04-27 17:13:46,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 82 transitions. [2022-04-27 17:13:46,469 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-27 17:13:46,470 INFO L225 Difference]: With dead ends: 92 [2022-04-27 17:13:46,470 INFO L226 Difference]: Without dead ends: 82 [2022-04-27 17:13:46,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-27 17:13:46,472 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 17:13:46,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 145 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 17:13:46,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-27 17:13:46,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2022-04-27 17:13:46,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:13:46,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 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-27 17:13:46,488 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 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-27 17:13:46,488 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 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-27 17:13:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:13:46,490 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-27 17:13:46,491 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-27 17:13:46,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:13:46,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:13:46,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 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 82 states. [2022-04-27 17:13:46,491 INFO L87 Difference]: Start difference. First operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 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 82 states. [2022-04-27 17:13:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:13:46,493 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-27 17:13:46,493 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-27 17:13:46,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:13:46,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:13:46,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:13:46,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:13:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 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-27 17:13:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2022-04-27 17:13:46,496 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 52 [2022-04-27 17:13:46,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:13:46,496 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2022-04-27 17:13:46,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 17:13:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 17:13:46,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-27 17:13:46,497 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:13:46,497 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:13:46,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 17:13:46,711 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-27 17:13:46,711 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:13:46,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:13:46,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1565775829, now seen corresponding path program 1 times [2022-04-27 17:13:46,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:13:46,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722356132] [2022-04-27 17:13:46,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:13:46,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:13:46,722 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:13:46,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2051007928] [2022-04-27 17:13:46,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:13:46,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:13:46,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:13:46,733 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-27 17:13:46,734 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-27 17:13:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:13:46,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 17:13:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:13:46,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:13:47,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {2651#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {2651#true} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2651#true} is VALID [2022-04-27 17:13:47,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {2651#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2651#true} {2651#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {2651#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {2651#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {2651#true} is VALID [2022-04-27 17:13:47,228 INFO L272 TraceCheckUtils]: 6: Hoare triple {2651#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2651#true} is VALID [2022-04-27 17:13:47,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {2651#true} [102] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2651#true} is VALID [2022-04-27 17:13:47,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {2651#true} [107] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {2651#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,228 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2651#true} {2651#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2651#true} is VALID [2022-04-27 17:13:47,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {2651#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:13:47,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:13:47,229 INFO L272 TraceCheckUtils]: 13: Hoare triple {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2651#true} is VALID [2022-04-27 17:13:47,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,230 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2651#true} {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:13:47,230 INFO L272 TraceCheckUtils]: 18: Hoare triple {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2651#true} is VALID [2022-04-27 17:13:47,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,231 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2651#true} {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:13:47,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {2689#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {2726#(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-27 17:13:47,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2726#(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-27 17:13:47,232 INFO L272 TraceCheckUtils]: 25: Hoare triple {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2651#true} is VALID [2022-04-27 17:13:47,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,234 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2651#true} {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2726#(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-27 17:13:47,234 INFO L272 TraceCheckUtils]: 30: Hoare triple {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2651#true} is VALID [2022-04-27 17:13:47,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,235 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2651#true} {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2726#(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-27 17:13:47,235 INFO L272 TraceCheckUtils]: 35: Hoare triple {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2651#true} is VALID [2022-04-27 17:13:47,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,235 INFO L290 TraceCheckUtils]: 38: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,236 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2651#true} {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2726#(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-27 17:13:47,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {2726#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [130] L48-->L53: Formula: (<= (* v_main_~b~0_5 2) v_main_~r~0_6) InVars {main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[] {2778#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:13:47,236 INFO L272 TraceCheckUtils]: 41: Hoare triple {2778#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [132] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {2651#true} is VALID [2022-04-27 17:13:47,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,237 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2651#true} {2778#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [141] __VERIFIER_assertEXIT-->L53-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {2778#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 17:13:47,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {2778#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [131] L53-1-->L45-2: Formula: (and (= v_main_~a~0_5 (* v_main_~a~0_6 2)) (= v_main_~b~0_6 (* v_main_~b~0_7 2))) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 17:13:47,238 INFO L290 TraceCheckUtils]: 47: Hoare triple {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 17:13:47,238 INFO L272 TraceCheckUtils]: 48: Hoare triple {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2651#true} is VALID [2022-04-27 17:13:47,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,238 INFO L290 TraceCheckUtils]: 50: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,239 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2651#true} {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 17:13:47,239 INFO L272 TraceCheckUtils]: 53: Hoare triple {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2651#true} is VALID [2022-04-27 17:13:47,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,239 INFO L290 TraceCheckUtils]: 55: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,239 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2651#true} {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 17:13:47,239 INFO L272 TraceCheckUtils]: 58: Hoare triple {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2651#true} is VALID [2022-04-27 17:13:47,240 INFO L290 TraceCheckUtils]: 59: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,240 INFO L290 TraceCheckUtils]: 61: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,240 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {2651#true} {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 17:13:47,241 INFO L290 TraceCheckUtils]: 63: Hoare triple {2797#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [129] L48-->L45-3: Formula: (not (<= (* v_main_~b~0_3 2) v_main_~r~0_4)) InVars {main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_4} OutVars{main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {2849#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 17:13:47,241 INFO L290 TraceCheckUtils]: 64: Hoare triple {2849#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} [125] L45-3-->L36-2: Formula: (and (= v_main_~r~0_8 (+ (* (- 1) v_main_~b~0_8) v_main_~r~0_9)) (= (+ v_main_~a~0_7 v_main_~q~0_5) v_main_~q~0_4)) InVars {main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_9, main_~a~0=v_main_~a~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {2853#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-27 17:13:47,242 INFO L290 TraceCheckUtils]: 65: Hoare triple {2853#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2853#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-27 17:13:47,242 INFO L272 TraceCheckUtils]: 66: Hoare triple {2853#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2651#true} is VALID [2022-04-27 17:13:47,242 INFO L290 TraceCheckUtils]: 67: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,242 INFO L290 TraceCheckUtils]: 68: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,242 INFO L290 TraceCheckUtils]: 69: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,243 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {2651#true} {2853#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2853#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-27 17:13:47,243 INFO L272 TraceCheckUtils]: 71: Hoare triple {2853#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2875#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:13:47,244 INFO L290 TraceCheckUtils]: 72: Hoare triple {2875#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2879#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:13:47,244 INFO L290 TraceCheckUtils]: 73: Hoare triple {2879#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2652#false} is VALID [2022-04-27 17:13:47,244 INFO L290 TraceCheckUtils]: 74: Hoare triple {2652#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2652#false} is VALID [2022-04-27 17:13:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 17:13:47,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 17:13:47,749 INFO L290 TraceCheckUtils]: 74: Hoare triple {2652#false} [119] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2652#false} is VALID [2022-04-27 17:13:47,749 INFO L290 TraceCheckUtils]: 73: Hoare triple {2879#(<= 1 __VERIFIER_assert_~cond)} [115] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2652#false} is VALID [2022-04-27 17:13:47,749 INFO L290 TraceCheckUtils]: 72: Hoare triple {2875#(<= 1 |__VERIFIER_assert_#in~cond|)} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2879#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:13:47,750 INFO L272 TraceCheckUtils]: 71: Hoare triple {2895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2875#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:13:47,751 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {2651#true} {2895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:13:47,751 INFO L290 TraceCheckUtils]: 69: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,751 INFO L290 TraceCheckUtils]: 68: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,751 INFO L290 TraceCheckUtils]: 67: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,751 INFO L272 TraceCheckUtils]: 66: Hoare triple {2895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2651#true} is VALID [2022-04-27 17:13:47,751 INFO L290 TraceCheckUtils]: 65: Hoare triple {2895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:13:47,758 INFO L290 TraceCheckUtils]: 64: Hoare triple {2917#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} [125] L45-3-->L36-2: Formula: (and (= v_main_~r~0_8 (+ (* (- 1) v_main_~b~0_8) v_main_~r~0_9)) (= (+ v_main_~a~0_7 v_main_~q~0_5) v_main_~q~0_4)) InVars {main_~q~0=v_main_~q~0_5, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_9, main_~a~0=v_main_~a~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~b~0=v_main_~b~0_8, main_~r~0=v_main_~r~0_8, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {2895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 17:13:47,759 INFO L290 TraceCheckUtils]: 63: Hoare triple {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [129] L48-->L45-3: Formula: (not (<= (* v_main_~b~0_3 2) v_main_~r~0_4)) InVars {main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_4} OutVars{main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {2917#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 17:13:47,759 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {2651#true} {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-27 17:13:47,759 INFO L290 TraceCheckUtils]: 61: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,759 INFO L290 TraceCheckUtils]: 60: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,759 INFO L290 TraceCheckUtils]: 59: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,759 INFO L272 TraceCheckUtils]: 58: Hoare triple {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2651#true} is VALID [2022-04-27 17:13:47,760 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2651#true} {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-27 17:13:47,760 INFO L290 TraceCheckUtils]: 56: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,760 INFO L290 TraceCheckUtils]: 55: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,760 INFO L290 TraceCheckUtils]: 54: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,760 INFO L272 TraceCheckUtils]: 53: Hoare triple {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2651#true} is VALID [2022-04-27 17:13:47,761 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2651#true} {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-27 17:13:47,761 INFO L290 TraceCheckUtils]: 51: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,761 INFO L290 TraceCheckUtils]: 50: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,761 INFO L290 TraceCheckUtils]: 49: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,762 INFO L272 TraceCheckUtils]: 48: Hoare triple {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2651#true} is VALID [2022-04-27 17:13:47,766 INFO L290 TraceCheckUtils]: 47: Hoare triple {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-27 17:13:47,768 INFO L290 TraceCheckUtils]: 46: Hoare triple {2973#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [131] L53-1-->L45-2: Formula: (and (= v_main_~a~0_5 (* v_main_~a~0_6 2)) (= v_main_~b~0_6 (* v_main_~b~0_7 2))) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {2921#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-27 17:13:47,769 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2651#true} {2973#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [141] __VERIFIER_assertEXIT-->L53-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {2973#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-27 17:13:47,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,769 INFO L272 TraceCheckUtils]: 41: Hoare triple {2973#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [132] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (<= (* 2 (* v_main_~y~0_18 v_main_~a~0_12)) v_main_~r~0_17) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~r~0=v_main_~r~0_17, main_~a~0=v_main_~a~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~r~0, main_~a~0] {2651#true} is VALID [2022-04-27 17:13:47,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [130] L48-->L53: Formula: (<= (* v_main_~b~0_5 2) v_main_~r~0_6) InVars {main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} OutVars{main_~b~0=v_main_~b~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[] {2973#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-27 17:13:47,770 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2651#true} {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [140] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-27 17:13:47,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,771 INFO L272 TraceCheckUtils]: 35: Hoare triple {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [128] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (<= 0 v_main_~r~0_16) 1 0)) InVars {main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~r~0] {2651#true} is VALID [2022-04-27 17:13:47,771 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2651#true} {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [139] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-27 17:13:47,771 INFO L290 TraceCheckUtils]: 33: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,772 INFO L272 TraceCheckUtils]: 30: Hoare triple {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [127] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~x~0_9 (+ v_main_~r~0_15 (* v_main_~y~0_17 v_main_~q~0_9))) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~y~0=v_main_~y~0_17, main_~x~0=v_main_~x~0_9, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2651#true} is VALID [2022-04-27 17:13:47,772 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2651#true} {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [138] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-27 17:13:47,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,773 INFO L272 TraceCheckUtils]: 25: Hoare triple {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [126] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_16 v_main_~a~0_11) v_main_~b~0_12) 1 0)) InVars {main_~y~0=v_main_~y~0_16, main_~b~0=v_main_~b~0_12, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2651#true} is VALID [2022-04-27 17:13:47,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} [124] L45-2-->L46: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-27 17:13:47,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} [118] L38-->L45-2: Formula: (and (= v_main_~y~0_12 v_main_~b~0_10) (= v_main_~a~0_9 1) (<= v_main_~y~0_12 v_main_~r~0_13)) InVars {main_~y~0=v_main_~y~0_12, main_~r~0=v_main_~r~0_13} OutVars{main_~y~0=v_main_~y~0_12, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_13, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {2992#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-27 17:13:47,774 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2651#true} {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} [137] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} is VALID [2022-04-27 17:13:47,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,775 INFO L272 TraceCheckUtils]: 18: Hoare triple {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} [113] L37-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~x~0_8 (+ v_main_~r~0_14 (* v_main_~y~0_15 v_main_~q~0_8))) 1 0)) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_8, main_~r~0=v_main_~r~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~r~0] {2651#true} is VALID [2022-04-27 17:13:47,782 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2651#true} {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} [136] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} is VALID [2022-04-27 17:13:47,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {2651#true} [121] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {2651#true} [116] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {2651#true} [112] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2651#true} is VALID [2022-04-27 17:13:47,783 INFO L272 TraceCheckUtils]: 13: Hoare triple {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} [109] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~y~0_14 v_main_~a~0_10) v_main_~b~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~b~0, main_~a~0] {2651#true} is VALID [2022-04-27 17:13:47,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} [105] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} is VALID [2022-04-27 17:13:47,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {2651#true} [101] L29-1-->L36-2: Formula: (and (= v_main_~r~0_5 v_main_~x~0_5) (= v_main_~a~0_3 0) (= v_main_~b~0_4 0) (= v_main_~q~0_3 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_5, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_5, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {3044#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} is VALID [2022-04-27 17:13:47,783 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2651#true} {2651#true} [134] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2651#true} is VALID [2022-04-27 17:13:47,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {2651#true} [110] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {2651#true} [107] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {2651#true} [102] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2651#true} is VALID [2022-04-27 17:13:47,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {2651#true} [100] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~y~0_13) 1 0)) InVars {main_~y~0=v_main_~y~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2651#true} is VALID [2022-04-27 17:13:47,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {2651#true} [98] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_3 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3, main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~r~0, main_~a~0] {2651#true} is VALID [2022-04-27 17:13:47,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {2651#true} [95] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2651#true} {2651#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {2651#true} [99] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {2651#true} [96] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select |v_#length_1| 2) 14) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2651#true} is VALID [2022-04-27 17:13:47,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {2651#true} [94] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2651#true} is VALID [2022-04-27 17:13:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 17:13:47,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:13:47,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722356132] [2022-04-27 17:13:47,785 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:13:47,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051007928] [2022-04-27 17:13:47,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051007928] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 17:13:47,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 17:13:47,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-27 17:13:47,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104310237] [2022-04-27 17:13:47,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 17:13:47,786 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) Word has length 75 [2022-04-27 17:13:47,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:13:47,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-27 17:13:47,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:13:47,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 17:13:47,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:13:47,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 17:13:47,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-04-27 17:13:47,869 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-27 17:13:49,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:13:49,819 INFO L93 Difference]: Finished difference Result 115 states and 147 transitions. [2022-04-27 17:13:49,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 17:13:49,819 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) Word has length 75 [2022-04-27 17:13:49,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:13:49,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-27 17:13:49,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2022-04-27 17:13:49,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-27 17:13:49,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2022-04-27 17:13:49,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 104 transitions. [2022-04-27 17:13:49,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:13:49,945 INFO L225 Difference]: With dead ends: 115 [2022-04-27 17:13:49,945 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 17:13:49,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-04-27 17:13:49,946 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 89 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 17:13:49,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 164 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 17:13:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 17:13:49,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 17:13:49,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:13:49,946 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-27 17:13:49,946 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-27 17:13:49,946 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-27 17:13:49,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:13:49,946 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 17:13:49,946 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:13:49,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:13:49,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:13:49,947 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-27 17:13:49,947 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-27 17:13:49,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:13:49,947 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 17:13:49,947 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:13:49,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:13:49,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:13:49,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:13:49,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:13:49,947 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-27 17:13:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 17:13:49,947 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2022-04-27 17:13:49,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:13:49,947 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 17:13:49,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-27 17:13:49,947 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:13:49,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:13:49,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 17:13:49,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-27 17:13:50,159 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-27 17:13:50,161 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:13:50,163 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 17:13:50,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:13:50 BasicIcfg [2022-04-27 17:13:50,164 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 17:13:50,165 INFO L158 Benchmark]: Toolchain (without parser) took 74694.84ms. Allocated memory was 181.4MB in the beginning and 221.2MB in the end (delta: 39.8MB). Free memory was 135.4MB in the beginning and 137.6MB in the end (delta: -2.2MB). Peak memory consumption was 38.3MB. Max. memory is 8.0GB. [2022-04-27 17:13:50,165 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory was 151.8MB in the beginning and 151.7MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 17:13:50,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.15ms. Allocated memory is still 181.4MB. Free memory was 135.2MB in the beginning and 160.4MB in the end (delta: -25.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 17:13:50,165 INFO L158 Benchmark]: Boogie Preprocessor took 34.94ms. Allocated memory is still 181.4MB. Free memory was 160.4MB in the beginning and 159.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 17:13:50,165 INFO L158 Benchmark]: RCFGBuilder took 286.86ms. Allocated memory is still 181.4MB. Free memory was 159.0MB in the beginning and 146.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 17:13:50,166 INFO L158 Benchmark]: IcfgTransformer took 45.78ms. Allocated memory is still 181.4MB. Free memory was 146.9MB in the beginning and 145.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 17:13:50,166 INFO L158 Benchmark]: TraceAbstraction took 74087.17ms. Allocated memory was 181.4MB in the beginning and 221.2MB in the end (delta: 39.8MB). Free memory was 144.8MB in the beginning and 137.6MB in the end (delta: 7.3MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. [2022-04-27 17:13:50,167 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.10ms. Allocated memory is still 181.4MB. Free memory was 151.8MB in the beginning and 151.7MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.15ms. Allocated memory is still 181.4MB. Free memory was 135.2MB in the beginning and 160.4MB in the end (delta: -25.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.94ms. Allocated memory is still 181.4MB. Free memory was 160.4MB in the beginning and 159.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 286.86ms. Allocated memory is still 181.4MB. Free memory was 159.0MB in the beginning and 146.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 45.78ms. Allocated memory is still 181.4MB. Free memory was 146.9MB in the beginning and 145.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 74087.17ms. Allocated memory was 181.4MB in the beginning and 221.2MB in the end (delta: 39.8MB). Free memory was 144.8MB in the beginning and 137.6MB in the end (delta: 7.3MB). Peak memory consumption was 48.2MB. 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 5 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 74.0s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 197 mSDsluCounter, 979 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 703 mSDsCounter, 228 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1023 IncrementalHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 228 mSolverCounterUnsat, 276 mSDtfsCounter, 1023 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 373 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=7, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 67.1s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 406 ConstructedInterpolants, 0 QuantifiedInterpolants, 1447 SizeOfPredicates, 20 NumberOfNonLiveVariables, 819 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 602/633 InterpolantCoveringCapability, 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 RESULT: Ultimate proved your program to be correct! [2022-04-27 17:13:50,183 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...