/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-scaling/mannadiv_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 20:36:12,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 20:36:12,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 20:36:12,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 20:36:12,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 20:36:12,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 20:36:12,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 20:36:12,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 20:36:12,149 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 20:36:12,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 20:36:12,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 20:36:12,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 20:36:12,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 20:36:12,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 20:36:12,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 20:36:12,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 20:36:12,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 20:36:12,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 20:36:12,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 20:36:12,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 20:36:12,169 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 20:36:12,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 20:36:12,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 20:36:12,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 20:36:12,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 20:36:12,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 20:36:12,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 20:36:12,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 20:36:12,178 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 20:36:12,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 20:36:12,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 20:36:12,179 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 20:36:12,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 20:36:12,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 20:36:12,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 20:36:12,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 20:36:12,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 20:36:12,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 20:36:12,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 20:36:12,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 20:36:12,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 20:36:12,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 20:36:12,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 20:36:12,193 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 20:36:12,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 20:36:12,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 20:36:12,194 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 20:36:12,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 20:36:12,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 20:36:12,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 20:36:12,194 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 20:36:12,194 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 20:36:12,195 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 20:36:12,195 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 20:36:12,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 20:36:12,196 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 20:36:12,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 20:36:12,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 20:36:12,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 20:36:12,196 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 20:36:12,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 20:36:12,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 20:36:12,196 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 20:36:12,196 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 20:36:12,197 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 20:36:12,197 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-07 20:36:12,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 20:36:12,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 20:36:12,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 20:36:12,370 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 20:36:12,370 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 20:36:12,371 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound20.c [2022-04-07 20:36:12,428 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5c87488/ca61b0f38b62497c8c21e118ab0de37f/FLAGdfbb8b25d [2022-04-07 20:36:12,772 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 20:36:12,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound20.c [2022-04-07 20:36:12,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5c87488/ca61b0f38b62497c8c21e118ab0de37f/FLAGdfbb8b25d [2022-04-07 20:36:13,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5c87488/ca61b0f38b62497c8c21e118ab0de37f [2022-04-07 20:36:13,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 20:36:13,197 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 20:36:13,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 20:36:13,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 20:36:13,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 20:36:13,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 08:36:13" (1/1) ... [2022-04-07 20:36:13,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7729313a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:36:13, skipping insertion in model container [2022-04-07 20:36:13,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 08:36:13" (1/1) ... [2022-04-07 20:36:13,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 20:36:13,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 20:36:13,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound20.c[573,586] [2022-04-07 20:36:13,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 20:36:13,356 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 20:36:13,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound20.c[573,586] [2022-04-07 20:36:13,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 20:36:13,382 INFO L208 MainTranslator]: Completed translation [2022-04-07 20:36:13,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:36:13 WrapperNode [2022-04-07 20:36:13,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 20:36:13,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 20:36:13,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 20:36:13,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 20:36:13,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:36:13" (1/1) ... [2022-04-07 20:36:13,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:36:13" (1/1) ... [2022-04-07 20:36:13,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:36:13" (1/1) ... [2022-04-07 20:36:13,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:36:13" (1/1) ... [2022-04-07 20:36:13,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:36:13" (1/1) ... [2022-04-07 20:36:13,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:36:13" (1/1) ... [2022-04-07 20:36:13,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:36:13" (1/1) ... [2022-04-07 20:36:13,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 20:36:13,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 20:36:13,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 20:36:13,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 20:36:13,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:36:13" (1/1) ... [2022-04-07 20:36:13,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 20:36:13,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:36:13,430 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-07 20:36:13,440 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-07 20:36:13,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 20:36:13,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 20:36:13,462 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 20:36:13,462 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 20:36:13,462 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 20:36:13,462 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 20:36:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 20:36:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 20:36:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 20:36:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 20:36:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 20:36:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 20:36:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 20:36:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 20:36:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 20:36:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 20:36:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 20:36:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 20:36:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 20:36:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 20:36:13,504 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 20:36:13,505 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 20:36:13,626 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 20:36:13,631 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 20:36:13,631 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 20:36:13,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:36:13 BoogieIcfgContainer [2022-04-07 20:36:13,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 20:36:13,633 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 20:36:13,633 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 20:36:13,634 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 20:36:13,636 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:36:13" (1/1) ... [2022-04-07 20:36:13,637 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 20:36:13,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 08:36:13 BasicIcfg [2022-04-07 20:36:13,656 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 20:36:13,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 20:36:13,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 20:36:13,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 20:36:13,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 08:36:13" (1/4) ... [2022-04-07 20:36:13,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f32d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 08:36:13, skipping insertion in model container [2022-04-07 20:36:13,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 08:36:13" (2/4) ... [2022-04-07 20:36:13,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f32d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 08:36:13, skipping insertion in model container [2022-04-07 20:36:13,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 08:36:13" (3/4) ... [2022-04-07 20:36:13,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f32d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 08:36:13, skipping insertion in model container [2022-04-07 20:36:13,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 08:36:13" (4/4) ... [2022-04-07 20:36:13,674 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound20.cJordan [2022-04-07 20:36:13,680 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 20:36:13,680 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 20:36:13,715 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 20:36:13,720 INFO L340 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 [2022-04-07 20:36:13,720 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 20:36:13,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 20:36:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 20:36:13,746 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:36:13,746 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:36:13,747 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:36:13,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:36:13,751 INFO L85 PathProgramCache]: Analyzing trace with hash 734203501, now seen corresponding path program 1 times [2022-04-07 20:36:13,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:36:13,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126245954] [2022-04-07 20:36:13,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:36:13,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:36:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:36:13,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 20:36:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:36:13,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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 .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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {33#true} is VALID [2022-04-07 20:36:13,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 20:36:13,971 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 20:36:13,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 20:36:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:36:13,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} [78] assume_abort_if_notENTRY-->L13: 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] {33#true} is VALID [2022-04-07 20:36:13,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [80] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:36:13,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:36:13,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-07 20:36:13,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-07 20:36:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:36:14,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} [78] assume_abort_if_notENTRY-->L13: 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] {33#true} is VALID [2022-04-07 20:36:14,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [80] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:36:14,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:36:14,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-07 20:36:14,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 20:36:14,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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 .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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {33#true} is VALID [2022-04-07 20:36:14,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 20:36:14,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 20:36:14,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 20:36:14,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {33#true} is VALID [2022-04-07 20:36:14,007 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {33#true} is VALID [2022-04-07 20:36:14,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} [78] assume_abort_if_notENTRY-->L13: 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] {33#true} is VALID [2022-04-07 20:36:14,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} [80] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:36:14,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:36:14,009 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-07 20:36:14,009 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {33#true} is VALID [2022-04-07 20:36:14,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} [78] assume_abort_if_notENTRY-->L13: 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] {33#true} is VALID [2022-04-07 20:36:14,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} [80] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:36:14,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:36:14,010 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-07 20:36:14,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {34#false} is VALID [2022-04-07 20:36:14,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} [82] L41-2-->L36-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:36:14,011 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {34#false} is VALID [2022-04-07 20:36:14,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} [89] __VERIFIER_assertENTRY-->L16: 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] {34#false} is VALID [2022-04-07 20:36:14,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} [92] L16-->L17: 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[] {34#false} is VALID [2022-04-07 20:36:14,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 20:36:14,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 20:36:14,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:36:14,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126245954] [2022-04-07 20:36:14,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126245954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 20:36:14,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 20:36:14,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 20:36:14,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249650343] [2022-04-07 20:36:14,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 20:36:14,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 20:36:14,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:36:14,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:36:14,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:36:14,051 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 20:36:14,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:36:14,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 20:36:14,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 20:36:14,076 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:36:14,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:14,199 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-07 20:36:14,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 20:36:14,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 20:36:14,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:36:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:36:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-07 20:36:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:36:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-07 20:36:14,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-07 20:36:14,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:36:14,263 INFO L225 Difference]: With dead ends: 31 [2022-04-07 20:36:14,263 INFO L226 Difference]: Without dead ends: 26 [2022-04-07 20:36:14,264 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 20:36:14,267 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 20:36:14,269 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:36:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-07 20:36:14,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-07 20:36:14,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:36:14,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 20:36:14,297 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 20:36:14,298 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 20:36:14,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:14,305 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-07 20:36:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-07 20:36:14,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:36:14,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:36:14,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-07 20:36:14,306 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-07 20:36:14,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:14,309 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-07 20:36:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-07 20:36:14,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:36:14,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:36:14,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:36:14,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:36:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 20:36:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-07 20:36:14,320 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-07 20:36:14,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:36:14,321 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-07 20:36:14,322 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:36:14,322 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-07 20:36:14,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 20:36:14,323 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:36:14,324 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:36:14,324 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 20:36:14,324 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:36:14,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:36:14,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1669026344, now seen corresponding path program 1 times [2022-04-07 20:36:14,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:36:14,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776445054] [2022-04-07 20:36:14,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:36:14,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:36:14,352 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:36:14,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [257254060] [2022-04-07 20:36:14,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:36:14,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:36:14,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:36:14,357 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-07 20:36:14,358 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-07 20:36:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:36:14,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 20:36:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:36:14,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:36:14,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {157#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-07 20:36:14,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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 .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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:14,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {165#(<= ~counter~0 0)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:14,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165#(<= ~counter~0 0)} {157#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:14,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {165#(<= ~counter~0 0)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:14,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {165#(<= ~counter~0 0)} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:14,555 INFO L272 TraceCheckUtils]: 6: Hoare triple {165#(<= ~counter~0 0)} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:14,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {165#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L13: 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] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:14,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {165#(<= ~counter~0 0)} [81] L13-->L13-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[] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:14,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {165#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:14,556 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {165#(<= ~counter~0 0)} {165#(<= ~counter~0 0)} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:14,557 INFO L272 TraceCheckUtils]: 11: Hoare triple {165#(<= ~counter~0 0)} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:14,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {165#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L13: 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] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:14,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {165#(<= ~counter~0 0)} [81] L13-->L13-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[] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:14,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {165#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:14,559 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {165#(<= ~counter~0 0)} {165#(<= ~counter~0 0)} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:14,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {165#(<= ~counter~0 0)} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {165#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:14,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {165#(<= ~counter~0 0)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {214#(<= |main_#t~post6| 0)} is VALID [2022-04-07 20:36:14,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {214#(<= |main_#t~post6| 0)} [86] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {158#false} is VALID [2022-04-07 20:36:14,560 INFO L272 TraceCheckUtils]: 19: Hoare triple {158#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {158#false} is VALID [2022-04-07 20:36:14,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {158#false} [89] __VERIFIER_assertENTRY-->L16: 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] {158#false} is VALID [2022-04-07 20:36:14,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {158#false} [92] L16-->L17: 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[] {158#false} is VALID [2022-04-07 20:36:14,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {158#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-07 20:36:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 20:36:14,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 20:36:14,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:36:14,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776445054] [2022-04-07 20:36:14,561 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:36:14,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257254060] [2022-04-07 20:36:14,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257254060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 20:36:14,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 20:36:14,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 20:36:14,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89225185] [2022-04-07 20:36:14,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 20:36:14,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-07 20:36:14,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:36:14,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:36:14,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:36:14,592 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 20:36:14,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:36:14,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 20:36:14,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 20:36:14,593 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:36:14,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:14,634 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-07 20:36:14,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 20:36:14,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-07 20:36:14,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:36:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:36:14,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-07 20:36:14,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:36:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-07 20:36:14,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-04-07 20:36:14,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:36:14,664 INFO L225 Difference]: With dead ends: 27 [2022-04-07 20:36:14,664 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 20:36:14,665 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 20:36:14,665 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 20:36:14,666 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:36:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 20:36:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-07 20:36:14,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:36:14,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 20:36:14,669 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 20:36:14,669 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 20:36:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:14,671 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-07 20:36:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 20:36:14,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:36:14,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:36:14,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-07 20:36:14,672 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-07 20:36:14,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:14,673 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-07 20:36:14,673 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 20:36:14,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:36:14,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:36:14,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:36:14,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:36:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 20:36:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-07 20:36:14,676 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-07 20:36:14,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:36:14,676 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-07 20:36:14,676 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 20:36:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 20:36:14,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 20:36:14,677 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:36:14,677 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:36:14,697 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-07 20:36:14,891 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:36:14,892 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:36:14,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:36:14,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1667953868, now seen corresponding path program 1 times [2022-04-07 20:36:14,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:36:14,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903196124] [2022-04-07 20:36:14,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:36:14,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:36:14,907 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:36:14,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [485389338] [2022-04-07 20:36:14,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:36:14,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:36:14,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:36:14,909 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-07 20:36:14,911 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-07 20:36:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:36:14,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-07 20:36:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:36:14,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:36:15,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {337#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {337#true} is VALID [2022-04-07 20:36:15,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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 .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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {337#true} is VALID [2022-04-07 20:36:15,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {337#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {337#true} is VALID [2022-04-07 20:36:15,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {337#true} {337#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {337#true} is VALID [2022-04-07 20:36:15,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {337#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {337#true} is VALID [2022-04-07 20:36:15,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {337#true} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {337#true} is VALID [2022-04-07 20:36:15,139 INFO L272 TraceCheckUtils]: 6: Hoare triple {337#true} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {337#true} is VALID [2022-04-07 20:36:15,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {337#true} [78] assume_abort_if_notENTRY-->L13: 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] {337#true} is VALID [2022-04-07 20:36:15,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#true} [81] L13-->L13-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[] {337#true} is VALID [2022-04-07 20:36:15,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {337#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {337#true} is VALID [2022-04-07 20:36:15,140 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {337#true} {337#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {337#true} is VALID [2022-04-07 20:36:15,140 INFO L272 TraceCheckUtils]: 11: Hoare triple {337#true} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {337#true} is VALID [2022-04-07 20:36:15,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {337#true} [78] assume_abort_if_notENTRY-->L13: 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] {378#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 20:36:15,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {378#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [81] L13-->L13-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[] {382#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 20:36:15,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {382#(not (= |assume_abort_if_not_#in~cond| 0))} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {382#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 20:36:15,143 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {382#(not (= |assume_abort_if_not_#in~cond| 0))} {337#true} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {389#(not (= main_~x2~0 0))} is VALID [2022-04-07 20:36:15,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {389#(not (= main_~x2~0 0))} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {393#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-07 20:36:15,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {393#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {393#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-07 20:36:15,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {393#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {393#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-07 20:36:15,146 INFO L272 TraceCheckUtils]: 19: Hoare triple {393#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {403#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 20:36:15,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {403#(<= 1 |__VERIFIER_assert_#in~cond|)} [89] __VERIFIER_assertENTRY-->L16: 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] {407#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:36:15,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {407#(<= 1 __VERIFIER_assert_~cond)} [92] L16-->L17: 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[] {338#false} is VALID [2022-04-07 20:36:15,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {338#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {338#false} is VALID [2022-04-07 20:36:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 20:36:15,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 20:36:15,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:36:15,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903196124] [2022-04-07 20:36:15,148 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:36:15,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485389338] [2022-04-07 20:36:15,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485389338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 20:36:15,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 20:36:15,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-07 20:36:15,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765730617] [2022-04-07 20:36:15,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 20:36:15,149 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-07 20:36:15,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:36:15,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 20:36:15,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:36:15,166 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 20:36:15,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:36:15,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 20:36:15,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-07 20:36:15,167 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 20:36:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:15,379 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-07 20:36:15,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 20:36:15,379 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-07 20:36:15,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:36:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 20:36:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-07 20:36:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 20:36:15,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-07 20:36:15,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-07 20:36:15,414 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-07 20:36:15,415 INFO L225 Difference]: With dead ends: 35 [2022-04-07 20:36:15,415 INFO L226 Difference]: Without dead ends: 35 [2022-04-07 20:36:15,416 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-07 20:36:15,416 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 20:36:15,417 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 98 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 20:36:15,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-07 20:36:15,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-07 20:36:15,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:36:15,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 20:36:15,420 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 20:36:15,420 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 20:36:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:15,422 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-07 20:36:15,422 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-07 20:36:15,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:36:15,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:36:15,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-07 20:36:15,423 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-07 20:36:15,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:15,424 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-07 20:36:15,424 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-07 20:36:15,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:36:15,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:36:15,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:36:15,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:36:15,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 20:36:15,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-07 20:36:15,426 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-07 20:36:15,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:36:15,426 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-07 20:36:15,427 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 20:36:15,427 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-07 20:36:15,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 20:36:15,427 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:36:15,427 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:36:15,446 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-07 20:36:15,643 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 20:36:15,644 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:36:15,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:36:15,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1179905874, now seen corresponding path program 1 times [2022-04-07 20:36:15,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:36:15,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190024334] [2022-04-07 20:36:15,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:36:15,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:36:15,664 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:36:15,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [900049247] [2022-04-07 20:36:15,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:36:15,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:36:15,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:36:15,665 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-07 20:36:15,667 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-07 20:36:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:36:15,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 20:36:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:36:15,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:36:15,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:36:15,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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 .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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {554#true} is VALID [2022-04-07 20:36:15,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:36:15,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:36:15,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:36:15,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#true} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {554#true} is VALID [2022-04-07 20:36:15,851 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#true} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {554#true} is VALID [2022-04-07 20:36:15,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} [78] assume_abort_if_notENTRY-->L13: 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] {554#true} is VALID [2022-04-07 20:36:15,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} [81] L13-->L13-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[] {554#true} is VALID [2022-04-07 20:36:15,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:36:15,852 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#true} {554#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {554#true} is VALID [2022-04-07 20:36:15,852 INFO L272 TraceCheckUtils]: 11: Hoare triple {554#true} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {554#true} is VALID [2022-04-07 20:36:15,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#true} [78] assume_abort_if_notENTRY-->L13: 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] {554#true} is VALID [2022-04-07 20:36:15,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#true} [81] L13-->L13-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[] {554#true} is VALID [2022-04-07 20:36:15,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:36:15,852 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {554#true} {554#true} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {554#true} is VALID [2022-04-07 20:36:15,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {554#true} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {554#true} is VALID [2022-04-07 20:36:15,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {554#true} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {554#true} is VALID [2022-04-07 20:36:15,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {554#true} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {554#true} is VALID [2022-04-07 20:36:15,853 INFO L272 TraceCheckUtils]: 19: Hoare triple {554#true} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {554#true} is VALID [2022-04-07 20:36:15,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {554#true} [89] __VERIFIER_assertENTRY-->L16: 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] {619#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:36:15,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {619#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [93] L16-->L16-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[] {623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 20:36:15,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {623#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 20:36:15,855 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {623#(not (= |__VERIFIER_assert_#in~cond| 0))} {554#true} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {630#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} is VALID [2022-04-07 20:36:15,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {630#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} [94] L37-1-->L36-3: Formula: (= v_main_~y3~0_8 0) InVars {main_~y3~0=v_main_~y3~0_8} OutVars{main_~y3~0=v_main_~y3~0_8} AuxVars[] AssignedVars[] {634#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-07 20:36:15,856 INFO L272 TraceCheckUtils]: 25: Hoare triple {634#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 20:36:15,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {638#(<= 1 |__VERIFIER_assert_#in~cond|)} [89] __VERIFIER_assertENTRY-->L16: 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] {642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:36:15,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} [92] L16-->L17: 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[] {555#false} is VALID [2022-04-07 20:36:15,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {555#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {555#false} is VALID [2022-04-07 20:36:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 20:36:15,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 20:36:22,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {555#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {555#false} is VALID [2022-04-07 20:36:22,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} [92] L16-->L17: 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[] {555#false} is VALID [2022-04-07 20:36:22,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {638#(<= 1 |__VERIFIER_assert_#in~cond|)} [89] __VERIFIER_assertENTRY-->L16: 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] {642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 20:36:22,428 INFO L272 TraceCheckUtils]: 25: Hoare triple {634#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 20:36:22,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {661#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} [94] L37-1-->L36-3: Formula: (= v_main_~y3~0_8 0) InVars {main_~y3~0=v_main_~y3~0_8} OutVars{main_~y3~0=v_main_~y3~0_8} AuxVars[] AssignedVars[] {634#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-07 20:36:22,429 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {623#(not (= |__VERIFIER_assert_#in~cond| 0))} {554#true} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {661#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} is VALID [2022-04-07 20:36:22,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {623#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 20:36:22,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {674#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [93] L16-->L16-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[] {623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 20:36:22,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {554#true} [89] __VERIFIER_assertENTRY-->L16: 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] {674#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 20:36:22,430 INFO L272 TraceCheckUtils]: 19: Hoare triple {554#true} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {554#true} is VALID [2022-04-07 20:36:22,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {554#true} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {554#true} is VALID [2022-04-07 20:36:22,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {554#true} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {554#true} is VALID [2022-04-07 20:36:22,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {554#true} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {554#true} is VALID [2022-04-07 20:36:22,431 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {554#true} {554#true} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {554#true} is VALID [2022-04-07 20:36:22,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:36:22,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#true} [81] L13-->L13-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[] {554#true} is VALID [2022-04-07 20:36:22,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#true} [78] assume_abort_if_notENTRY-->L13: 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] {554#true} is VALID [2022-04-07 20:36:22,431 INFO L272 TraceCheckUtils]: 11: Hoare triple {554#true} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {554#true} is VALID [2022-04-07 20:36:22,431 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#true} {554#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {554#true} is VALID [2022-04-07 20:36:22,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:36:22,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} [81] L13-->L13-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[] {554#true} is VALID [2022-04-07 20:36:22,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} [78] assume_abort_if_notENTRY-->L13: 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] {554#true} is VALID [2022-04-07 20:36:22,432 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#true} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {554#true} is VALID [2022-04-07 20:36:22,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#true} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {554#true} is VALID [2022-04-07 20:36:22,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:36:22,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:36:22,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:36:22,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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 .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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {554#true} is VALID [2022-04-07 20:36:22,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#true} is VALID [2022-04-07 20:36:22,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 20:36:22,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:36:22,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190024334] [2022-04-07 20:36:22,433 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:36:22,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900049247] [2022-04-07 20:36:22,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900049247] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 20:36:22,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 20:36:22,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-07 20:36:22,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298805952] [2022-04-07 20:36:22,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 20:36:22,434 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-07 20:36:22,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:36:22,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 20:36:22,451 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-07 20:36:22,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 20:36:22,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:36:22,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 20:36:22,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-07 20:36:22,452 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 20:36:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:22,621 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-04-07 20:36:22,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 20:36:22,621 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-07 20:36:22,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:36:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 20:36:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-04-07 20:36:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 20:36:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-04-07 20:36:22,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 34 transitions. [2022-04-07 20:36:22,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:36:22,654 INFO L225 Difference]: With dead ends: 37 [2022-04-07 20:36:22,654 INFO L226 Difference]: Without dead ends: 34 [2022-04-07 20:36:22,654 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-07 20:36:22,655 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 20:36:22,655 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 115 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:36:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-07 20:36:22,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-07 20:36:22,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:36:22,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 20:36:22,657 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 20:36:22,658 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 20:36:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:22,659 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-07 20:36:22,659 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-07 20:36:22,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:36:22,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:36:22,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-07 20:36:22,660 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-07 20:36:22,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:22,661 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-07 20:36:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-07 20:36:22,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:36:22,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:36:22,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:36:22,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:36:22,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 20:36:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-07 20:36:22,662 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-07 20:36:22,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:36:22,663 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-07 20:36:22,663 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 20:36:22,663 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-07 20:36:22,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 20:36:22,663 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:36:22,663 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:36:22,683 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-07 20:36:22,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:36:22,867 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:36:22,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:36:22,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1668946595, now seen corresponding path program 1 times [2022-04-07 20:36:22,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:36:22,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807135052] [2022-04-07 20:36:22,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:36:22,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:36:22,879 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:36:22,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1329804985] [2022-04-07 20:36:22,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:36:22,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:36:22,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:36:22,884 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-07 20:36:22,885 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-07 20:36:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:36:22,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 20:36:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:36:22,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:36:23,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-07 20:36:23,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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 .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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {885#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:23,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {885#(<= ~counter~0 0)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:23,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {885#(<= ~counter~0 0)} {877#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:23,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {885#(<= ~counter~0 0)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:23,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {885#(<= ~counter~0 0)} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {885#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:23,078 INFO L272 TraceCheckUtils]: 6: Hoare triple {885#(<= ~counter~0 0)} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {885#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:23,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {885#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L13: 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] {885#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:23,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {885#(<= ~counter~0 0)} [81] L13-->L13-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[] {885#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:23,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {885#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:23,081 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {885#(<= ~counter~0 0)} {885#(<= ~counter~0 0)} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {885#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:23,081 INFO L272 TraceCheckUtils]: 11: Hoare triple {885#(<= ~counter~0 0)} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {885#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:23,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {885#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L13: 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] {885#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:23,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {885#(<= ~counter~0 0)} [81] L13-->L13-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[] {885#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:23,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {885#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:23,082 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {885#(<= ~counter~0 0)} {885#(<= ~counter~0 0)} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {885#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:23,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {885#(<= ~counter~0 0)} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {885#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:23,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {885#(<= ~counter~0 0)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {934#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:23,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= ~counter~0 1)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {934#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:23,084 INFO L272 TraceCheckUtils]: 19: Hoare triple {934#(<= ~counter~0 1)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {934#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:23,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {934#(<= ~counter~0 1)} [89] __VERIFIER_assertENTRY-->L16: 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] {934#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:23,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {934#(<= ~counter~0 1)} [93] L16-->L16-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[] {934#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:23,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {934#(<= ~counter~0 1)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {934#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:23,085 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {934#(<= ~counter~0 1)} {934#(<= ~counter~0 1)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {934#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:23,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {934#(<= ~counter~0 1)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {934#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:23,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {934#(<= ~counter~0 1)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {934#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:23,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {934#(<= ~counter~0 1)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {962#(<= |main_#t~post6| 1)} is VALID [2022-04-07 20:36:23,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {962#(<= |main_#t~post6| 1)} [86] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {878#false} is VALID [2022-04-07 20:36:23,087 INFO L272 TraceCheckUtils]: 28: Hoare triple {878#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {878#false} is VALID [2022-04-07 20:36:23,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {878#false} [89] __VERIFIER_assertENTRY-->L16: 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] {878#false} is VALID [2022-04-07 20:36:23,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {878#false} [92] L16-->L17: 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[] {878#false} is VALID [2022-04-07 20:36:23,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {878#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {878#false} is VALID [2022-04-07 20:36:23,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 20:36:23,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 20:36:23,224 INFO L290 TraceCheckUtils]: 31: Hoare triple {878#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {878#false} is VALID [2022-04-07 20:36:23,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {878#false} [92] L16-->L17: 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[] {878#false} is VALID [2022-04-07 20:36:23,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {878#false} [89] __VERIFIER_assertENTRY-->L16: 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] {878#false} is VALID [2022-04-07 20:36:23,225 INFO L272 TraceCheckUtils]: 28: Hoare triple {878#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {878#false} is VALID [2022-04-07 20:36:23,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {990#(< |main_#t~post6| 20)} [86] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {878#false} is VALID [2022-04-07 20:36:23,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {994#(< ~counter~0 20)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {990#(< |main_#t~post6| 20)} is VALID [2022-04-07 20:36:23,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {994#(< ~counter~0 20)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {994#(< ~counter~0 20)} is VALID [2022-04-07 20:36:23,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {994#(< ~counter~0 20)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {994#(< ~counter~0 20)} is VALID [2022-04-07 20:36:23,233 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {877#true} {994#(< ~counter~0 20)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {994#(< ~counter~0 20)} is VALID [2022-04-07 20:36:23,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {877#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-07 20:36:23,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {877#true} [93] L16-->L16-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[] {877#true} is VALID [2022-04-07 20:36:23,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#true} [89] __VERIFIER_assertENTRY-->L16: 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] {877#true} is VALID [2022-04-07 20:36:23,234 INFO L272 TraceCheckUtils]: 19: Hoare triple {994#(< ~counter~0 20)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {877#true} is VALID [2022-04-07 20:36:23,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {994#(< ~counter~0 20)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {994#(< ~counter~0 20)} is VALID [2022-04-07 20:36:23,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {1022#(< ~counter~0 19)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {994#(< ~counter~0 20)} is VALID [2022-04-07 20:36:23,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {1022#(< ~counter~0 19)} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1022#(< ~counter~0 19)} is VALID [2022-04-07 20:36:23,236 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {1022#(< ~counter~0 19)} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {1022#(< ~counter~0 19)} is VALID [2022-04-07 20:36:23,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-07 20:36:23,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} [81] L13-->L13-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[] {877#true} is VALID [2022-04-07 20:36:23,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} [78] assume_abort_if_notENTRY-->L13: 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] {877#true} is VALID [2022-04-07 20:36:23,236 INFO L272 TraceCheckUtils]: 11: Hoare triple {1022#(< ~counter~0 19)} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {877#true} is VALID [2022-04-07 20:36:23,237 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {1022#(< ~counter~0 19)} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {1022#(< ~counter~0 19)} is VALID [2022-04-07 20:36:23,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-07 20:36:23,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} [81] L13-->L13-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[] {877#true} is VALID [2022-04-07 20:36:23,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} [78] assume_abort_if_notENTRY-->L13: 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] {877#true} is VALID [2022-04-07 20:36:23,237 INFO L272 TraceCheckUtils]: 6: Hoare triple {1022#(< ~counter~0 19)} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {877#true} is VALID [2022-04-07 20:36:23,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {1022#(< ~counter~0 19)} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1022#(< ~counter~0 19)} is VALID [2022-04-07 20:36:23,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {1022#(< ~counter~0 19)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1022#(< ~counter~0 19)} is VALID [2022-04-07 20:36:23,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1022#(< ~counter~0 19)} {877#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1022#(< ~counter~0 19)} is VALID [2022-04-07 20:36:23,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {1022#(< ~counter~0 19)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1022#(< ~counter~0 19)} is VALID [2022-04-07 20:36:23,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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 .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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {1022#(< ~counter~0 19)} is VALID [2022-04-07 20:36:23,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-07 20:36:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 20:36:23,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:36:23,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807135052] [2022-04-07 20:36:23,241 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:36:23,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329804985] [2022-04-07 20:36:23,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329804985] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 20:36:23,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 20:36:23,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-07 20:36:23,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172374788] [2022-04-07 20:36:23,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 20:36:23,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-07 20:36:23,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:36:23,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-07 20:36:23,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:36:23,287 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 20:36:23,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:36:23,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 20:36:23,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-07 20:36:23,288 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-07 20:36:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:23,433 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-07 20:36:23,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 20:36:23,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-07 20:36:23,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:36:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-07 20:36:23,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2022-04-07 20:36:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-07 20:36:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2022-04-07 20:36:23,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 63 transitions. [2022-04-07 20:36:23,491 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-07 20:36:23,493 INFO L225 Difference]: With dead ends: 56 [2022-04-07 20:36:23,493 INFO L226 Difference]: Without dead ends: 56 [2022-04-07 20:36:23,493 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-07 20:36:23,493 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 20:36:23,494 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 128 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 20:36:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-07 20:36:23,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-07 20:36:23,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:36:23,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 20:36:23,497 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 20:36:23,497 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 20:36:23,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:23,499 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-07 20:36:23,499 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-07 20:36:23,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:36:23,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:36:23,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-07 20:36:23,500 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-07 20:36:23,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:23,501 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-07 20:36:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-07 20:36:23,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:36:23,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:36:23,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:36:23,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:36:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 20:36:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-07 20:36:23,517 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-04-07 20:36:23,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:36:23,518 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-07 20:36:23,518 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-07 20:36:23,518 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-07 20:36:23,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-07 20:36:23,519 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:36:23,519 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:36:23,541 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-07 20:36:23,736 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:36:23,736 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:36:23,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:36:23,736 INFO L85 PathProgramCache]: Analyzing trace with hash -906969448, now seen corresponding path program 2 times [2022-04-07 20:36:23,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:36:23,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656494571] [2022-04-07 20:36:23,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:36:23,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:36:23,764 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:36:23,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [830647040] [2022-04-07 20:36:23,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 20:36:23,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:36:23,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:36:23,768 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-07 20:36:23,786 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-07 20:36:23,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 20:36:23,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 20:36:23,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 20:36:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:36:23,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:36:24,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 20:36:24,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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 .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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {1314#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:24,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {1314#(<= ~counter~0 0)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1314#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:24,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1314#(<= ~counter~0 0)} {1306#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1314#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:24,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {1314#(<= ~counter~0 0)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1314#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:24,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {1314#(<= ~counter~0 0)} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1314#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:24,097 INFO L272 TraceCheckUtils]: 6: Hoare triple {1314#(<= ~counter~0 0)} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {1314#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:24,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {1314#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L13: 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] {1314#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:24,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {1314#(<= ~counter~0 0)} [81] L13-->L13-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[] {1314#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:24,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {1314#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1314#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:24,098 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1314#(<= ~counter~0 0)} {1314#(<= ~counter~0 0)} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {1314#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:24,098 INFO L272 TraceCheckUtils]: 11: Hoare triple {1314#(<= ~counter~0 0)} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {1314#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:24,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {1314#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L13: 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] {1314#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:24,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {1314#(<= ~counter~0 0)} [81] L13-->L13-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[] {1314#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:24,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {1314#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1314#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:24,100 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1314#(<= ~counter~0 0)} {1314#(<= ~counter~0 0)} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {1314#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:24,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {1314#(<= ~counter~0 0)} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1314#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:24,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {1314#(<= ~counter~0 0)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1363#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:24,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {1363#(<= ~counter~0 1)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1363#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:24,101 INFO L272 TraceCheckUtils]: 19: Hoare triple {1363#(<= ~counter~0 1)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1363#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:24,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {1363#(<= ~counter~0 1)} [89] __VERIFIER_assertENTRY-->L16: 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] {1363#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:24,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {1363#(<= ~counter~0 1)} [93] L16-->L16-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[] {1363#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:24,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {1363#(<= ~counter~0 1)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1363#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:24,103 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1363#(<= ~counter~0 1)} {1363#(<= ~counter~0 1)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1363#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:24,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {1363#(<= ~counter~0 1)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1363#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:24,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {1363#(<= ~counter~0 1)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1363#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:24,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {1363#(<= ~counter~0 1)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1391#(<= ~counter~0 2)} is VALID [2022-04-07 20:36:24,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {1391#(<= ~counter~0 2)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1391#(<= ~counter~0 2)} is VALID [2022-04-07 20:36:24,106 INFO L272 TraceCheckUtils]: 28: Hoare triple {1391#(<= ~counter~0 2)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1391#(<= ~counter~0 2)} is VALID [2022-04-07 20:36:24,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {1391#(<= ~counter~0 2)} [89] __VERIFIER_assertENTRY-->L16: 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] {1391#(<= ~counter~0 2)} is VALID [2022-04-07 20:36:24,107 INFO L290 TraceCheckUtils]: 30: Hoare triple {1391#(<= ~counter~0 2)} [93] L16-->L16-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[] {1391#(<= ~counter~0 2)} is VALID [2022-04-07 20:36:24,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {1391#(<= ~counter~0 2)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1391#(<= ~counter~0 2)} is VALID [2022-04-07 20:36:24,108 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1391#(<= ~counter~0 2)} {1391#(<= ~counter~0 2)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1391#(<= ~counter~0 2)} is VALID [2022-04-07 20:36:24,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {1391#(<= ~counter~0 2)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1391#(<= ~counter~0 2)} is VALID [2022-04-07 20:36:24,108 INFO L290 TraceCheckUtils]: 34: Hoare triple {1391#(<= ~counter~0 2)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1391#(<= ~counter~0 2)} is VALID [2022-04-07 20:36:24,109 INFO L290 TraceCheckUtils]: 35: Hoare triple {1391#(<= ~counter~0 2)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1419#(<= ~counter~0 3)} is VALID [2022-04-07 20:36:24,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {1419#(<= ~counter~0 3)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1419#(<= ~counter~0 3)} is VALID [2022-04-07 20:36:24,110 INFO L272 TraceCheckUtils]: 37: Hoare triple {1419#(<= ~counter~0 3)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1419#(<= ~counter~0 3)} is VALID [2022-04-07 20:36:24,110 INFO L290 TraceCheckUtils]: 38: Hoare triple {1419#(<= ~counter~0 3)} [89] __VERIFIER_assertENTRY-->L16: 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] {1419#(<= ~counter~0 3)} is VALID [2022-04-07 20:36:24,110 INFO L290 TraceCheckUtils]: 39: Hoare triple {1419#(<= ~counter~0 3)} [93] L16-->L16-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[] {1419#(<= ~counter~0 3)} is VALID [2022-04-07 20:36:24,110 INFO L290 TraceCheckUtils]: 40: Hoare triple {1419#(<= ~counter~0 3)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1419#(<= ~counter~0 3)} is VALID [2022-04-07 20:36:24,111 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1419#(<= ~counter~0 3)} {1419#(<= ~counter~0 3)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1419#(<= ~counter~0 3)} is VALID [2022-04-07 20:36:24,111 INFO L290 TraceCheckUtils]: 42: Hoare triple {1419#(<= ~counter~0 3)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1419#(<= ~counter~0 3)} is VALID [2022-04-07 20:36:24,112 INFO L290 TraceCheckUtils]: 43: Hoare triple {1419#(<= ~counter~0 3)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1419#(<= ~counter~0 3)} is VALID [2022-04-07 20:36:24,112 INFO L290 TraceCheckUtils]: 44: Hoare triple {1419#(<= ~counter~0 3)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1447#(<= ~counter~0 4)} is VALID [2022-04-07 20:36:24,112 INFO L290 TraceCheckUtils]: 45: Hoare triple {1447#(<= ~counter~0 4)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1447#(<= ~counter~0 4)} is VALID [2022-04-07 20:36:24,113 INFO L272 TraceCheckUtils]: 46: Hoare triple {1447#(<= ~counter~0 4)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1447#(<= ~counter~0 4)} is VALID [2022-04-07 20:36:24,113 INFO L290 TraceCheckUtils]: 47: Hoare triple {1447#(<= ~counter~0 4)} [89] __VERIFIER_assertENTRY-->L16: 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] {1447#(<= ~counter~0 4)} is VALID [2022-04-07 20:36:24,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {1447#(<= ~counter~0 4)} [93] L16-->L16-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[] {1447#(<= ~counter~0 4)} is VALID [2022-04-07 20:36:24,115 INFO L290 TraceCheckUtils]: 49: Hoare triple {1447#(<= ~counter~0 4)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1447#(<= ~counter~0 4)} is VALID [2022-04-07 20:36:24,116 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1447#(<= ~counter~0 4)} {1447#(<= ~counter~0 4)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1447#(<= ~counter~0 4)} is VALID [2022-04-07 20:36:24,117 INFO L290 TraceCheckUtils]: 51: Hoare triple {1447#(<= ~counter~0 4)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1447#(<= ~counter~0 4)} is VALID [2022-04-07 20:36:24,118 INFO L290 TraceCheckUtils]: 52: Hoare triple {1447#(<= ~counter~0 4)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1447#(<= ~counter~0 4)} is VALID [2022-04-07 20:36:24,119 INFO L290 TraceCheckUtils]: 53: Hoare triple {1447#(<= ~counter~0 4)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1475#(<= |main_#t~post6| 4)} is VALID [2022-04-07 20:36:24,121 INFO L290 TraceCheckUtils]: 54: Hoare triple {1475#(<= |main_#t~post6| 4)} [86] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1307#false} is VALID [2022-04-07 20:36:24,122 INFO L272 TraceCheckUtils]: 55: Hoare triple {1307#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1307#false} is VALID [2022-04-07 20:36:24,122 INFO L290 TraceCheckUtils]: 56: Hoare triple {1307#false} [89] __VERIFIER_assertENTRY-->L16: 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] {1307#false} is VALID [2022-04-07 20:36:24,122 INFO L290 TraceCheckUtils]: 57: Hoare triple {1307#false} [92] L16-->L17: 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[] {1307#false} is VALID [2022-04-07 20:36:24,122 INFO L290 TraceCheckUtils]: 58: Hoare triple {1307#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1307#false} is VALID [2022-04-07 20:36:24,122 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 20:36:24,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 20:36:24,407 INFO L290 TraceCheckUtils]: 58: Hoare triple {1307#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1307#false} is VALID [2022-04-07 20:36:24,407 INFO L290 TraceCheckUtils]: 57: Hoare triple {1307#false} [92] L16-->L17: 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[] {1307#false} is VALID [2022-04-07 20:36:24,407 INFO L290 TraceCheckUtils]: 56: Hoare triple {1307#false} [89] __VERIFIER_assertENTRY-->L16: 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] {1307#false} is VALID [2022-04-07 20:36:24,407 INFO L272 TraceCheckUtils]: 55: Hoare triple {1307#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1307#false} is VALID [2022-04-07 20:36:24,408 INFO L290 TraceCheckUtils]: 54: Hoare triple {1503#(< |main_#t~post6| 20)} [86] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1307#false} is VALID [2022-04-07 20:36:24,408 INFO L290 TraceCheckUtils]: 53: Hoare triple {1507#(< ~counter~0 20)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1503#(< |main_#t~post6| 20)} is VALID [2022-04-07 20:36:24,408 INFO L290 TraceCheckUtils]: 52: Hoare triple {1507#(< ~counter~0 20)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1507#(< ~counter~0 20)} is VALID [2022-04-07 20:36:24,409 INFO L290 TraceCheckUtils]: 51: Hoare triple {1507#(< ~counter~0 20)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1507#(< ~counter~0 20)} is VALID [2022-04-07 20:36:24,409 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1306#true} {1507#(< ~counter~0 20)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1507#(< ~counter~0 20)} is VALID [2022-04-07 20:36:24,410 INFO L290 TraceCheckUtils]: 49: Hoare triple {1306#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 20:36:24,410 INFO L290 TraceCheckUtils]: 48: Hoare triple {1306#true} [93] L16-->L16-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[] {1306#true} is VALID [2022-04-07 20:36:24,410 INFO L290 TraceCheckUtils]: 47: Hoare triple {1306#true} [89] __VERIFIER_assertENTRY-->L16: 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] {1306#true} is VALID [2022-04-07 20:36:24,410 INFO L272 TraceCheckUtils]: 46: Hoare triple {1507#(< ~counter~0 20)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1306#true} is VALID [2022-04-07 20:36:24,410 INFO L290 TraceCheckUtils]: 45: Hoare triple {1507#(< ~counter~0 20)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1507#(< ~counter~0 20)} is VALID [2022-04-07 20:36:24,411 INFO L290 TraceCheckUtils]: 44: Hoare triple {1535#(< ~counter~0 19)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1507#(< ~counter~0 20)} is VALID [2022-04-07 20:36:24,411 INFO L290 TraceCheckUtils]: 43: Hoare triple {1535#(< ~counter~0 19)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1535#(< ~counter~0 19)} is VALID [2022-04-07 20:36:24,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {1535#(< ~counter~0 19)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1535#(< ~counter~0 19)} is VALID [2022-04-07 20:36:24,412 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1306#true} {1535#(< ~counter~0 19)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1535#(< ~counter~0 19)} is VALID [2022-04-07 20:36:24,412 INFO L290 TraceCheckUtils]: 40: Hoare triple {1306#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 20:36:24,412 INFO L290 TraceCheckUtils]: 39: Hoare triple {1306#true} [93] L16-->L16-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[] {1306#true} is VALID [2022-04-07 20:36:24,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {1306#true} [89] __VERIFIER_assertENTRY-->L16: 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] {1306#true} is VALID [2022-04-07 20:36:24,412 INFO L272 TraceCheckUtils]: 37: Hoare triple {1535#(< ~counter~0 19)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1306#true} is VALID [2022-04-07 20:36:24,413 INFO L290 TraceCheckUtils]: 36: Hoare triple {1535#(< ~counter~0 19)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1535#(< ~counter~0 19)} is VALID [2022-04-07 20:36:24,413 INFO L290 TraceCheckUtils]: 35: Hoare triple {1563#(< ~counter~0 18)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1535#(< ~counter~0 19)} is VALID [2022-04-07 20:36:24,414 INFO L290 TraceCheckUtils]: 34: Hoare triple {1563#(< ~counter~0 18)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1563#(< ~counter~0 18)} is VALID [2022-04-07 20:36:24,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {1563#(< ~counter~0 18)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1563#(< ~counter~0 18)} is VALID [2022-04-07 20:36:24,415 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1306#true} {1563#(< ~counter~0 18)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1563#(< ~counter~0 18)} is VALID [2022-04-07 20:36:24,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {1306#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 20:36:24,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {1306#true} [93] L16-->L16-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[] {1306#true} is VALID [2022-04-07 20:36:24,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {1306#true} [89] __VERIFIER_assertENTRY-->L16: 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] {1306#true} is VALID [2022-04-07 20:36:24,415 INFO L272 TraceCheckUtils]: 28: Hoare triple {1563#(< ~counter~0 18)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1306#true} is VALID [2022-04-07 20:36:24,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {1563#(< ~counter~0 18)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1563#(< ~counter~0 18)} is VALID [2022-04-07 20:36:24,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {1591#(< ~counter~0 17)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1563#(< ~counter~0 18)} is VALID [2022-04-07 20:36:24,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {1591#(< ~counter~0 17)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1591#(< ~counter~0 17)} is VALID [2022-04-07 20:36:24,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {1591#(< ~counter~0 17)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1591#(< ~counter~0 17)} is VALID [2022-04-07 20:36:24,417 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1306#true} {1591#(< ~counter~0 17)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1591#(< ~counter~0 17)} is VALID [2022-04-07 20:36:24,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {1306#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 20:36:24,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {1306#true} [93] L16-->L16-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[] {1306#true} is VALID [2022-04-07 20:36:24,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {1306#true} [89] __VERIFIER_assertENTRY-->L16: 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] {1306#true} is VALID [2022-04-07 20:36:24,418 INFO L272 TraceCheckUtils]: 19: Hoare triple {1591#(< ~counter~0 17)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1306#true} is VALID [2022-04-07 20:36:24,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {1591#(< ~counter~0 17)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1591#(< ~counter~0 17)} is VALID [2022-04-07 20:36:24,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {1619#(< ~counter~0 16)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1591#(< ~counter~0 17)} is VALID [2022-04-07 20:36:24,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {1619#(< ~counter~0 16)} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1619#(< ~counter~0 16)} is VALID [2022-04-07 20:36:24,420 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1306#true} {1619#(< ~counter~0 16)} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {1619#(< ~counter~0 16)} is VALID [2022-04-07 20:36:24,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {1306#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 20:36:24,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {1306#true} [81] L13-->L13-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[] {1306#true} is VALID [2022-04-07 20:36:24,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {1306#true} [78] assume_abort_if_notENTRY-->L13: 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] {1306#true} is VALID [2022-04-07 20:36:24,421 INFO L272 TraceCheckUtils]: 11: Hoare triple {1619#(< ~counter~0 16)} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {1306#true} is VALID [2022-04-07 20:36:24,422 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1306#true} {1619#(< ~counter~0 16)} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {1619#(< ~counter~0 16)} is VALID [2022-04-07 20:36:24,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {1306#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 20:36:24,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {1306#true} [81] L13-->L13-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[] {1306#true} is VALID [2022-04-07 20:36:24,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {1306#true} [78] assume_abort_if_notENTRY-->L13: 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] {1306#true} is VALID [2022-04-07 20:36:24,422 INFO L272 TraceCheckUtils]: 6: Hoare triple {1619#(< ~counter~0 16)} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {1306#true} is VALID [2022-04-07 20:36:24,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {1619#(< ~counter~0 16)} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1619#(< ~counter~0 16)} is VALID [2022-04-07 20:36:24,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {1619#(< ~counter~0 16)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1619#(< ~counter~0 16)} is VALID [2022-04-07 20:36:24,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1619#(< ~counter~0 16)} {1306#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1619#(< ~counter~0 16)} is VALID [2022-04-07 20:36:24,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {1619#(< ~counter~0 16)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1619#(< ~counter~0 16)} is VALID [2022-04-07 20:36:24,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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 .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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {1619#(< ~counter~0 16)} is VALID [2022-04-07 20:36:24,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 20:36:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-07 20:36:24,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:36:24,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656494571] [2022-04-07 20:36:24,425 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:36:24,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830647040] [2022-04-07 20:36:24,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830647040] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 20:36:24,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 20:36:24,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-07 20:36:24,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485297631] [2022-04-07 20:36:24,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 20:36:24,426 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-04-07 20:36:24,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:36:24,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-07 20:36:24,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:36:24,501 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 20:36:24,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:36:24,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 20:36:24,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-07 20:36:24,502 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-07 20:36:24,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:24,879 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-07 20:36:24,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-07 20:36:24,880 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-04-07 20:36:24,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:36:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-07 20:36:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 126 transitions. [2022-04-07 20:36:24,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-07 20:36:24,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 126 transitions. [2022-04-07 20:36:24,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 126 transitions. [2022-04-07 20:36:24,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:36:24,975 INFO L225 Difference]: With dead ends: 110 [2022-04-07 20:36:24,975 INFO L226 Difference]: Without dead ends: 110 [2022-04-07 20:36:24,976 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-07 20:36:24,976 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 122 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 20:36:24,976 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 142 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 20:36:24,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-07 20:36:24,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-07 20:36:24,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:36:24,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 20:36:24,982 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 20:36:24,982 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 20:36:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:24,985 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-07 20:36:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-07 20:36:24,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:36:24,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:36:24,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-07 20:36:24,986 INFO L87 Difference]: Start difference. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-07 20:36:24,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:24,988 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-07 20:36:24,988 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-07 20:36:24,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:36:24,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:36:24,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:36:24,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:36:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 20:36:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-04-07 20:36:24,992 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 59 [2022-04-07 20:36:24,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:36:24,992 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-04-07 20:36:24,992 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-07 20:36:24,992 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-07 20:36:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-07 20:36:24,993 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:36:24,993 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:36:25,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 20:36:25,207 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:36:25,207 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:36:25,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:36:25,208 INFO L85 PathProgramCache]: Analyzing trace with hash 191644600, now seen corresponding path program 3 times [2022-04-07 20:36:25,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:36:25,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617445582] [2022-04-07 20:36:25,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:36:25,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:36:25,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:36:25,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2081469602] [2022-04-07 20:36:25,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 20:36:25,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:36:25,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:36:25,223 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-07 20:36:25,224 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-07 20:36:25,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-07 20:36:25,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 20:36:25,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 20:36:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 20:36:25,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 20:36:25,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {2131#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2131#true} is VALID [2022-04-07 20:36:25,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {2131#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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 .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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {2139#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:25,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {2139#(<= ~counter~0 0)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:25,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2139#(<= ~counter~0 0)} {2131#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:25,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {2139#(<= ~counter~0 0)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:25,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {2139#(<= ~counter~0 0)} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2139#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:25,890 INFO L272 TraceCheckUtils]: 6: Hoare triple {2139#(<= ~counter~0 0)} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {2139#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:25,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {2139#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L13: 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] {2139#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:25,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {2139#(<= ~counter~0 0)} [81] L13-->L13-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[] {2139#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:25,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {2139#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:25,891 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2139#(<= ~counter~0 0)} {2139#(<= ~counter~0 0)} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {2139#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:25,891 INFO L272 TraceCheckUtils]: 11: Hoare triple {2139#(<= ~counter~0 0)} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {2139#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:25,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {2139#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L13: 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] {2139#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:25,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {2139#(<= ~counter~0 0)} [81] L13-->L13-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[] {2139#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:25,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {2139#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2139#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:25,893 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2139#(<= ~counter~0 0)} {2139#(<= ~counter~0 0)} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {2139#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:25,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {2139#(<= ~counter~0 0)} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2139#(<= ~counter~0 0)} is VALID [2022-04-07 20:36:25,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {2139#(<= ~counter~0 0)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2188#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:25,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {2188#(<= ~counter~0 1)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2188#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:25,895 INFO L272 TraceCheckUtils]: 19: Hoare triple {2188#(<= ~counter~0 1)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2188#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:25,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {2188#(<= ~counter~0 1)} [89] __VERIFIER_assertENTRY-->L16: 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] {2188#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:25,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {2188#(<= ~counter~0 1)} [93] L16-->L16-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[] {2188#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:25,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {2188#(<= ~counter~0 1)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2188#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:25,896 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2188#(<= ~counter~0 1)} {2188#(<= ~counter~0 1)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2188#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:25,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {2188#(<= ~counter~0 1)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2188#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:25,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {2188#(<= ~counter~0 1)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2188#(<= ~counter~0 1)} is VALID [2022-04-07 20:36:25,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {2188#(<= ~counter~0 1)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2216#(<= ~counter~0 2)} is VALID [2022-04-07 20:36:25,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {2216#(<= ~counter~0 2)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2216#(<= ~counter~0 2)} is VALID [2022-04-07 20:36:25,898 INFO L272 TraceCheckUtils]: 28: Hoare triple {2216#(<= ~counter~0 2)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2216#(<= ~counter~0 2)} is VALID [2022-04-07 20:36:25,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {2216#(<= ~counter~0 2)} [89] __VERIFIER_assertENTRY-->L16: 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] {2216#(<= ~counter~0 2)} is VALID [2022-04-07 20:36:25,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {2216#(<= ~counter~0 2)} [93] L16-->L16-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[] {2216#(<= ~counter~0 2)} is VALID [2022-04-07 20:36:25,899 INFO L290 TraceCheckUtils]: 31: Hoare triple {2216#(<= ~counter~0 2)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2216#(<= ~counter~0 2)} is VALID [2022-04-07 20:36:25,899 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2216#(<= ~counter~0 2)} {2216#(<= ~counter~0 2)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2216#(<= ~counter~0 2)} is VALID [2022-04-07 20:36:25,900 INFO L290 TraceCheckUtils]: 33: Hoare triple {2216#(<= ~counter~0 2)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2216#(<= ~counter~0 2)} is VALID [2022-04-07 20:36:25,900 INFO L290 TraceCheckUtils]: 34: Hoare triple {2216#(<= ~counter~0 2)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2216#(<= ~counter~0 2)} is VALID [2022-04-07 20:36:25,900 INFO L290 TraceCheckUtils]: 35: Hoare triple {2216#(<= ~counter~0 2)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2244#(<= ~counter~0 3)} is VALID [2022-04-07 20:36:25,901 INFO L290 TraceCheckUtils]: 36: Hoare triple {2244#(<= ~counter~0 3)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2244#(<= ~counter~0 3)} is VALID [2022-04-07 20:36:25,901 INFO L272 TraceCheckUtils]: 37: Hoare triple {2244#(<= ~counter~0 3)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2244#(<= ~counter~0 3)} is VALID [2022-04-07 20:36:25,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {2244#(<= ~counter~0 3)} [89] __VERIFIER_assertENTRY-->L16: 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] {2244#(<= ~counter~0 3)} is VALID [2022-04-07 20:36:25,902 INFO L290 TraceCheckUtils]: 39: Hoare triple {2244#(<= ~counter~0 3)} [93] L16-->L16-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[] {2244#(<= ~counter~0 3)} is VALID [2022-04-07 20:36:25,902 INFO L290 TraceCheckUtils]: 40: Hoare triple {2244#(<= ~counter~0 3)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2244#(<= ~counter~0 3)} is VALID [2022-04-07 20:36:25,902 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2244#(<= ~counter~0 3)} {2244#(<= ~counter~0 3)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2244#(<= ~counter~0 3)} is VALID [2022-04-07 20:36:25,903 INFO L290 TraceCheckUtils]: 42: Hoare triple {2244#(<= ~counter~0 3)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2244#(<= ~counter~0 3)} is VALID [2022-04-07 20:36:25,903 INFO L290 TraceCheckUtils]: 43: Hoare triple {2244#(<= ~counter~0 3)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2244#(<= ~counter~0 3)} is VALID [2022-04-07 20:36:25,903 INFO L290 TraceCheckUtils]: 44: Hoare triple {2244#(<= ~counter~0 3)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2272#(<= ~counter~0 4)} is VALID [2022-04-07 20:36:25,904 INFO L290 TraceCheckUtils]: 45: Hoare triple {2272#(<= ~counter~0 4)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2272#(<= ~counter~0 4)} is VALID [2022-04-07 20:36:25,904 INFO L272 TraceCheckUtils]: 46: Hoare triple {2272#(<= ~counter~0 4)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2272#(<= ~counter~0 4)} is VALID [2022-04-07 20:36:25,905 INFO L290 TraceCheckUtils]: 47: Hoare triple {2272#(<= ~counter~0 4)} [89] __VERIFIER_assertENTRY-->L16: 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] {2272#(<= ~counter~0 4)} is VALID [2022-04-07 20:36:25,905 INFO L290 TraceCheckUtils]: 48: Hoare triple {2272#(<= ~counter~0 4)} [93] L16-->L16-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[] {2272#(<= ~counter~0 4)} is VALID [2022-04-07 20:36:25,905 INFO L290 TraceCheckUtils]: 49: Hoare triple {2272#(<= ~counter~0 4)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2272#(<= ~counter~0 4)} is VALID [2022-04-07 20:36:25,906 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2272#(<= ~counter~0 4)} {2272#(<= ~counter~0 4)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2272#(<= ~counter~0 4)} is VALID [2022-04-07 20:36:25,906 INFO L290 TraceCheckUtils]: 51: Hoare triple {2272#(<= ~counter~0 4)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2272#(<= ~counter~0 4)} is VALID [2022-04-07 20:36:25,906 INFO L290 TraceCheckUtils]: 52: Hoare triple {2272#(<= ~counter~0 4)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2272#(<= ~counter~0 4)} is VALID [2022-04-07 20:36:25,907 INFO L290 TraceCheckUtils]: 53: Hoare triple {2272#(<= ~counter~0 4)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2300#(<= ~counter~0 5)} is VALID [2022-04-07 20:36:25,907 INFO L290 TraceCheckUtils]: 54: Hoare triple {2300#(<= ~counter~0 5)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2300#(<= ~counter~0 5)} is VALID [2022-04-07 20:36:25,908 INFO L272 TraceCheckUtils]: 55: Hoare triple {2300#(<= ~counter~0 5)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2300#(<= ~counter~0 5)} is VALID [2022-04-07 20:36:25,908 INFO L290 TraceCheckUtils]: 56: Hoare triple {2300#(<= ~counter~0 5)} [89] __VERIFIER_assertENTRY-->L16: 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] {2300#(<= ~counter~0 5)} is VALID [2022-04-07 20:36:25,908 INFO L290 TraceCheckUtils]: 57: Hoare triple {2300#(<= ~counter~0 5)} [93] L16-->L16-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[] {2300#(<= ~counter~0 5)} is VALID [2022-04-07 20:36:25,908 INFO L290 TraceCheckUtils]: 58: Hoare triple {2300#(<= ~counter~0 5)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2300#(<= ~counter~0 5)} is VALID [2022-04-07 20:36:25,924 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2300#(<= ~counter~0 5)} {2300#(<= ~counter~0 5)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2300#(<= ~counter~0 5)} is VALID [2022-04-07 20:36:25,925 INFO L290 TraceCheckUtils]: 60: Hoare triple {2300#(<= ~counter~0 5)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2300#(<= ~counter~0 5)} is VALID [2022-04-07 20:36:25,931 INFO L290 TraceCheckUtils]: 61: Hoare triple {2300#(<= ~counter~0 5)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2300#(<= ~counter~0 5)} is VALID [2022-04-07 20:36:25,931 INFO L290 TraceCheckUtils]: 62: Hoare triple {2300#(<= ~counter~0 5)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2328#(<= ~counter~0 6)} is VALID [2022-04-07 20:36:25,932 INFO L290 TraceCheckUtils]: 63: Hoare triple {2328#(<= ~counter~0 6)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2328#(<= ~counter~0 6)} is VALID [2022-04-07 20:36:25,932 INFO L272 TraceCheckUtils]: 64: Hoare triple {2328#(<= ~counter~0 6)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2328#(<= ~counter~0 6)} is VALID [2022-04-07 20:36:25,932 INFO L290 TraceCheckUtils]: 65: Hoare triple {2328#(<= ~counter~0 6)} [89] __VERIFIER_assertENTRY-->L16: 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] {2328#(<= ~counter~0 6)} is VALID [2022-04-07 20:36:25,933 INFO L290 TraceCheckUtils]: 66: Hoare triple {2328#(<= ~counter~0 6)} [93] L16-->L16-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[] {2328#(<= ~counter~0 6)} is VALID [2022-04-07 20:36:25,933 INFO L290 TraceCheckUtils]: 67: Hoare triple {2328#(<= ~counter~0 6)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2328#(<= ~counter~0 6)} is VALID [2022-04-07 20:36:25,933 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2328#(<= ~counter~0 6)} {2328#(<= ~counter~0 6)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2328#(<= ~counter~0 6)} is VALID [2022-04-07 20:36:25,934 INFO L290 TraceCheckUtils]: 69: Hoare triple {2328#(<= ~counter~0 6)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2328#(<= ~counter~0 6)} is VALID [2022-04-07 20:36:25,934 INFO L290 TraceCheckUtils]: 70: Hoare triple {2328#(<= ~counter~0 6)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2328#(<= ~counter~0 6)} is VALID [2022-04-07 20:36:25,934 INFO L290 TraceCheckUtils]: 71: Hoare triple {2328#(<= ~counter~0 6)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2356#(<= ~counter~0 7)} is VALID [2022-04-07 20:36:25,935 INFO L290 TraceCheckUtils]: 72: Hoare triple {2356#(<= ~counter~0 7)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2356#(<= ~counter~0 7)} is VALID [2022-04-07 20:36:25,935 INFO L272 TraceCheckUtils]: 73: Hoare triple {2356#(<= ~counter~0 7)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2356#(<= ~counter~0 7)} is VALID [2022-04-07 20:36:25,935 INFO L290 TraceCheckUtils]: 74: Hoare triple {2356#(<= ~counter~0 7)} [89] __VERIFIER_assertENTRY-->L16: 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] {2356#(<= ~counter~0 7)} is VALID [2022-04-07 20:36:25,936 INFO L290 TraceCheckUtils]: 75: Hoare triple {2356#(<= ~counter~0 7)} [93] L16-->L16-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[] {2356#(<= ~counter~0 7)} is VALID [2022-04-07 20:36:25,936 INFO L290 TraceCheckUtils]: 76: Hoare triple {2356#(<= ~counter~0 7)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2356#(<= ~counter~0 7)} is VALID [2022-04-07 20:36:25,936 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {2356#(<= ~counter~0 7)} {2356#(<= ~counter~0 7)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2356#(<= ~counter~0 7)} is VALID [2022-04-07 20:36:25,937 INFO L290 TraceCheckUtils]: 78: Hoare triple {2356#(<= ~counter~0 7)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2356#(<= ~counter~0 7)} is VALID [2022-04-07 20:36:25,937 INFO L290 TraceCheckUtils]: 79: Hoare triple {2356#(<= ~counter~0 7)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2356#(<= ~counter~0 7)} is VALID [2022-04-07 20:36:25,937 INFO L290 TraceCheckUtils]: 80: Hoare triple {2356#(<= ~counter~0 7)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2384#(<= ~counter~0 8)} is VALID [2022-04-07 20:36:25,937 INFO L290 TraceCheckUtils]: 81: Hoare triple {2384#(<= ~counter~0 8)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2384#(<= ~counter~0 8)} is VALID [2022-04-07 20:36:25,938 INFO L272 TraceCheckUtils]: 82: Hoare triple {2384#(<= ~counter~0 8)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2384#(<= ~counter~0 8)} is VALID [2022-04-07 20:36:25,938 INFO L290 TraceCheckUtils]: 83: Hoare triple {2384#(<= ~counter~0 8)} [89] __VERIFIER_assertENTRY-->L16: 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] {2384#(<= ~counter~0 8)} is VALID [2022-04-07 20:36:25,938 INFO L290 TraceCheckUtils]: 84: Hoare triple {2384#(<= ~counter~0 8)} [93] L16-->L16-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[] {2384#(<= ~counter~0 8)} is VALID [2022-04-07 20:36:25,939 INFO L290 TraceCheckUtils]: 85: Hoare triple {2384#(<= ~counter~0 8)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2384#(<= ~counter~0 8)} is VALID [2022-04-07 20:36:25,939 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {2384#(<= ~counter~0 8)} {2384#(<= ~counter~0 8)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2384#(<= ~counter~0 8)} is VALID [2022-04-07 20:36:25,939 INFO L290 TraceCheckUtils]: 87: Hoare triple {2384#(<= ~counter~0 8)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2384#(<= ~counter~0 8)} is VALID [2022-04-07 20:36:25,940 INFO L290 TraceCheckUtils]: 88: Hoare triple {2384#(<= ~counter~0 8)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2384#(<= ~counter~0 8)} is VALID [2022-04-07 20:36:25,940 INFO L290 TraceCheckUtils]: 89: Hoare triple {2384#(<= ~counter~0 8)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2412#(<= ~counter~0 9)} is VALID [2022-04-07 20:36:25,940 INFO L290 TraceCheckUtils]: 90: Hoare triple {2412#(<= ~counter~0 9)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2412#(<= ~counter~0 9)} is VALID [2022-04-07 20:36:25,941 INFO L272 TraceCheckUtils]: 91: Hoare triple {2412#(<= ~counter~0 9)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2412#(<= ~counter~0 9)} is VALID [2022-04-07 20:36:25,941 INFO L290 TraceCheckUtils]: 92: Hoare triple {2412#(<= ~counter~0 9)} [89] __VERIFIER_assertENTRY-->L16: 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] {2412#(<= ~counter~0 9)} is VALID [2022-04-07 20:36:25,941 INFO L290 TraceCheckUtils]: 93: Hoare triple {2412#(<= ~counter~0 9)} [93] L16-->L16-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[] {2412#(<= ~counter~0 9)} is VALID [2022-04-07 20:36:25,942 INFO L290 TraceCheckUtils]: 94: Hoare triple {2412#(<= ~counter~0 9)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2412#(<= ~counter~0 9)} is VALID [2022-04-07 20:36:25,942 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {2412#(<= ~counter~0 9)} {2412#(<= ~counter~0 9)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2412#(<= ~counter~0 9)} is VALID [2022-04-07 20:36:25,942 INFO L290 TraceCheckUtils]: 96: Hoare triple {2412#(<= ~counter~0 9)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2412#(<= ~counter~0 9)} is VALID [2022-04-07 20:36:25,943 INFO L290 TraceCheckUtils]: 97: Hoare triple {2412#(<= ~counter~0 9)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2412#(<= ~counter~0 9)} is VALID [2022-04-07 20:36:25,943 INFO L290 TraceCheckUtils]: 98: Hoare triple {2412#(<= ~counter~0 9)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2440#(<= ~counter~0 10)} is VALID [2022-04-07 20:36:25,943 INFO L290 TraceCheckUtils]: 99: Hoare triple {2440#(<= ~counter~0 10)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2440#(<= ~counter~0 10)} is VALID [2022-04-07 20:36:25,944 INFO L272 TraceCheckUtils]: 100: Hoare triple {2440#(<= ~counter~0 10)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2440#(<= ~counter~0 10)} is VALID [2022-04-07 20:36:25,944 INFO L290 TraceCheckUtils]: 101: Hoare triple {2440#(<= ~counter~0 10)} [89] __VERIFIER_assertENTRY-->L16: 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] {2440#(<= ~counter~0 10)} is VALID [2022-04-07 20:36:25,944 INFO L290 TraceCheckUtils]: 102: Hoare triple {2440#(<= ~counter~0 10)} [93] L16-->L16-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[] {2440#(<= ~counter~0 10)} is VALID [2022-04-07 20:36:25,944 INFO L290 TraceCheckUtils]: 103: Hoare triple {2440#(<= ~counter~0 10)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2440#(<= ~counter~0 10)} is VALID [2022-04-07 20:36:25,945 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {2440#(<= ~counter~0 10)} {2440#(<= ~counter~0 10)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2440#(<= ~counter~0 10)} is VALID [2022-04-07 20:36:25,945 INFO L290 TraceCheckUtils]: 105: Hoare triple {2440#(<= ~counter~0 10)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2440#(<= ~counter~0 10)} is VALID [2022-04-07 20:36:25,945 INFO L290 TraceCheckUtils]: 106: Hoare triple {2440#(<= ~counter~0 10)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2440#(<= ~counter~0 10)} is VALID [2022-04-07 20:36:25,946 INFO L290 TraceCheckUtils]: 107: Hoare triple {2440#(<= ~counter~0 10)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2468#(<= |main_#t~post6| 10)} is VALID [2022-04-07 20:36:25,946 INFO L290 TraceCheckUtils]: 108: Hoare triple {2468#(<= |main_#t~post6| 10)} [86] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2132#false} is VALID [2022-04-07 20:36:25,946 INFO L272 TraceCheckUtils]: 109: Hoare triple {2132#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2132#false} is VALID [2022-04-07 20:36:25,946 INFO L290 TraceCheckUtils]: 110: Hoare triple {2132#false} [89] __VERIFIER_assertENTRY-->L16: 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] {2132#false} is VALID [2022-04-07 20:36:25,946 INFO L290 TraceCheckUtils]: 111: Hoare triple {2132#false} [92] L16-->L17: 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[] {2132#false} is VALID [2022-04-07 20:36:25,947 INFO L290 TraceCheckUtils]: 112: Hoare triple {2132#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#false} is VALID [2022-04-07 20:36:25,947 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 20:36:25,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 20:36:26,559 INFO L290 TraceCheckUtils]: 112: Hoare triple {2132#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#false} is VALID [2022-04-07 20:36:26,560 INFO L290 TraceCheckUtils]: 111: Hoare triple {2132#false} [92] L16-->L17: 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[] {2132#false} is VALID [2022-04-07 20:36:26,560 INFO L290 TraceCheckUtils]: 110: Hoare triple {2132#false} [89] __VERIFIER_assertENTRY-->L16: 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] {2132#false} is VALID [2022-04-07 20:36:26,560 INFO L272 TraceCheckUtils]: 109: Hoare triple {2132#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2132#false} is VALID [2022-04-07 20:36:26,560 INFO L290 TraceCheckUtils]: 108: Hoare triple {2496#(< |main_#t~post6| 20)} [86] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2132#false} is VALID [2022-04-07 20:36:26,561 INFO L290 TraceCheckUtils]: 107: Hoare triple {2500#(< ~counter~0 20)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2496#(< |main_#t~post6| 20)} is VALID [2022-04-07 20:36:26,561 INFO L290 TraceCheckUtils]: 106: Hoare triple {2500#(< ~counter~0 20)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2500#(< ~counter~0 20)} is VALID [2022-04-07 20:36:26,561 INFO L290 TraceCheckUtils]: 105: Hoare triple {2500#(< ~counter~0 20)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2500#(< ~counter~0 20)} is VALID [2022-04-07 20:36:26,562 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {2131#true} {2500#(< ~counter~0 20)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2500#(< ~counter~0 20)} is VALID [2022-04-07 20:36:26,562 INFO L290 TraceCheckUtils]: 103: Hoare triple {2131#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2131#true} is VALID [2022-04-07 20:36:26,562 INFO L290 TraceCheckUtils]: 102: Hoare triple {2131#true} [93] L16-->L16-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[] {2131#true} is VALID [2022-04-07 20:36:26,562 INFO L290 TraceCheckUtils]: 101: Hoare triple {2131#true} [89] __VERIFIER_assertENTRY-->L16: 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] {2131#true} is VALID [2022-04-07 20:36:26,562 INFO L272 TraceCheckUtils]: 100: Hoare triple {2500#(< ~counter~0 20)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2131#true} is VALID [2022-04-07 20:36:26,562 INFO L290 TraceCheckUtils]: 99: Hoare triple {2500#(< ~counter~0 20)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2500#(< ~counter~0 20)} is VALID [2022-04-07 20:36:26,563 INFO L290 TraceCheckUtils]: 98: Hoare triple {2528#(< ~counter~0 19)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2500#(< ~counter~0 20)} is VALID [2022-04-07 20:36:26,563 INFO L290 TraceCheckUtils]: 97: Hoare triple {2528#(< ~counter~0 19)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2528#(< ~counter~0 19)} is VALID [2022-04-07 20:36:26,563 INFO L290 TraceCheckUtils]: 96: Hoare triple {2528#(< ~counter~0 19)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2528#(< ~counter~0 19)} is VALID [2022-04-07 20:36:26,564 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {2131#true} {2528#(< ~counter~0 19)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2528#(< ~counter~0 19)} is VALID [2022-04-07 20:36:26,564 INFO L290 TraceCheckUtils]: 94: Hoare triple {2131#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2131#true} is VALID [2022-04-07 20:36:26,564 INFO L290 TraceCheckUtils]: 93: Hoare triple {2131#true} [93] L16-->L16-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[] {2131#true} is VALID [2022-04-07 20:36:26,564 INFO L290 TraceCheckUtils]: 92: Hoare triple {2131#true} [89] __VERIFIER_assertENTRY-->L16: 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] {2131#true} is VALID [2022-04-07 20:36:26,564 INFO L272 TraceCheckUtils]: 91: Hoare triple {2528#(< ~counter~0 19)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2131#true} is VALID [2022-04-07 20:36:26,564 INFO L290 TraceCheckUtils]: 90: Hoare triple {2528#(< ~counter~0 19)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2528#(< ~counter~0 19)} is VALID [2022-04-07 20:36:26,565 INFO L290 TraceCheckUtils]: 89: Hoare triple {2556#(< ~counter~0 18)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2528#(< ~counter~0 19)} is VALID [2022-04-07 20:36:26,565 INFO L290 TraceCheckUtils]: 88: Hoare triple {2556#(< ~counter~0 18)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2556#(< ~counter~0 18)} is VALID [2022-04-07 20:36:26,565 INFO L290 TraceCheckUtils]: 87: Hoare triple {2556#(< ~counter~0 18)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2556#(< ~counter~0 18)} is VALID [2022-04-07 20:36:26,566 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {2131#true} {2556#(< ~counter~0 18)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2556#(< ~counter~0 18)} is VALID [2022-04-07 20:36:26,566 INFO L290 TraceCheckUtils]: 85: Hoare triple {2131#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2131#true} is VALID [2022-04-07 20:36:26,566 INFO L290 TraceCheckUtils]: 84: Hoare triple {2131#true} [93] L16-->L16-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[] {2131#true} is VALID [2022-04-07 20:36:26,566 INFO L290 TraceCheckUtils]: 83: Hoare triple {2131#true} [89] __VERIFIER_assertENTRY-->L16: 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] {2131#true} is VALID [2022-04-07 20:36:26,566 INFO L272 TraceCheckUtils]: 82: Hoare triple {2556#(< ~counter~0 18)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2131#true} is VALID [2022-04-07 20:36:26,566 INFO L290 TraceCheckUtils]: 81: Hoare triple {2556#(< ~counter~0 18)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2556#(< ~counter~0 18)} is VALID [2022-04-07 20:36:26,567 INFO L290 TraceCheckUtils]: 80: Hoare triple {2584#(< ~counter~0 17)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2556#(< ~counter~0 18)} is VALID [2022-04-07 20:36:26,567 INFO L290 TraceCheckUtils]: 79: Hoare triple {2584#(< ~counter~0 17)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2584#(< ~counter~0 17)} is VALID [2022-04-07 20:36:26,567 INFO L290 TraceCheckUtils]: 78: Hoare triple {2584#(< ~counter~0 17)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2584#(< ~counter~0 17)} is VALID [2022-04-07 20:36:26,568 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {2131#true} {2584#(< ~counter~0 17)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2584#(< ~counter~0 17)} is VALID [2022-04-07 20:36:26,568 INFO L290 TraceCheckUtils]: 76: Hoare triple {2131#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2131#true} is VALID [2022-04-07 20:36:26,568 INFO L290 TraceCheckUtils]: 75: Hoare triple {2131#true} [93] L16-->L16-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[] {2131#true} is VALID [2022-04-07 20:36:26,568 INFO L290 TraceCheckUtils]: 74: Hoare triple {2131#true} [89] __VERIFIER_assertENTRY-->L16: 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] {2131#true} is VALID [2022-04-07 20:36:26,568 INFO L272 TraceCheckUtils]: 73: Hoare triple {2584#(< ~counter~0 17)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2131#true} is VALID [2022-04-07 20:36:26,569 INFO L290 TraceCheckUtils]: 72: Hoare triple {2584#(< ~counter~0 17)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2584#(< ~counter~0 17)} is VALID [2022-04-07 20:36:26,570 INFO L290 TraceCheckUtils]: 71: Hoare triple {2612#(< ~counter~0 16)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2584#(< ~counter~0 17)} is VALID [2022-04-07 20:36:26,570 INFO L290 TraceCheckUtils]: 70: Hoare triple {2612#(< ~counter~0 16)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2612#(< ~counter~0 16)} is VALID [2022-04-07 20:36:26,571 INFO L290 TraceCheckUtils]: 69: Hoare triple {2612#(< ~counter~0 16)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2612#(< ~counter~0 16)} is VALID [2022-04-07 20:36:26,571 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2131#true} {2612#(< ~counter~0 16)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2612#(< ~counter~0 16)} is VALID [2022-04-07 20:36:26,571 INFO L290 TraceCheckUtils]: 67: Hoare triple {2131#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2131#true} is VALID [2022-04-07 20:36:26,571 INFO L290 TraceCheckUtils]: 66: Hoare triple {2131#true} [93] L16-->L16-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[] {2131#true} is VALID [2022-04-07 20:36:26,571 INFO L290 TraceCheckUtils]: 65: Hoare triple {2131#true} [89] __VERIFIER_assertENTRY-->L16: 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] {2131#true} is VALID [2022-04-07 20:36:26,571 INFO L272 TraceCheckUtils]: 64: Hoare triple {2612#(< ~counter~0 16)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2131#true} is VALID [2022-04-07 20:36:26,572 INFO L290 TraceCheckUtils]: 63: Hoare triple {2612#(< ~counter~0 16)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2612#(< ~counter~0 16)} is VALID [2022-04-07 20:36:26,572 INFO L290 TraceCheckUtils]: 62: Hoare triple {2640#(< ~counter~0 15)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2612#(< ~counter~0 16)} is VALID [2022-04-07 20:36:26,572 INFO L290 TraceCheckUtils]: 61: Hoare triple {2640#(< ~counter~0 15)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2640#(< ~counter~0 15)} is VALID [2022-04-07 20:36:26,573 INFO L290 TraceCheckUtils]: 60: Hoare triple {2640#(< ~counter~0 15)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2640#(< ~counter~0 15)} is VALID [2022-04-07 20:36:26,573 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2131#true} {2640#(< ~counter~0 15)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2640#(< ~counter~0 15)} is VALID [2022-04-07 20:36:26,573 INFO L290 TraceCheckUtils]: 58: Hoare triple {2131#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2131#true} is VALID [2022-04-07 20:36:26,574 INFO L290 TraceCheckUtils]: 57: Hoare triple {2131#true} [93] L16-->L16-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[] {2131#true} is VALID [2022-04-07 20:36:26,574 INFO L290 TraceCheckUtils]: 56: Hoare triple {2131#true} [89] __VERIFIER_assertENTRY-->L16: 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] {2131#true} is VALID [2022-04-07 20:36:26,574 INFO L272 TraceCheckUtils]: 55: Hoare triple {2640#(< ~counter~0 15)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2131#true} is VALID [2022-04-07 20:36:26,574 INFO L290 TraceCheckUtils]: 54: Hoare triple {2640#(< ~counter~0 15)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2640#(< ~counter~0 15)} is VALID [2022-04-07 20:36:26,574 INFO L290 TraceCheckUtils]: 53: Hoare triple {2668#(< ~counter~0 14)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2640#(< ~counter~0 15)} is VALID [2022-04-07 20:36:26,575 INFO L290 TraceCheckUtils]: 52: Hoare triple {2668#(< ~counter~0 14)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2668#(< ~counter~0 14)} is VALID [2022-04-07 20:36:26,575 INFO L290 TraceCheckUtils]: 51: Hoare triple {2668#(< ~counter~0 14)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2668#(< ~counter~0 14)} is VALID [2022-04-07 20:36:26,576 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2131#true} {2668#(< ~counter~0 14)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2668#(< ~counter~0 14)} is VALID [2022-04-07 20:36:26,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {2131#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2131#true} is VALID [2022-04-07 20:36:26,576 INFO L290 TraceCheckUtils]: 48: Hoare triple {2131#true} [93] L16-->L16-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[] {2131#true} is VALID [2022-04-07 20:36:26,576 INFO L290 TraceCheckUtils]: 47: Hoare triple {2131#true} [89] __VERIFIER_assertENTRY-->L16: 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] {2131#true} is VALID [2022-04-07 20:36:26,576 INFO L272 TraceCheckUtils]: 46: Hoare triple {2668#(< ~counter~0 14)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2131#true} is VALID [2022-04-07 20:36:26,576 INFO L290 TraceCheckUtils]: 45: Hoare triple {2668#(< ~counter~0 14)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2668#(< ~counter~0 14)} is VALID [2022-04-07 20:36:26,577 INFO L290 TraceCheckUtils]: 44: Hoare triple {2696#(< ~counter~0 13)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2668#(< ~counter~0 14)} is VALID [2022-04-07 20:36:26,577 INFO L290 TraceCheckUtils]: 43: Hoare triple {2696#(< ~counter~0 13)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2696#(< ~counter~0 13)} is VALID [2022-04-07 20:36:26,577 INFO L290 TraceCheckUtils]: 42: Hoare triple {2696#(< ~counter~0 13)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2696#(< ~counter~0 13)} is VALID [2022-04-07 20:36:26,578 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2131#true} {2696#(< ~counter~0 13)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2696#(< ~counter~0 13)} is VALID [2022-04-07 20:36:26,578 INFO L290 TraceCheckUtils]: 40: Hoare triple {2131#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2131#true} is VALID [2022-04-07 20:36:26,578 INFO L290 TraceCheckUtils]: 39: Hoare triple {2131#true} [93] L16-->L16-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[] {2131#true} is VALID [2022-04-07 20:36:26,578 INFO L290 TraceCheckUtils]: 38: Hoare triple {2131#true} [89] __VERIFIER_assertENTRY-->L16: 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] {2131#true} is VALID [2022-04-07 20:36:26,578 INFO L272 TraceCheckUtils]: 37: Hoare triple {2696#(< ~counter~0 13)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2131#true} is VALID [2022-04-07 20:36:26,578 INFO L290 TraceCheckUtils]: 36: Hoare triple {2696#(< ~counter~0 13)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2696#(< ~counter~0 13)} is VALID [2022-04-07 20:36:26,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {2724#(< ~counter~0 12)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2696#(< ~counter~0 13)} is VALID [2022-04-07 20:36:26,579 INFO L290 TraceCheckUtils]: 34: Hoare triple {2724#(< ~counter~0 12)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2724#(< ~counter~0 12)} is VALID [2022-04-07 20:36:26,579 INFO L290 TraceCheckUtils]: 33: Hoare triple {2724#(< ~counter~0 12)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2724#(< ~counter~0 12)} is VALID [2022-04-07 20:36:26,580 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2131#true} {2724#(< ~counter~0 12)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2724#(< ~counter~0 12)} is VALID [2022-04-07 20:36:26,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {2131#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2131#true} is VALID [2022-04-07 20:36:26,580 INFO L290 TraceCheckUtils]: 30: Hoare triple {2131#true} [93] L16-->L16-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[] {2131#true} is VALID [2022-04-07 20:36:26,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {2131#true} [89] __VERIFIER_assertENTRY-->L16: 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] {2131#true} is VALID [2022-04-07 20:36:26,580 INFO L272 TraceCheckUtils]: 28: Hoare triple {2724#(< ~counter~0 12)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2131#true} is VALID [2022-04-07 20:36:26,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {2724#(< ~counter~0 12)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2724#(< ~counter~0 12)} is VALID [2022-04-07 20:36:26,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {2440#(<= ~counter~0 10)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2724#(< ~counter~0 12)} is VALID [2022-04-07 20:36:26,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {2440#(<= ~counter~0 10)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2440#(<= ~counter~0 10)} is VALID [2022-04-07 20:36:26,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {2440#(<= ~counter~0 10)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {2440#(<= ~counter~0 10)} is VALID [2022-04-07 20:36:26,582 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2131#true} {2440#(<= ~counter~0 10)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2440#(<= ~counter~0 10)} is VALID [2022-04-07 20:36:26,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {2131#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2131#true} is VALID [2022-04-07 20:36:26,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {2131#true} [93] L16-->L16-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[] {2131#true} is VALID [2022-04-07 20:36:26,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {2131#true} [89] __VERIFIER_assertENTRY-->L16: 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] {2131#true} is VALID [2022-04-07 20:36:26,582 INFO L272 TraceCheckUtils]: 19: Hoare triple {2440#(<= ~counter~0 10)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2131#true} is VALID [2022-04-07 20:36:26,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {2440#(<= ~counter~0 10)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2440#(<= ~counter~0 10)} is VALID [2022-04-07 20:36:26,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {2412#(<= ~counter~0 9)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2440#(<= ~counter~0 10)} is VALID [2022-04-07 20:36:26,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {2412#(<= ~counter~0 9)} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {2412#(<= ~counter~0 9)} is VALID [2022-04-07 20:36:26,584 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2131#true} {2412#(<= ~counter~0 9)} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {2412#(<= ~counter~0 9)} is VALID [2022-04-07 20:36:26,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {2131#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2131#true} is VALID [2022-04-07 20:36:26,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {2131#true} [81] L13-->L13-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[] {2131#true} is VALID [2022-04-07 20:36:26,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {2131#true} [78] assume_abort_if_notENTRY-->L13: 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] {2131#true} is VALID [2022-04-07 20:36:26,584 INFO L272 TraceCheckUtils]: 11: Hoare triple {2412#(<= ~counter~0 9)} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {2131#true} is VALID [2022-04-07 20:36:26,585 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2131#true} {2412#(<= ~counter~0 9)} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {2412#(<= ~counter~0 9)} is VALID [2022-04-07 20:36:26,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {2131#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2131#true} is VALID [2022-04-07 20:36:26,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {2131#true} [81] L13-->L13-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[] {2131#true} is VALID [2022-04-07 20:36:26,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {2131#true} [78] assume_abort_if_notENTRY-->L13: 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] {2131#true} is VALID [2022-04-07 20:36:26,585 INFO L272 TraceCheckUtils]: 6: Hoare triple {2412#(<= ~counter~0 9)} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {2131#true} is VALID [2022-04-07 20:36:26,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {2412#(<= ~counter~0 9)} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {2412#(<= ~counter~0 9)} is VALID [2022-04-07 20:36:26,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {2412#(<= ~counter~0 9)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2412#(<= ~counter~0 9)} is VALID [2022-04-07 20:36:26,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2412#(<= ~counter~0 9)} {2131#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2412#(<= ~counter~0 9)} is VALID [2022-04-07 20:36:26,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {2412#(<= ~counter~0 9)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2412#(<= ~counter~0 9)} is VALID [2022-04-07 20:36:26,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {2131#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 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 .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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {2412#(<= ~counter~0 9)} is VALID [2022-04-07 20:36:26,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {2131#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2131#true} is VALID [2022-04-07 20:36:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-07 20:36:26,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 20:36:26,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617445582] [2022-04-07 20:36:26,587 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 20:36:26,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081469602] [2022-04-07 20:36:26,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081469602] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 20:36:26,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 20:36:26,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-07 20:36:26,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166692481] [2022-04-07 20:36:26,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 20:36:26,588 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) Word has length 113 [2022-04-07 20:36:26,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 20:36:26,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-07 20:36:26,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:36:26,705 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-07 20:36:26,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 20:36:26,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-07 20:36:26,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-07 20:36:26,706 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-07 20:36:27,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:27,382 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-04-07 20:36:27,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-07 20:36:27,383 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) Word has length 113 [2022-04-07 20:36:27,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 20:36:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-07 20:36:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 230 transitions. [2022-04-07 20:36:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-07 20:36:27,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 230 transitions. [2022-04-07 20:36:27,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 230 transitions. [2022-04-07 20:36:27,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 20:36:27,548 INFO L225 Difference]: With dead ends: 200 [2022-04-07 20:36:27,548 INFO L226 Difference]: Without dead ends: 200 [2022-04-07 20:36:27,549 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-04-07 20:36:27,550 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 217 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 20:36:27,550 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 234 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 20:36:27,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-04-07 20:36:27,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-04-07 20:36:27,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 20:36:27,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 20:36:27,571 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 20:36:27,571 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 20:36:27,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:27,578 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-04-07 20:36:27,578 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-04-07 20:36:27,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:36:27,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:36:27,579 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 200 states. [2022-04-07 20:36:27,580 INFO L87 Difference]: Start difference. First operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 200 states. [2022-04-07 20:36:27,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 20:36:27,585 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-04-07 20:36:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-04-07 20:36:27,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 20:36:27,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 20:36:27,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 20:36:27,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 20:36:27,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 20:36:27,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2022-04-07 20:36:27,591 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 113 [2022-04-07 20:36:27,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 20:36:27,591 INFO L478 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2022-04-07 20:36:27,592 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-07 20:36:27,592 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-04-07 20:36:27,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-04-07 20:36:27,594 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 20:36:27,594 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 20:36:27,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-07 20:36:27,810 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:36:27,811 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 20:36:27,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 20:36:27,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2040315496, now seen corresponding path program 4 times [2022-04-07 20:36:27,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 20:36:27,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419878021] [2022-04-07 20:36:27,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 20:36:27,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 20:36:27,851 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 20:36:27,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1300714296] [2022-04-07 20:36:27,851 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 20:36:27,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:36:27,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 20:36:27,861 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-07 20:36:27,872 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-07 20:36:27,962 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 20:36:27,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-07 20:36:27,962 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 20:36:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 20:36:28,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 20:36:28,106 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 20:36:28,107 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 20:36:28,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-07 20:36:28,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 20:36:28,325 INFO L719 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2022-04-07 20:36:28,328 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 20:36:28,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 08:36:28 BasicIcfg [2022-04-07 20:36:28,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 20:36:28,402 INFO L158 Benchmark]: Toolchain (without parser) took 15204.74ms. Allocated memory was 202.4MB in the beginning and 244.3MB in the end (delta: 41.9MB). Free memory was 152.0MB in the beginning and 186.6MB in the end (delta: -34.6MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. [2022-04-07 20:36:28,402 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory is still 168.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 20:36:28,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.41ms. Allocated memory is still 202.4MB. Free memory was 151.8MB in the beginning and 178.5MB in the end (delta: -26.6MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2022-04-07 20:36:28,403 INFO L158 Benchmark]: Boogie Preprocessor took 20.05ms. Allocated memory is still 202.4MB. Free memory was 178.5MB in the beginning and 176.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 20:36:28,403 INFO L158 Benchmark]: RCFGBuilder took 228.99ms. Allocated memory is still 202.4MB. Free memory was 176.9MB in the beginning and 165.9MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 20:36:28,403 INFO L158 Benchmark]: IcfgTransformer took 22.94ms. Allocated memory is still 202.4MB. Free memory was 165.9MB in the beginning and 164.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 20:36:28,403 INFO L158 Benchmark]: TraceAbstraction took 14744.51ms. Allocated memory was 202.4MB in the beginning and 244.3MB in the end (delta: 41.9MB). Free memory was 163.8MB in the beginning and 186.6MB in the end (delta: -22.9MB). Peak memory consumption was 19.6MB. Max. memory is 8.0GB. [2022-04-07 20:36:28,404 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.09ms. Allocated memory is still 202.4MB. Free memory is still 168.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 184.41ms. Allocated memory is still 202.4MB. Free memory was 151.8MB in the beginning and 178.5MB in the end (delta: -26.6MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.05ms. Allocated memory is still 202.4MB. Free memory was 178.5MB in the beginning and 176.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 228.99ms. Allocated memory is still 202.4MB. Free memory was 176.9MB in the beginning and 165.9MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 22.94ms. Allocated memory is still 202.4MB. Free memory was 165.9MB in the beginning and 164.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 14744.51ms. Allocated memory was 202.4MB in the beginning and 244.3MB in the end (delta: 41.9MB). Free memory was 163.8MB in the beginning and 186.6MB in the end (delta: -22.9MB). Peak memory consumption was 19.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=24, counter=0] [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L29] RET assume_abort_if_not(x1 >= 0) VAL [\old(counter)=0, counter=0, x1=21, x2=1] [L30] CALL assume_abort_if_not(x2 != 0) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L30] RET assume_abort_if_not(x2 != 0) VAL [\old(counter)=0, counter=0, x1=21, x2=1] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [\old(counter)=0, counter=0, x1=21, x2=1, y1=0, y2=0, y3=21] [L36] EXPR counter++ VAL [\old(counter)=0, counter=1, counter++=0, x1=21, x2=1, y1=0, y2=0, y3=21] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=1, x1=21, x2=1, y1=0, y2=0, y3=21] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=1, x1=21, x2=1, y1=0, y2=0, y3=21] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=1, x1=21, x2=1, y1=1, y2=0, y3=20] [L36] EXPR counter++ VAL [\old(counter)=0, counter=2, counter++=1, x1=21, x2=1, y1=1, y2=0, y3=20] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=2, x1=21, x2=1, y1=1, y2=0, y3=20] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=2, x1=21, x2=1, y1=1, y2=0, y3=20] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=2, x1=21, x2=1, y1=2, y2=0, y3=19] [L36] EXPR counter++ VAL [\old(counter)=0, counter=3, counter++=2, x1=21, x2=1, y1=2, y2=0, y3=19] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=3, x1=21, x2=1, y1=2, y2=0, y3=19] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=3, x1=21, x2=1, y1=2, y2=0, y3=19] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=3, x1=21, x2=1, y1=3, y2=0, y3=18] [L36] EXPR counter++ VAL [\old(counter)=0, counter=4, counter++=3, x1=21, x2=1, y1=3, y2=0, y3=18] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=4, x1=21, x2=1, y1=3, y2=0, y3=18] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=4, x1=21, x2=1, y1=3, y2=0, y3=18] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=4, x1=21, x2=1, y1=4, y2=0, y3=17] [L36] EXPR counter++ VAL [\old(counter)=0, counter=5, counter++=4, x1=21, x2=1, y1=4, y2=0, y3=17] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=5, x1=21, x2=1, y1=4, y2=0, y3=17] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=5, x1=21, x2=1, y1=4, y2=0, y3=17] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=5, x1=21, x2=1, y1=5, y2=0, y3=16] [L36] EXPR counter++ VAL [\old(counter)=0, counter=6, counter++=5, x1=21, x2=1, y1=5, y2=0, y3=16] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=6, x1=21, x2=1, y1=5, y2=0, y3=16] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=6, x1=21, x2=1, y1=5, y2=0, y3=16] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=6, x1=21, x2=1, y1=6, y2=0, y3=15] [L36] EXPR counter++ VAL [\old(counter)=0, counter=7, counter++=6, x1=21, x2=1, y1=6, y2=0, y3=15] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=7, x1=21, x2=1, y1=6, y2=0, y3=15] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=7, x1=21, x2=1, y1=6, y2=0, y3=15] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=7, x1=21, x2=1, y1=7, y2=0, y3=14] [L36] EXPR counter++ VAL [\old(counter)=0, counter=8, counter++=7, x1=21, x2=1, y1=7, y2=0, y3=14] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=8, x1=21, x2=1, y1=7, y2=0, y3=14] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=8, x1=21, x2=1, y1=7, y2=0, y3=14] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=8, x1=21, x2=1, y1=8, y2=0, y3=13] [L36] EXPR counter++ VAL [\old(counter)=0, counter=9, counter++=8, x1=21, x2=1, y1=8, y2=0, y3=13] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=9, x1=21, x2=1, y1=8, y2=0, y3=13] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=9, x1=21, x2=1, y1=8, y2=0, y3=13] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=9, x1=21, x2=1, y1=9, y2=0, y3=12] [L36] EXPR counter++ VAL [\old(counter)=0, counter=10, counter++=9, x1=21, x2=1, y1=9, y2=0, y3=12] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=10, x1=21, x2=1, y1=9, y2=0, y3=12] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=10, x1=21, x2=1, y1=9, y2=0, y3=12] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=10, x1=21, x2=1, y1=10, y2=0, y3=11] [L36] EXPR counter++ VAL [\old(counter)=0, counter=11, counter++=10, x1=21, x2=1, y1=10, y2=0, y3=11] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=11, x1=21, x2=1, y1=10, y2=0, y3=11] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=11, x1=21, x2=1, y1=10, y2=0, y3=11] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=11, x1=21, x2=1, y1=11, y2=0, y3=10] [L36] EXPR counter++ VAL [\old(counter)=0, counter=12, counter++=11, x1=21, x2=1, y1=11, y2=0, y3=10] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=12, x1=21, x2=1, y1=11, y2=0, y3=10] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=12, x1=21, x2=1, y1=11, y2=0, y3=10] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=12, x1=21, x2=1, y1=12, y2=0, y3=9] [L36] EXPR counter++ VAL [\old(counter)=0, counter=13, counter++=12, x1=21, x2=1, y1=12, y2=0, y3=9] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=13, x1=21, x2=1, y1=12, y2=0, y3=9] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=13, x1=21, x2=1, y1=12, y2=0, y3=9] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=13, x1=21, x2=1, y1=13, y2=0, y3=8] [L36] EXPR counter++ VAL [\old(counter)=0, counter=14, counter++=13, x1=21, x2=1, y1=13, y2=0, y3=8] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=14, x1=21, x2=1, y1=13, y2=0, y3=8] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=14, x1=21, x2=1, y1=13, y2=0, y3=8] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=14, x1=21, x2=1, y1=14, y2=0, y3=7] [L36] EXPR counter++ VAL [\old(counter)=0, counter=15, counter++=14, x1=21, x2=1, y1=14, y2=0, y3=7] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=15, x1=21, x2=1, y1=14, y2=0, y3=7] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=15, x1=21, x2=1, y1=14, y2=0, y3=7] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=15, x1=21, x2=1, y1=15, y2=0, y3=6] [L36] EXPR counter++ VAL [\old(counter)=0, counter=16, counter++=15, x1=21, x2=1, y1=15, y2=0, y3=6] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=16, x1=21, x2=1, y1=15, y2=0, y3=6] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=16, x1=21, x2=1, y1=15, y2=0, y3=6] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=16, x1=21, x2=1, y1=16, y2=0, y3=5] [L36] EXPR counter++ VAL [\old(counter)=0, counter=17, counter++=16, x1=21, x2=1, y1=16, y2=0, y3=5] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=17, x1=21, x2=1, y1=16, y2=0, y3=5] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=17, x1=21, x2=1, y1=16, y2=0, y3=5] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=17, x1=21, x2=1, y1=17, y2=0, y3=4] [L36] EXPR counter++ VAL [\old(counter)=0, counter=18, counter++=17, x1=21, x2=1, y1=17, y2=0, y3=4] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=18, x1=21, x2=1, y1=17, y2=0, y3=4] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=18, x1=21, x2=1, y1=17, y2=0, y3=4] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=18, x1=21, x2=1, y1=18, y2=0, y3=3] [L36] EXPR counter++ VAL [\old(counter)=0, counter=19, counter++=18, x1=21, x2=1, y1=18, y2=0, y3=3] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=19, x1=21, x2=1, y1=18, y2=0, y3=3] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=19, x1=21, x2=1, y1=18, y2=0, y3=3] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=19, x1=21, x2=1, y1=19, y2=0, y3=2] [L36] EXPR counter++ VAL [\old(counter)=0, counter=20, counter++=19, x1=21, x2=1, y1=19, y2=0, y3=2] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=20, x1=21, x2=1, y1=19, y2=0, y3=2] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=20, x1=21, x2=1, y1=19, y2=0, y3=2] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=20, x1=21, x2=1, y1=20, y2=0, y3=1] [L36] EXPR counter++ VAL [\old(counter)=0, counter=21, counter++=20, x1=21, x2=1, y1=20, y2=0, y3=1] [L36] COND FALSE !(counter++<20) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, \old(counter)=0, counter=21] [L16] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L18] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 420 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 416 mSDsluCounter, 819 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 611 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 353 IncrementalHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 208 mSDtfsCounter, 353 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 552 GetRequests, 457 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=7, InterpolantAutomatonStates: 97, 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, 7 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 523 ConstructedInterpolants, 0 QuantifiedInterpolants, 1255 SizeOfPredicates, 29 NumberOfNonLiveVariables, 914 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 310/1086 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-07 20:36:28,426 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...