/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/egcd-ll_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 19:05:38,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 19:05:38,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 19:05:38,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 19:05:38,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 19:05:38,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 19:05:38,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 19:05:38,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 19:05:38,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 19:05:38,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 19:05:38,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 19:05:38,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 19:05:38,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 19:05:38,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 19:05:38,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 19:05:38,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 19:05:38,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 19:05:38,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 19:05:38,370 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 19:05:38,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 19:05:38,372 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 19:05:38,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 19:05:38,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 19:05:38,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 19:05:38,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 19:05:38,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 19:05:38,382 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 19:05:38,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 19:05:38,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 19:05:38,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 19:05:38,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 19:05:38,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 19:05:38,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 19:05:38,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 19:05:38,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 19:05:38,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 19:05:38,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 19:05:38,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 19:05:38,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 19:05:38,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 19:05:38,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 19:05:38,392 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 19:05:38,392 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 19:05:38,404 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 19:05:38,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 19:05:38,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 19:05:38,406 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 19:05:38,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 19:05:38,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 19:05:38,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 19:05:38,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 19:05:38,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 19:05:38,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 19:05:38,407 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 19:05:38,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 19:05:38,407 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 19:05:38,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 19:05:38,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 19:05:38,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 19:05:38,408 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 19:05:38,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 19:05:38,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:05:38,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 19:05:38,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 19:05:38,410 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 19:05:38,410 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 19:05:38,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 19:05:38,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 19:05:38,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 19:05:38,625 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 19:05:38,626 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 19:05:38,627 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound20.c [2022-04-07 19:05:38,688 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0038aa1/3b6178368b564fb3898e09f9707da3f0/FLAG56da33ef3 [2022-04-07 19:05:39,035 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 19:05:39,036 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound20.c [2022-04-07 19:05:39,040 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0038aa1/3b6178368b564fb3898e09f9707da3f0/FLAG56da33ef3 [2022-04-07 19:05:39,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0038aa1/3b6178368b564fb3898e09f9707da3f0 [2022-04-07 19:05:39,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 19:05:39,475 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 19:05:39,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 19:05:39,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 19:05:39,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 19:05:39,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:05:39" (1/1) ... [2022-04-07 19:05:39,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52de9bf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:05:39, skipping insertion in model container [2022-04-07 19:05:39,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:05:39" (1/1) ... [2022-04-07 19:05:39,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 19:05:39,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 19:05:39,670 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/egcd-ll_valuebound20.c[489,502] [2022-04-07 19:05:39,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:05:39,696 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 19:05:39,721 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/egcd-ll_valuebound20.c[489,502] [2022-04-07 19:05:39,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:05:39,739 INFO L208 MainTranslator]: Completed translation [2022-04-07 19:05:39,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:05:39 WrapperNode [2022-04-07 19:05:39,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 19:05:39,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 19:05:39,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 19:05:39,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 19:05:39,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:05:39" (1/1) ... [2022-04-07 19:05:39,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:05:39" (1/1) ... [2022-04-07 19:05:39,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:05:39" (1/1) ... [2022-04-07 19:05:39,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:05:39" (1/1) ... [2022-04-07 19:05:39,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:05:39" (1/1) ... [2022-04-07 19:05:39,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:05:39" (1/1) ... [2022-04-07 19:05:39,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:05:39" (1/1) ... [2022-04-07 19:05:39,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 19:05:39,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 19:05:39,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 19:05:39,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 19:05:39,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:05:39" (1/1) ... [2022-04-07 19:05:39,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:05:39,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:05:39,786 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 19:05:39,799 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 19:05:39,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 19:05:39,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 19:05:39,818 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 19:05:39,818 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 19:05:39,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 19:05:39,819 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 19:05:39,819 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 19:05:39,819 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 19:05:39,819 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 19:05:39,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 19:05:39,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 19:05:39,819 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 19:05:39,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 19:05:39,819 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 19:05:39,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 19:05:39,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 19:05:39,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 19:05:39,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 19:05:39,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 19:05:39,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 19:05:39,862 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 19:05:39,863 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 19:05:40,067 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 19:05:40,073 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 19:05:40,073 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 19:05:40,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:05:40 BoogieIcfgContainer [2022-04-07 19:05:40,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 19:05:40,080 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 19:05:40,080 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 19:05:40,081 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 19:05:40,088 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:05:40" (1/1) ... [2022-04-07 19:05:40,089 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 19:05:40,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:05:40 BasicIcfg [2022-04-07 19:05:40,114 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 19:05:40,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 19:05:40,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 19:05:40,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 19:05:40,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 07:05:39" (1/4) ... [2022-04-07 19:05:40,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@139b3a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:05:40, skipping insertion in model container [2022-04-07 19:05:40,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:05:39" (2/4) ... [2022-04-07 19:05:40,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@139b3a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:05:40, skipping insertion in model container [2022-04-07 19:05:40,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:05:40" (3/4) ... [2022-04-07 19:05:40,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@139b3a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:05:40, skipping insertion in model container [2022-04-07 19:05:40,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:05:40" (4/4) ... [2022-04-07 19:05:40,119 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound20.cJordan [2022-04-07 19:05:40,122 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 19:05:40,123 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 19:05:40,152 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 19:05:40,156 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 19:05:40,156 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 19:05:40,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 19:05:40,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 19:05:40,172 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:05:40,172 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:05:40,172 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:05:40,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:05:40,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1381881312, now seen corresponding path program 1 times [2022-04-07 19:05:40,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:05:40,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909437990] [2022-04-07 19:05:40,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:05:40,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:05:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:05:40,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 19:05:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:05:40,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {40#true} is VALID [2022-04-07 19:05:40,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-07 19:05:40,323 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-07 19:05:40,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 19:05:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:05:40,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: 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] {40#true} is VALID [2022-04-07 19:05:40,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:05:40,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:05:40,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-07 19:05:40,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 19:05:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:05:40,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: 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] {40#true} is VALID [2022-04-07 19:05:40,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:05:40,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:05:40,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-07 19:05:40,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 19:05:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:05:40,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: 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] {40#true} is VALID [2022-04-07 19:05:40,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:05:40,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:05:40,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-07 19:05:40,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-07 19:05:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:05:40,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: 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] {40#true} is VALID [2022-04-07 19:05:40,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:05:40,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:05:40,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-07 19:05:40,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 19:05:40,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {40#true} is VALID [2022-04-07 19:05:40,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-07 19:05:40,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-07 19:05:40,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-07 19:05:40,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {40#true} is VALID [2022-04-07 19:05:40,349 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-07 19:05:40,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: 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] {40#true} is VALID [2022-04-07 19:05:40,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:05:40,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:05:40,351 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-07 19:05:40,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {41#false} is VALID [2022-04-07 19:05:40,352 INFO L272 TraceCheckUtils]: 12: Hoare triple {41#false} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-07 19:05:40,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: 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] {40#true} is VALID [2022-04-07 19:05:40,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:05:40,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:05:40,353 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {41#false} {41#false} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-07 19:05:40,353 INFO L272 TraceCheckUtils]: 17: Hoare triple {41#false} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-07 19:05:40,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: 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] {40#true} is VALID [2022-04-07 19:05:40,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:05:40,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:05:40,354 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41#false} {41#false} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-07 19:05:40,355 INFO L272 TraceCheckUtils]: 22: Hoare triple {41#false} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-07 19:05:40,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {40#true} [99] assume_abort_if_notENTRY-->L8: 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] {40#true} is VALID [2022-04-07 19:05:40,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {40#true} [101] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:05:40,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {41#false} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:05:40,357 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41#false} {41#false} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-07 19:05:40,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {41#false} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {41#false} is VALID [2022-04-07 19:05:40,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {41#false} [107] L43-2-->L35-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:05:40,357 INFO L272 TraceCheckUtils]: 29: Hoare triple {41#false} [110] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {41#false} is VALID [2022-04-07 19:05:40,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {41#false} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {41#false} is VALID [2022-04-07 19:05:40,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {41#false} [116] L11-->L12: Formula: (= 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[] {41#false} is VALID [2022-04-07 19:05:40,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {41#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-07 19:05:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 19:05:40,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:05:40,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909437990] [2022-04-07 19:05:40,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909437990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:05:40,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:05:40,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 19:05:40,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923420296] [2022-04-07 19:05:40,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:05:40,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-07 19:05:40,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:05:40,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:05:40,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:05:40,389 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 19:05:40,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:05:40,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 19:05:40,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 19:05:40,405 INFO L87 Difference]: Start difference. First operand has 37 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:05:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:05:40,551 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-07 19:05:40,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 19:05:40,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-07 19:05:40,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:05:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:05:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-07 19:05:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:05:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-07 19:05:40,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2022-04-07 19:05:40,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:05:40,635 INFO L225 Difference]: With dead ends: 37 [2022-04-07 19:05:40,635 INFO L226 Difference]: Without dead ends: 32 [2022-04-07 19:05:40,638 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 19:05:40,641 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:05:40,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:05:40,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-07 19:05:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-07 19:05:40,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:05:40,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 19:05:40,667 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 19:05:40,668 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 19:05:40,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:05:40,676 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 19:05:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 19:05:40,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:05:40,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:05:40,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-07 19:05:40,679 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-07 19:05:40,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:05:40,686 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 19:05:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 19:05:40,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:05:40,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:05:40,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:05:40,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:05:40,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 19:05:40,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-07 19:05:40,696 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 33 [2022-04-07 19:05:40,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:05:40,696 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-07 19:05:40,697 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:05:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 19:05:40,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 19:05:40,698 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:05:40,698 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:05:40,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 19:05:40,699 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:05:40,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:05:40,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1975235811, now seen corresponding path program 1 times [2022-04-07 19:05:40,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:05:40,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839287911] [2022-04-07 19:05:40,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:05:40,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:05:40,718 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:05:40,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [853231127] [2022-04-07 19:05:40,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:05:40,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:05:40,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:05:40,720 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 19:05:40,721 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 19:05:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:05:40,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 19:05:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:05:40,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:05:40,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {197#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-07 19:05:40,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {197#true} is VALID [2022-04-07 19:05:40,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {197#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-07 19:05:40,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {197#true} {197#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-07 19:05:40,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {197#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-07 19:05:40,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {197#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {197#true} is VALID [2022-04-07 19:05:40,907 INFO L272 TraceCheckUtils]: 6: Hoare triple {197#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {197#true} is VALID [2022-04-07 19:05:40,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {197#true} [99] assume_abort_if_notENTRY-->L8: 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] {197#true} is VALID [2022-04-07 19:05:40,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {197#true} [102] L8-->L8-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[] {197#true} is VALID [2022-04-07 19:05:40,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-07 19:05:40,908 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {197#true} {197#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {197#true} is VALID [2022-04-07 19:05:40,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {197#true} is VALID [2022-04-07 19:05:40,908 INFO L272 TraceCheckUtils]: 12: Hoare triple {197#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {197#true} is VALID [2022-04-07 19:05:40,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {197#true} [99] assume_abort_if_notENTRY-->L8: 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] {197#true} is VALID [2022-04-07 19:05:40,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {197#true} [102] L8-->L8-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[] {197#true} is VALID [2022-04-07 19:05:40,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {197#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-07 19:05:40,909 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {197#true} {197#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {197#true} is VALID [2022-04-07 19:05:40,909 INFO L272 TraceCheckUtils]: 17: Hoare triple {197#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {197#true} is VALID [2022-04-07 19:05:40,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {197#true} [99] assume_abort_if_notENTRY-->L8: 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] {197#true} is VALID [2022-04-07 19:05:40,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {197#true} [102] L8-->L8-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[] {197#true} is VALID [2022-04-07 19:05:40,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {197#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-07 19:05:40,910 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {197#true} {197#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {197#true} is VALID [2022-04-07 19:05:40,910 INFO L272 TraceCheckUtils]: 22: Hoare triple {197#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {197#true} is VALID [2022-04-07 19:05:40,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {197#true} [99] assume_abort_if_notENTRY-->L8: 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] {197#true} is VALID [2022-04-07 19:05:40,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {197#true} [102] L8-->L8-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[] {197#true} is VALID [2022-04-07 19:05:40,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {197#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-07 19:05:40,911 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {197#true} {197#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {197#true} is VALID [2022-04-07 19:05:40,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {197#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {283#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-07 19:05:40,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {283#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {283#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-07 19:05:40,912 INFO L272 TraceCheckUtils]: 29: Hoare triple {283#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {290#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:05:40,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {290#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {294#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:05:40,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {294#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= 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[] {198#false} is VALID [2022-04-07 19:05:40,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {198#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#false} is VALID [2022-04-07 19:05:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 19:05:40,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:05:40,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:05:40,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839287911] [2022-04-07 19:05:40,917 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:05:40,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853231127] [2022-04-07 19:05:40,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853231127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:05:40,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:05:40,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:05:40,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013834936] [2022-04-07 19:05:40,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:05:40,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-07 19:05:40,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:05:40,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:05:40,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:05:40,952 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:05:40,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:05:40,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:05:40,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:05:40,953 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:05:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:05:41,110 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-04-07 19:05:41,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:05:41,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-07 19:05:41,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:05:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:05:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 19:05:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:05:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 19:05:41,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-07 19:05:41,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:05:41,162 INFO L225 Difference]: With dead ends: 46 [2022-04-07 19:05:41,162 INFO L226 Difference]: Without dead ends: 46 [2022-04-07 19:05:41,163 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:05:41,163 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:05:41,164 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 143 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:05:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-07 19:05:41,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-07 19:05:41,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:05:41,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 19:05:41,168 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 19:05:41,168 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 19:05:41,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:05:41,171 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-04-07 19:05:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-07 19:05:41,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:05:41,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:05:41,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 46 states. [2022-04-07 19:05:41,172 INFO L87 Difference]: Start difference. First operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 46 states. [2022-04-07 19:05:41,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:05:41,175 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-04-07 19:05:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-07 19:05:41,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:05:41,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:05:41,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:05:41,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:05:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 19:05:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-04-07 19:05:41,178 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 33 [2022-04-07 19:05:41,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:05:41,178 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-04-07 19:05:41,178 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:05:41,178 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-07 19:05:41,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-07 19:05:41,179 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:05:41,179 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:05:41,196 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 19:05:41,395 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 19:05:41,396 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:05:41,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:05:41,396 INFO L85 PathProgramCache]: Analyzing trace with hash -759782395, now seen corresponding path program 1 times [2022-04-07 19:05:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:05:41,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752703031] [2022-04-07 19:05:41,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:05:41,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:05:41,413 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:05:41,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [555959295] [2022-04-07 19:05:41,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:05:41,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:05:41,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:05:41,414 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 19:05:41,415 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 19:05:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:05:41,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 19:05:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:05:41,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:05:41,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {485#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-07 19:05:41,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {485#true} is VALID [2022-04-07 19:05:41,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-07 19:05:41,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {485#true} {485#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-07 19:05:41,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {485#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-07 19:05:41,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {485#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {485#true} is VALID [2022-04-07 19:05:41,571 INFO L272 TraceCheckUtils]: 6: Hoare triple {485#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {485#true} is VALID [2022-04-07 19:05:41,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {485#true} [99] assume_abort_if_notENTRY-->L8: 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] {485#true} is VALID [2022-04-07 19:05:41,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {485#true} [102] L8-->L8-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[] {485#true} is VALID [2022-04-07 19:05:41,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {485#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-07 19:05:41,572 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {485#true} {485#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {485#true} is VALID [2022-04-07 19:05:41,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {485#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {485#true} is VALID [2022-04-07 19:05:41,572 INFO L272 TraceCheckUtils]: 12: Hoare triple {485#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {485#true} is VALID [2022-04-07 19:05:41,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {485#true} [99] assume_abort_if_notENTRY-->L8: 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] {485#true} is VALID [2022-04-07 19:05:41,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {485#true} [102] L8-->L8-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[] {485#true} is VALID [2022-04-07 19:05:41,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {485#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-07 19:05:41,595 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {485#true} {485#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {485#true} is VALID [2022-04-07 19:05:41,595 INFO L272 TraceCheckUtils]: 17: Hoare triple {485#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {485#true} is VALID [2022-04-07 19:05:41,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {485#true} [99] assume_abort_if_notENTRY-->L8: 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] {485#true} is VALID [2022-04-07 19:05:41,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {485#true} [102] L8-->L8-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[] {485#true} is VALID [2022-04-07 19:05:41,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {485#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-07 19:05:41,596 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {485#true} {485#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {485#true} is VALID [2022-04-07 19:05:41,596 INFO L272 TraceCheckUtils]: 22: Hoare triple {485#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {485#true} is VALID [2022-04-07 19:05:41,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {485#true} [99] assume_abort_if_notENTRY-->L8: 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] {485#true} is VALID [2022-04-07 19:05:41,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {485#true} [102] L8-->L8-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[] {485#true} is VALID [2022-04-07 19:05:41,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {485#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-07 19:05:41,597 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {485#true} {485#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {485#true} is VALID [2022-04-07 19:05:41,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {485#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {571#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:05:41,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {571#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {571#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:05:41,598 INFO L272 TraceCheckUtils]: 29: Hoare triple {571#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {485#true} is VALID [2022-04-07 19:05:41,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {485#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {485#true} is VALID [2022-04-07 19:05:41,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {485#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-07 19:05:41,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {485#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#true} is VALID [2022-04-07 19:05:41,599 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {485#true} {571#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {571#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:05:41,600 INFO L272 TraceCheckUtils]: 34: Hoare triple {571#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {593#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:05:41,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {593#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {597#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:05:41,600 INFO L290 TraceCheckUtils]: 36: Hoare triple {597#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= 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[] {486#false} is VALID [2022-04-07 19:05:41,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {486#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {486#false} is VALID [2022-04-07 19:05:41,601 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 19:05:41,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:05:41,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:05:41,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752703031] [2022-04-07 19:05:41,601 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:05:41,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555959295] [2022-04-07 19:05:41,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555959295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:05:41,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:05:41,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:05:41,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502951161] [2022-04-07 19:05:41,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:05:41,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-07 19:05:41,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:05:41,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:05:41,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:05:41,621 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:05:41,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:05:41,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:05:41,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:05:41,622 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:05:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:05:41,774 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-07 19:05:41,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:05:41,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-07 19:05:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:05:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:05:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 19:05:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:05:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 19:05:41,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-07 19:05:41,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:05:41,828 INFO L225 Difference]: With dead ends: 50 [2022-04-07 19:05:41,828 INFO L226 Difference]: Without dead ends: 50 [2022-04-07 19:05:41,828 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:05:41,829 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:05:41,829 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 140 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:05:41,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-07 19:05:41,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-07 19:05:41,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:05:41,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 19:05:41,833 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 19:05:41,834 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 19:05:41,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:05:41,836 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-07 19:05:41,836 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-07 19:05:41,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:05:41,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:05:41,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-07 19:05:41,837 INFO L87 Difference]: Start difference. First operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-07 19:05:41,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:05:41,839 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-07 19:05:41,839 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-07 19:05:41,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:05:41,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:05:41,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:05:41,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:05:41,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 19:05:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2022-04-07 19:05:41,842 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 38 [2022-04-07 19:05:41,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:05:41,842 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2022-04-07 19:05:41,842 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:05:41,842 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-07 19:05:41,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-07 19:05:41,843 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:05:41,843 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:05:41,862 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 19:05:42,059 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 19:05:42,060 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:05:42,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:05:42,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1840397536, now seen corresponding path program 1 times [2022-04-07 19:05:42,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:05:42,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407575868] [2022-04-07 19:05:42,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:05:42,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:05:42,082 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:05:42,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1928086637] [2022-04-07 19:05:42,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:05:42,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:05:42,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:05:42,083 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 19:05:42,095 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 19:05:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:05:42,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 19:05:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:05:42,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:05:42,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {804#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {804#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {804#true} is VALID [2022-04-07 19:05:42,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {804#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {804#true} {804#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {804#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {804#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {804#true} is VALID [2022-04-07 19:05:42,396 INFO L272 TraceCheckUtils]: 6: Hoare triple {804#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {804#true} is VALID [2022-04-07 19:05:42,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {804#true} [99] assume_abort_if_notENTRY-->L8: 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] {830#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:05:42,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {830#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-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[] {834#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:05:42,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {834#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {834#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:05:42,397 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {834#(not (= |assume_abort_if_not_#in~cond| 0))} {804#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {841#(and (<= main_~x~0 20) (<= 0 main_~x~0))} is VALID [2022-04-07 19:05:42,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {841#(and (<= main_~x~0 20) (<= 0 main_~x~0))} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {841#(and (<= main_~x~0 20) (<= 0 main_~x~0))} is VALID [2022-04-07 19:05:42,398 INFO L272 TraceCheckUtils]: 12: Hoare triple {841#(and (<= main_~x~0 20) (<= 0 main_~x~0))} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {804#true} is VALID [2022-04-07 19:05:42,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {804#true} [99] assume_abort_if_notENTRY-->L8: 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] {804#true} is VALID [2022-04-07 19:05:42,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {804#true} [102] L8-->L8-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[] {804#true} is VALID [2022-04-07 19:05:42,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {804#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,399 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {804#true} {841#(and (<= main_~x~0 20) (<= 0 main_~x~0))} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {841#(and (<= main_~x~0 20) (<= 0 main_~x~0))} is VALID [2022-04-07 19:05:42,399 INFO L272 TraceCheckUtils]: 17: Hoare triple {841#(and (<= main_~x~0 20) (<= 0 main_~x~0))} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {804#true} is VALID [2022-04-07 19:05:42,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {804#true} [99] assume_abort_if_notENTRY-->L8: 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] {830#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:05:42,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {830#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [102] L8-->L8-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[] {834#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:05:42,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {834#(not (= |assume_abort_if_not_#in~cond| 0))} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {834#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:05:42,400 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {834#(not (= |assume_abort_if_not_#in~cond| 0))} {841#(and (<= main_~x~0 20) (<= 0 main_~x~0))} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {875#(and (<= main_~x~0 20) (<= 1 main_~x~0))} is VALID [2022-04-07 19:05:42,400 INFO L272 TraceCheckUtils]: 22: Hoare triple {875#(and (<= main_~x~0 20) (<= 1 main_~x~0))} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {804#true} is VALID [2022-04-07 19:05:42,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {804#true} [99] assume_abort_if_notENTRY-->L8: 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] {804#true} is VALID [2022-04-07 19:05:42,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {804#true} [102] L8-->L8-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[] {804#true} is VALID [2022-04-07 19:05:42,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {804#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,401 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {804#true} {875#(and (<= main_~x~0 20) (<= 1 main_~x~0))} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {875#(and (<= main_~x~0 20) (<= 1 main_~x~0))} is VALID [2022-04-07 19:05:42,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {875#(and (<= main_~x~0 20) (<= 1 main_~x~0))} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {894#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:05:42,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {894#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {894#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:05:42,402 INFO L272 TraceCheckUtils]: 29: Hoare triple {894#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {804#true} is VALID [2022-04-07 19:05:42,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {804#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {804#true} is VALID [2022-04-07 19:05:42,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {804#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {804#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,403 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {804#true} {894#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {894#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:05:42,403 INFO L272 TraceCheckUtils]: 34: Hoare triple {894#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {804#true} is VALID [2022-04-07 19:05:42,403 INFO L290 TraceCheckUtils]: 35: Hoare triple {804#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {804#true} is VALID [2022-04-07 19:05:42,403 INFO L290 TraceCheckUtils]: 36: Hoare triple {804#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,403 INFO L290 TraceCheckUtils]: 37: Hoare triple {804#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,404 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {804#true} {894#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {894#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:05:42,405 INFO L272 TraceCheckUtils]: 39: Hoare triple {894#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {931#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:05:42,405 INFO L290 TraceCheckUtils]: 40: Hoare triple {931#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {935#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:05:42,405 INFO L290 TraceCheckUtils]: 41: Hoare triple {935#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= 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[] {805#false} is VALID [2022-04-07 19:05:42,406 INFO L290 TraceCheckUtils]: 42: Hoare triple {805#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {805#false} is VALID [2022-04-07 19:05:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-07 19:05:42,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:05:42,616 INFO L290 TraceCheckUtils]: 42: Hoare triple {805#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {805#false} is VALID [2022-04-07 19:05:42,617 INFO L290 TraceCheckUtils]: 41: Hoare triple {935#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= 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[] {805#false} is VALID [2022-04-07 19:05:42,617 INFO L290 TraceCheckUtils]: 40: Hoare triple {931#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {935#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:05:42,618 INFO L272 TraceCheckUtils]: 39: Hoare triple {951#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {931#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:05:42,619 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {804#true} {951#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {951#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:05:42,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {804#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,619 INFO L290 TraceCheckUtils]: 36: Hoare triple {804#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {804#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {804#true} is VALID [2022-04-07 19:05:42,619 INFO L272 TraceCheckUtils]: 34: Hoare triple {951#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {804#true} is VALID [2022-04-07 19:05:42,620 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {804#true} {951#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {951#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:05:42,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {804#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {804#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {804#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {804#true} is VALID [2022-04-07 19:05:42,620 INFO L272 TraceCheckUtils]: 29: Hoare triple {951#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {804#true} is VALID [2022-04-07 19:05:42,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {951#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {951#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:05:42,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {804#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {951#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:05:42,621 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {804#true} {804#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {804#true} is VALID [2022-04-07 19:05:42,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {804#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {804#true} [102] L8-->L8-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[] {804#true} is VALID [2022-04-07 19:05:42,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {804#true} [99] assume_abort_if_notENTRY-->L8: 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] {804#true} is VALID [2022-04-07 19:05:42,621 INFO L272 TraceCheckUtils]: 22: Hoare triple {804#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {804#true} is VALID [2022-04-07 19:05:42,621 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {804#true} {804#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {804#true} is VALID [2022-04-07 19:05:42,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {804#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {804#true} [102] L8-->L8-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[] {804#true} is VALID [2022-04-07 19:05:42,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {804#true} [99] assume_abort_if_notENTRY-->L8: 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] {804#true} is VALID [2022-04-07 19:05:42,622 INFO L272 TraceCheckUtils]: 17: Hoare triple {804#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {804#true} is VALID [2022-04-07 19:05:42,622 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {804#true} {804#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {804#true} is VALID [2022-04-07 19:05:42,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {804#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {804#true} [102] L8-->L8-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[] {804#true} is VALID [2022-04-07 19:05:42,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {804#true} [99] assume_abort_if_notENTRY-->L8: 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] {804#true} is VALID [2022-04-07 19:05:42,622 INFO L272 TraceCheckUtils]: 12: Hoare triple {804#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {804#true} is VALID [2022-04-07 19:05:42,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {804#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {804#true} is VALID [2022-04-07 19:05:42,622 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {804#true} {804#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {804#true} is VALID [2022-04-07 19:05:42,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {804#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {804#true} [102] L8-->L8-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[] {804#true} is VALID [2022-04-07 19:05:42,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {804#true} [99] assume_abort_if_notENTRY-->L8: 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] {804#true} is VALID [2022-04-07 19:05:42,623 INFO L272 TraceCheckUtils]: 6: Hoare triple {804#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {804#true} is VALID [2022-04-07 19:05:42,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {804#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {804#true} is VALID [2022-04-07 19:05:42,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {804#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {804#true} {804#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {804#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {804#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {804#true} is VALID [2022-04-07 19:05:42,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {804#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#true} is VALID [2022-04-07 19:05:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-07 19:05:42,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:05:42,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407575868] [2022-04-07 19:05:42,624 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:05:42,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928086637] [2022-04-07 19:05:42,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928086637] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 19:05:42,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 19:05:42,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-07 19:05:42,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645482569] [2022-04-07 19:05:42,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:05:42,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-07 19:05:42,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:05:42,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:05:42,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:05:42,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:05:42,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:05:42,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:05:42,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-07 19:05:42,644 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:05:42,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:05:42,822 INFO L93 Difference]: Finished difference Result 72 states and 103 transitions. [2022-04-07 19:05:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:05:42,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-07 19:05:42,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:05:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:05:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 19:05:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:05:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 19:05:42,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-07 19:05:42,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:05:42,879 INFO L225 Difference]: With dead ends: 72 [2022-04-07 19:05:42,879 INFO L226 Difference]: Without dead ends: 70 [2022-04-07 19:05:42,879 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-07 19:05:42,880 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:05:42,880 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 137 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:05:42,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-07 19:05:42,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-07 19:05:42,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:05:42,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-07 19:05:42,886 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-07 19:05:42,886 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-07 19:05:42,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:05:42,889 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-04-07 19:05:42,889 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-07 19:05:42,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:05:42,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:05:42,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 70 states. [2022-04-07 19:05:42,890 INFO L87 Difference]: Start difference. First operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 70 states. [2022-04-07 19:05:42,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:05:42,893 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-04-07 19:05:42,893 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-07 19:05:42,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:05:42,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:05:42,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:05:42,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:05:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-07 19:05:42,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2022-04-07 19:05:42,896 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 43 [2022-04-07 19:05:42,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:05:42,896 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2022-04-07 19:05:42,897 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:05:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-07 19:05:42,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-07 19:05:42,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:05:42,897 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:05:42,914 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 19:05:43,113 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 19:05:43,114 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:05:43,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:05:43,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1590647429, now seen corresponding path program 1 times [2022-04-07 19:05:43,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:05:43,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127782815] [2022-04-07 19:05:43,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:05:43,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:05:43,128 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:05:43,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [153747945] [2022-04-07 19:05:43,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:05:43,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:05:43,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:05:43,148 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 19:05:43,203 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 19:05:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:05:43,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 19:05:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:05:43,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:05:43,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {1355#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 19:05:43,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {1355#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1355#true} is VALID [2022-04-07 19:05:43,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {1355#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 19:05:43,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1355#true} {1355#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 19:05:43,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {1355#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 19:05:43,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {1355#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1355#true} is VALID [2022-04-07 19:05:43,372 INFO L272 TraceCheckUtils]: 6: Hoare triple {1355#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1355#true} is VALID [2022-04-07 19:05:43,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {1355#true} [99] assume_abort_if_notENTRY-->L8: 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] {1355#true} is VALID [2022-04-07 19:05:43,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {1355#true} [102] L8-->L8-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[] {1355#true} is VALID [2022-04-07 19:05:43,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {1355#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 19:05:43,372 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1355#true} {1355#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1355#true} is VALID [2022-04-07 19:05:43,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {1355#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1355#true} is VALID [2022-04-07 19:05:43,372 INFO L272 TraceCheckUtils]: 12: Hoare triple {1355#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1355#true} is VALID [2022-04-07 19:05:43,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {1355#true} [99] assume_abort_if_notENTRY-->L8: 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] {1355#true} is VALID [2022-04-07 19:05:43,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {1355#true} [102] L8-->L8-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[] {1355#true} is VALID [2022-04-07 19:05:43,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {1355#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 19:05:43,373 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1355#true} {1355#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1355#true} is VALID [2022-04-07 19:05:43,373 INFO L272 TraceCheckUtils]: 17: Hoare triple {1355#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1355#true} is VALID [2022-04-07 19:05:43,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {1355#true} [99] assume_abort_if_notENTRY-->L8: 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] {1355#true} is VALID [2022-04-07 19:05:43,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {1355#true} [102] L8-->L8-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[] {1355#true} is VALID [2022-04-07 19:05:43,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {1355#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 19:05:43,373 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1355#true} {1355#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1355#true} is VALID [2022-04-07 19:05:43,373 INFO L272 TraceCheckUtils]: 22: Hoare triple {1355#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1355#true} is VALID [2022-04-07 19:05:43,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {1355#true} [99] assume_abort_if_notENTRY-->L8: 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] {1355#true} is VALID [2022-04-07 19:05:43,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {1355#true} [102] L8-->L8-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[] {1355#true} is VALID [2022-04-07 19:05:43,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {1355#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 19:05:43,373 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1355#true} {1355#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1355#true} is VALID [2022-04-07 19:05:43,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {1355#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1355#true} is VALID [2022-04-07 19:05:43,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {1355#true} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 19:05:43,374 INFO L272 TraceCheckUtils]: 29: Hoare triple {1355#true} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1355#true} is VALID [2022-04-07 19:05:43,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {1355#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1355#true} is VALID [2022-04-07 19:05:43,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {1355#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 19:05:43,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {1355#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 19:05:43,374 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1355#true} {1355#true} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1355#true} is VALID [2022-04-07 19:05:43,374 INFO L272 TraceCheckUtils]: 34: Hoare triple {1355#true} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1355#true} is VALID [2022-04-07 19:05:43,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {1355#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1355#true} is VALID [2022-04-07 19:05:43,374 INFO L290 TraceCheckUtils]: 36: Hoare triple {1355#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 19:05:43,374 INFO L290 TraceCheckUtils]: 37: Hoare triple {1355#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 19:05:43,375 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1355#true} {1355#true} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1355#true} is VALID [2022-04-07 19:05:43,375 INFO L272 TraceCheckUtils]: 39: Hoare triple {1355#true} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1355#true} is VALID [2022-04-07 19:05:43,375 INFO L290 TraceCheckUtils]: 40: Hoare triple {1355#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1355#true} is VALID [2022-04-07 19:05:43,375 INFO L290 TraceCheckUtils]: 41: Hoare triple {1355#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 19:05:43,375 INFO L290 TraceCheckUtils]: 42: Hoare triple {1355#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#true} is VALID [2022-04-07 19:05:43,375 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1355#true} {1355#true} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1355#true} is VALID [2022-04-07 19:05:43,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {1355#true} [123] L38-->L35-2: Formula: (= v_main_~a~0_9 v_main_~b~0_11) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {1492#(= main_~b~0 main_~a~0)} is VALID [2022-04-07 19:05:43,376 INFO L272 TraceCheckUtils]: 45: Hoare triple {1492#(= main_~b~0 main_~a~0)} [110] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {1496#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:05:43,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {1496#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1500#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:05:43,376 INFO L290 TraceCheckUtils]: 47: Hoare triple {1500#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= 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[] {1356#false} is VALID [2022-04-07 19:05:43,377 INFO L290 TraceCheckUtils]: 48: Hoare triple {1356#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1356#false} is VALID [2022-04-07 19:05:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-07 19:05:43,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:05:43,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:05:43,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127782815] [2022-04-07 19:05:43,377 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:05:43,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153747945] [2022-04-07 19:05:43,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153747945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:05:43,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:05:43,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:05:43,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906841506] [2022-04-07 19:05:43,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:05:43,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 49 [2022-04-07 19:05:43,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:05:43,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-07 19:05:43,398 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 19:05:43,398 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:05:43,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:05:43,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:05:43,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:05:43,399 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-07 19:05:43,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:05:43,515 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2022-04-07 19:05:43,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:05:43,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 49 [2022-04-07 19:05:43,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:05:43,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-07 19:05:43,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-07 19:05:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-07 19:05:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-07 19:05:43,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-04-07 19:05:43,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:05:43,553 INFO L225 Difference]: With dead ends: 74 [2022-04-07 19:05:43,553 INFO L226 Difference]: Without dead ends: 74 [2022-04-07 19:05:43,554 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:05:43,554 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:05:43,554 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:05:43,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-07 19:05:43,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-07 19:05:43,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:05:43,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-07 19:05:43,559 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-07 19:05:43,559 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-07 19:05:43,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:05:43,561 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2022-04-07 19:05:43,561 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-07 19:05:43,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:05:43,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:05:43,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 74 states. [2022-04-07 19:05:43,562 INFO L87 Difference]: Start difference. First operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 74 states. [2022-04-07 19:05:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:05:43,564 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2022-04-07 19:05:43,564 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-07 19:05:43,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:05:43,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:05:43,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:05:43,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:05:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-07 19:05:43,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 101 transitions. [2022-04-07 19:05:43,567 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 101 transitions. Word has length 49 [2022-04-07 19:05:43,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:05:43,567 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 101 transitions. [2022-04-07 19:05:43,567 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-07 19:05:43,567 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-07 19:05:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-07 19:05:43,568 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:05:43,568 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:05:43,587 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 19:05:43,787 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 19:05:43,787 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:05:43,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:05:43,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1737902154, now seen corresponding path program 1 times [2022-04-07 19:05:43,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:05:43,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804972181] [2022-04-07 19:05:43,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:05:43,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:05:43,800 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:05:43,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1089988920] [2022-04-07 19:05:43,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:05:43,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:05:43,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:05:43,812 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 19:05:43,813 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 19:05:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:05:43,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 19:05:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:05:43,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:05:44,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {1804#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1804#true} is VALID [2022-04-07 19:05:44,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {1804#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1804#true} is VALID [2022-04-07 19:05:44,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {1804#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1804#true} is VALID [2022-04-07 19:05:44,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1804#true} {1804#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1804#true} is VALID [2022-04-07 19:05:44,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {1804#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1804#true} is VALID [2022-04-07 19:05:44,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {1804#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1804#true} is VALID [2022-04-07 19:05:44,044 INFO L272 TraceCheckUtils]: 6: Hoare triple {1804#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1804#true} is VALID [2022-04-07 19:05:44,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {1804#true} [99] assume_abort_if_notENTRY-->L8: 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] {1804#true} is VALID [2022-04-07 19:05:44,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {1804#true} [102] L8-->L8-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[] {1804#true} is VALID [2022-04-07 19:05:44,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {1804#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1804#true} is VALID [2022-04-07 19:05:44,044 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1804#true} {1804#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1804#true} is VALID [2022-04-07 19:05:44,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {1804#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {1804#true} is VALID [2022-04-07 19:05:44,044 INFO L272 TraceCheckUtils]: 12: Hoare triple {1804#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1804#true} is VALID [2022-04-07 19:05:44,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {1804#true} [99] assume_abort_if_notENTRY-->L8: 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] {1804#true} is VALID [2022-04-07 19:05:44,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {1804#true} [102] L8-->L8-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[] {1804#true} is VALID [2022-04-07 19:05:44,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {1804#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1804#true} is VALID [2022-04-07 19:05:44,044 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1804#true} {1804#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1804#true} is VALID [2022-04-07 19:05:44,044 INFO L272 TraceCheckUtils]: 17: Hoare triple {1804#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1804#true} is VALID [2022-04-07 19:05:44,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {1804#true} [99] assume_abort_if_notENTRY-->L8: 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] {1804#true} is VALID [2022-04-07 19:05:44,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {1804#true} [102] L8-->L8-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[] {1804#true} is VALID [2022-04-07 19:05:44,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {1804#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1804#true} is VALID [2022-04-07 19:05:44,045 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1804#true} {1804#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1804#true} is VALID [2022-04-07 19:05:44,045 INFO L272 TraceCheckUtils]: 22: Hoare triple {1804#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1804#true} is VALID [2022-04-07 19:05:44,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {1804#true} [99] assume_abort_if_notENTRY-->L8: 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] {1804#true} is VALID [2022-04-07 19:05:44,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {1804#true} [102] L8-->L8-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[] {1804#true} is VALID [2022-04-07 19:05:44,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {1804#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1804#true} is VALID [2022-04-07 19:05:44,045 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1804#true} {1804#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1804#true} is VALID [2022-04-07 19:05:44,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {1804#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1890#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:05:44,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {1890#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1890#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:05:44,046 INFO L272 TraceCheckUtils]: 29: Hoare triple {1890#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1804#true} is VALID [2022-04-07 19:05:44,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {1804#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1804#true} is VALID [2022-04-07 19:05:44,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {1804#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1804#true} is VALID [2022-04-07 19:05:44,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {1804#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1804#true} is VALID [2022-04-07 19:05:44,047 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1804#true} {1890#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1890#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:05:44,047 INFO L272 TraceCheckUtils]: 34: Hoare triple {1890#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1804#true} is VALID [2022-04-07 19:05:44,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {1804#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1804#true} is VALID [2022-04-07 19:05:44,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {1804#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1804#true} is VALID [2022-04-07 19:05:44,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {1804#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1804#true} is VALID [2022-04-07 19:05:44,049 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1804#true} {1890#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1890#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:05:44,049 INFO L272 TraceCheckUtils]: 39: Hoare triple {1890#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1804#true} is VALID [2022-04-07 19:05:44,049 INFO L290 TraceCheckUtils]: 40: Hoare triple {1804#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1804#true} is VALID [2022-04-07 19:05:44,049 INFO L290 TraceCheckUtils]: 41: Hoare triple {1804#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1804#true} is VALID [2022-04-07 19:05:44,049 INFO L290 TraceCheckUtils]: 42: Hoare triple {1804#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1804#true} is VALID [2022-04-07 19:05:44,049 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1804#true} {1890#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1890#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:05:44,050 INFO L290 TraceCheckUtils]: 44: Hoare triple {1890#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {1890#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:05:44,050 INFO L290 TraceCheckUtils]: 45: Hoare triple {1890#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {1890#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:05:44,051 INFO L290 TraceCheckUtils]: 46: Hoare triple {1890#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1890#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:05:44,051 INFO L272 TraceCheckUtils]: 47: Hoare triple {1890#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1951#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:05:44,051 INFO L290 TraceCheckUtils]: 48: Hoare triple {1951#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1955#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:05:44,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {1955#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= 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[] {1805#false} is VALID [2022-04-07 19:05:44,053 INFO L290 TraceCheckUtils]: 50: Hoare triple {1805#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1805#false} is VALID [2022-04-07 19:05:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-07 19:05:44,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:05:44,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:05:44,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804972181] [2022-04-07 19:05:44,055 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:05:44,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089988920] [2022-04-07 19:05:44,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089988920] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:05:44,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:05:44,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:05:44,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613268992] [2022-04-07 19:05:44,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:05:44,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-07 19:05:44,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:05:44,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-07 19:05:44,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:05:44,080 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:05:44,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:05:44,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:05:44,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:05:44,081 INFO L87 Difference]: Start difference. First operand 74 states and 101 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-07 19:05:44,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:05:44,228 INFO L93 Difference]: Finished difference Result 82 states and 107 transitions. [2022-04-07 19:05:44,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:05:44,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-07 19:05:44,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:05:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-07 19:05:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-07 19:05:44,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-07 19:05:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-07 19:05:44,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-04-07 19:05:44,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:05:44,275 INFO L225 Difference]: With dead ends: 82 [2022-04-07 19:05:44,275 INFO L226 Difference]: Without dead ends: 81 [2022-04-07 19:05:44,275 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:05:44,275 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:05:44,276 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 146 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:05:44,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-07 19:05:44,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-04-07 19:05:44,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:05:44,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 19:05:44,280 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 19:05:44,280 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 19:05:44,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:05:44,282 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2022-04-07 19:05:44,282 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-04-07 19:05:44,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:05:44,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:05:44,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 81 states. [2022-04-07 19:05:44,283 INFO L87 Difference]: Start difference. First operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 81 states. [2022-04-07 19:05:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:05:44,285 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2022-04-07 19:05:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-04-07 19:05:44,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:05:44,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:05:44,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:05:44,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:05:44,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 19:05:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2022-04-07 19:05:44,288 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 51 [2022-04-07 19:05:44,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:05:44,288 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2022-04-07 19:05:44,288 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-07 19:05:44,288 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2022-04-07 19:05:44,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-07 19:05:44,288 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:05:44,289 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:05:44,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-07 19:05:44,503 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 19:05:44,503 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:05:44,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:05:44,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1046589490, now seen corresponding path program 1 times [2022-04-07 19:05:44,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:05:44,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510205223] [2022-04-07 19:05:44,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:05:44,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:05:44,517 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:05:44,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416522332] [2022-04-07 19:05:44,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:05:44,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:05:44,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:05:44,518 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 19:05:44,519 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 19:05:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:05:44,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 19:05:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:05:44,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:05:44,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {2286#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:05:44,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {2286#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2286#true} is VALID [2022-04-07 19:05:44,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {2286#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:05:44,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2286#true} {2286#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:05:44,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {2286#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:05:44,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {2286#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2286#true} is VALID [2022-04-07 19:05:44,698 INFO L272 TraceCheckUtils]: 6: Hoare triple {2286#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2286#true} is VALID [2022-04-07 19:05:44,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {2286#true} [99] assume_abort_if_notENTRY-->L8: 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] {2286#true} is VALID [2022-04-07 19:05:44,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {2286#true} [102] L8-->L8-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[] {2286#true} is VALID [2022-04-07 19:05:44,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {2286#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:05:44,699 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2286#true} {2286#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2286#true} is VALID [2022-04-07 19:05:44,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {2286#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {2286#true} is VALID [2022-04-07 19:05:44,699 INFO L272 TraceCheckUtils]: 12: Hoare triple {2286#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2286#true} is VALID [2022-04-07 19:05:44,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {2286#true} [99] assume_abort_if_notENTRY-->L8: 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] {2286#true} is VALID [2022-04-07 19:05:44,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {2286#true} [102] L8-->L8-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[] {2286#true} is VALID [2022-04-07 19:05:44,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {2286#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:05:44,699 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2286#true} {2286#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2286#true} is VALID [2022-04-07 19:05:44,699 INFO L272 TraceCheckUtils]: 17: Hoare triple {2286#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2286#true} is VALID [2022-04-07 19:05:44,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {2286#true} [99] assume_abort_if_notENTRY-->L8: 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] {2286#true} is VALID [2022-04-07 19:05:44,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {2286#true} [102] L8-->L8-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[] {2286#true} is VALID [2022-04-07 19:05:44,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {2286#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:05:44,700 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2286#true} {2286#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2286#true} is VALID [2022-04-07 19:05:44,700 INFO L272 TraceCheckUtils]: 22: Hoare triple {2286#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2286#true} is VALID [2022-04-07 19:05:44,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {2286#true} [99] assume_abort_if_notENTRY-->L8: 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] {2286#true} is VALID [2022-04-07 19:05:44,700 INFO L290 TraceCheckUtils]: 24: Hoare triple {2286#true} [102] L8-->L8-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[] {2286#true} is VALID [2022-04-07 19:05:44,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {2286#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:05:44,700 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2286#true} {2286#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2286#true} is VALID [2022-04-07 19:05:44,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {2286#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2286#true} is VALID [2022-04-07 19:05:44,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {2286#true} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:05:44,700 INFO L272 TraceCheckUtils]: 29: Hoare triple {2286#true} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2286#true} is VALID [2022-04-07 19:05:44,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {2286#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2286#true} is VALID [2022-04-07 19:05:44,701 INFO L290 TraceCheckUtils]: 31: Hoare triple {2286#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:05:44,701 INFO L290 TraceCheckUtils]: 32: Hoare triple {2286#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:05:44,701 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2286#true} {2286#true} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2286#true} is VALID [2022-04-07 19:05:44,701 INFO L272 TraceCheckUtils]: 34: Hoare triple {2286#true} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2286#true} is VALID [2022-04-07 19:05:44,701 INFO L290 TraceCheckUtils]: 35: Hoare triple {2286#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2396#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:05:44,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {2396#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2400#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:05:44,702 INFO L290 TraceCheckUtils]: 37: Hoare triple {2400#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2400#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:05:44,703 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2400#(not (= |__VERIFIER_assert_#in~cond| 0))} {2286#true} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2407#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:05:44,703 INFO L272 TraceCheckUtils]: 39: Hoare triple {2407#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2286#true} is VALID [2022-04-07 19:05:44,703 INFO L290 TraceCheckUtils]: 40: Hoare triple {2286#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2286#true} is VALID [2022-04-07 19:05:44,703 INFO L290 TraceCheckUtils]: 41: Hoare triple {2286#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:05:44,703 INFO L290 TraceCheckUtils]: 42: Hoare triple {2286#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:05:44,704 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2286#true} {2407#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2407#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:05:44,704 INFO L290 TraceCheckUtils]: 44: Hoare triple {2407#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [123] L38-->L35-2: Formula: (= v_main_~a~0_9 v_main_~b~0_11) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {2426#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:05:44,704 INFO L272 TraceCheckUtils]: 45: Hoare triple {2426#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [110] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2286#true} is VALID [2022-04-07 19:05:44,704 INFO L290 TraceCheckUtils]: 46: Hoare triple {2286#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2286#true} is VALID [2022-04-07 19:05:44,704 INFO L290 TraceCheckUtils]: 47: Hoare triple {2286#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:05:44,704 INFO L290 TraceCheckUtils]: 48: Hoare triple {2286#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:05:44,705 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2286#true} {2426#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [137] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2426#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:05:44,706 INFO L272 TraceCheckUtils]: 50: Hoare triple {2426#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [112] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* (- 1) v_main_~b~0_14) (* v_main_~p~0_12 v_main_~x~0_15) (* v_main_~r~0_12 v_main_~y~0_14)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_15, main_~b~0=v_main_~b~0_14, main_~p~0=v_main_~p~0_12, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0] {2445#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:05:44,706 INFO L290 TraceCheckUtils]: 51: Hoare triple {2445#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2449#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:05:44,706 INFO L290 TraceCheckUtils]: 52: Hoare triple {2449#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= 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[] {2287#false} is VALID [2022-04-07 19:05:44,706 INFO L290 TraceCheckUtils]: 53: Hoare triple {2287#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2287#false} is VALID [2022-04-07 19:05:44,707 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-07 19:05:44,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:06:03,825 INFO L290 TraceCheckUtils]: 53: Hoare triple {2287#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2287#false} is VALID [2022-04-07 19:06:03,826 INFO L290 TraceCheckUtils]: 52: Hoare triple {2449#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= 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[] {2287#false} is VALID [2022-04-07 19:06:03,826 INFO L290 TraceCheckUtils]: 51: Hoare triple {2445#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2449#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:06:03,827 INFO L272 TraceCheckUtils]: 50: Hoare triple {2426#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [112] L54-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* (- 1) v_main_~b~0_14) (* v_main_~p~0_12 v_main_~x~0_15) (* v_main_~r~0_12 v_main_~y~0_14)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_15, main_~b~0=v_main_~b~0_14, main_~p~0=v_main_~p~0_12, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0] {2445#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:06:03,828 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2286#true} {2426#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [137] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2426#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:06:03,828 INFO L290 TraceCheckUtils]: 48: Hoare triple {2286#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:06:03,828 INFO L290 TraceCheckUtils]: 47: Hoare triple {2286#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:06:03,828 INFO L290 TraceCheckUtils]: 46: Hoare triple {2286#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2286#true} is VALID [2022-04-07 19:06:03,828 INFO L272 TraceCheckUtils]: 45: Hoare triple {2426#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [110] L35-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2286#true} is VALID [2022-04-07 19:06:03,828 INFO L290 TraceCheckUtils]: 44: Hoare triple {2407#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [123] L38-->L35-2: Formula: (= v_main_~a~0_9 v_main_~b~0_11) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {2426#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:06:03,829 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2286#true} {2407#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2407#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:06:03,829 INFO L290 TraceCheckUtils]: 42: Hoare triple {2286#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:06:03,829 INFO L290 TraceCheckUtils]: 41: Hoare triple {2286#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:06:03,829 INFO L290 TraceCheckUtils]: 40: Hoare triple {2286#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2286#true} is VALID [2022-04-07 19:06:03,830 INFO L272 TraceCheckUtils]: 39: Hoare triple {2407#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2286#true} is VALID [2022-04-07 19:06:03,830 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2400#(not (= |__VERIFIER_assert_#in~cond| 0))} {2286#true} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2407#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:06:03,830 INFO L290 TraceCheckUtils]: 37: Hoare triple {2400#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2400#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:06:03,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {2510#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2400#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:06:03,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {2286#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2510#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:06:03,831 INFO L272 TraceCheckUtils]: 34: Hoare triple {2286#true} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2286#true} is VALID [2022-04-07 19:06:03,831 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2286#true} {2286#true} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2286#true} is VALID [2022-04-07 19:06:03,831 INFO L290 TraceCheckUtils]: 32: Hoare triple {2286#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:06:03,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {2286#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:06:03,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {2286#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2286#true} is VALID [2022-04-07 19:06:03,832 INFO L272 TraceCheckUtils]: 29: Hoare triple {2286#true} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2286#true} is VALID [2022-04-07 19:06:03,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {2286#true} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:06:03,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {2286#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2286#true} is VALID [2022-04-07 19:06:03,832 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2286#true} {2286#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2286#true} is VALID [2022-04-07 19:06:03,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {2286#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:06:03,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {2286#true} [102] L8-->L8-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[] {2286#true} is VALID [2022-04-07 19:06:03,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {2286#true} [99] assume_abort_if_notENTRY-->L8: 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] {2286#true} is VALID [2022-04-07 19:06:03,832 INFO L272 TraceCheckUtils]: 22: Hoare triple {2286#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2286#true} is VALID [2022-04-07 19:06:03,832 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2286#true} {2286#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2286#true} is VALID [2022-04-07 19:06:03,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {2286#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:06:03,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {2286#true} [102] L8-->L8-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[] {2286#true} is VALID [2022-04-07 19:06:03,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {2286#true} [99] assume_abort_if_notENTRY-->L8: 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] {2286#true} is VALID [2022-04-07 19:06:03,833 INFO L272 TraceCheckUtils]: 17: Hoare triple {2286#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2286#true} is VALID [2022-04-07 19:06:03,833 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2286#true} {2286#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2286#true} is VALID [2022-04-07 19:06:03,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {2286#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:06:03,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {2286#true} [102] L8-->L8-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[] {2286#true} is VALID [2022-04-07 19:06:03,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {2286#true} [99] assume_abort_if_notENTRY-->L8: 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] {2286#true} is VALID [2022-04-07 19:06:03,833 INFO L272 TraceCheckUtils]: 12: Hoare triple {2286#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2286#true} is VALID [2022-04-07 19:06:03,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {2286#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {2286#true} is VALID [2022-04-07 19:06:03,833 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2286#true} {2286#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2286#true} is VALID [2022-04-07 19:06:03,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {2286#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:06:03,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {2286#true} [102] L8-->L8-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[] {2286#true} is VALID [2022-04-07 19:06:03,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {2286#true} [99] assume_abort_if_notENTRY-->L8: 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] {2286#true} is VALID [2022-04-07 19:06:03,833 INFO L272 TraceCheckUtils]: 6: Hoare triple {2286#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2286#true} is VALID [2022-04-07 19:06:03,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {2286#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2286#true} is VALID [2022-04-07 19:06:03,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {2286#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:06:03,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2286#true} {2286#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:06:03,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {2286#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:06:03,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {2286#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2286#true} is VALID [2022-04-07 19:06:03,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {2286#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2286#true} is VALID [2022-04-07 19:06:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-07 19:06:03,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:06:03,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510205223] [2022-04-07 19:06:03,834 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:06:03,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416522332] [2022-04-07 19:06:03,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416522332] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:06:03,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:06:03,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-07 19:06:03,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364373503] [2022-04-07 19:06:03,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:06:03,835 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-07 19:06:03,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:06:03,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:06:03,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:06:03,863 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 19:06:03,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:06:03,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 19:06:03,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-07 19:06:03,864 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:06:04,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:04,307 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2022-04-07 19:06:04,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 19:06:04,307 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-07 19:06:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:06:04,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:06:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-07 19:06:04,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:06:04,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-07 19:06:04,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2022-04-07 19:06:04,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:06:04,351 INFO L225 Difference]: With dead ends: 86 [2022-04-07 19:06:04,351 INFO L226 Difference]: Without dead ends: 84 [2022-04-07 19:06:04,351 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-07 19:06:04,351 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 19:06:04,352 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 109 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 19:06:04,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-07 19:06:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-07 19:06:04,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:06:04,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 19:06:04,356 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 19:06:04,356 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 19:06:04,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:04,358 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-04-07 19:06:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-07 19:06:04,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:04,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:04,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 84 states. [2022-04-07 19:06:04,359 INFO L87 Difference]: Start difference. First operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 84 states. [2022-04-07 19:06:04,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:04,362 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-04-07 19:06:04,362 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-07 19:06:04,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:04,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:04,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:06:04,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:06:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 19:06:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2022-04-07 19:06:04,365 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 54 [2022-04-07 19:06:04,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:06:04,365 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2022-04-07 19:06:04,365 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:06:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-07 19:06:04,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-07 19:06:04,366 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:06:04,366 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:06:04,396 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 19:06:04,566 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 19:06:04,567 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:06:04,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:06:04,567 INFO L85 PathProgramCache]: Analyzing trace with hash -2126309122, now seen corresponding path program 2 times [2022-04-07 19:06:04,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:06:04,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124486803] [2022-04-07 19:06:04,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:06:04,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:06:04,581 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:06:04,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [709895062] [2022-04-07 19:06:04,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 19:06:04,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:06:04,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:06:04,592 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 19:06:04,593 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 19:06:04,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 19:06:04,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 19:06:04,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-07 19:06:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:06:04,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:06:04,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {2962#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:04,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {2962#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2962#true} is VALID [2022-04-07 19:06:04,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {2962#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:04,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2962#true} {2962#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:04,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {2962#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:04,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {2962#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2962#true} is VALID [2022-04-07 19:06:04,917 INFO L272 TraceCheckUtils]: 6: Hoare triple {2962#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2962#true} is VALID [2022-04-07 19:06:04,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {2962#true} [99] assume_abort_if_notENTRY-->L8: 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] {2962#true} is VALID [2022-04-07 19:06:04,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {2962#true} [102] L8-->L8-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[] {2962#true} is VALID [2022-04-07 19:06:04,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {2962#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:04,918 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2962#true} {2962#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2962#true} is VALID [2022-04-07 19:06:04,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {2962#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {2962#true} is VALID [2022-04-07 19:06:04,918 INFO L272 TraceCheckUtils]: 12: Hoare triple {2962#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2962#true} is VALID [2022-04-07 19:06:04,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {2962#true} [99] assume_abort_if_notENTRY-->L8: 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] {2962#true} is VALID [2022-04-07 19:06:04,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {2962#true} [102] L8-->L8-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[] {2962#true} is VALID [2022-04-07 19:06:04,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {2962#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:04,918 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2962#true} {2962#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2962#true} is VALID [2022-04-07 19:06:04,918 INFO L272 TraceCheckUtils]: 17: Hoare triple {2962#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2962#true} is VALID [2022-04-07 19:06:04,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {2962#true} [99] assume_abort_if_notENTRY-->L8: 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] {2962#true} is VALID [2022-04-07 19:06:04,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {2962#true} [102] L8-->L8-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[] {2962#true} is VALID [2022-04-07 19:06:04,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {2962#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:04,919 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2962#true} {2962#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2962#true} is VALID [2022-04-07 19:06:04,919 INFO L272 TraceCheckUtils]: 22: Hoare triple {2962#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2962#true} is VALID [2022-04-07 19:06:04,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {2962#true} [99] assume_abort_if_notENTRY-->L8: 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] {2962#true} is VALID [2022-04-07 19:06:04,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {2962#true} [102] L8-->L8-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[] {2962#true} is VALID [2022-04-07 19:06:04,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {2962#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:04,919 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2962#true} {2962#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2962#true} is VALID [2022-04-07 19:06:04,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {2962#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3048#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:04,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {3048#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3048#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:04,920 INFO L272 TraceCheckUtils]: 29: Hoare triple {3048#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2962#true} is VALID [2022-04-07 19:06:04,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {2962#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2962#true} is VALID [2022-04-07 19:06:04,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {2962#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:04,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {2962#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:04,921 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2962#true} {3048#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3048#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:04,921 INFO L272 TraceCheckUtils]: 34: Hoare triple {3048#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2962#true} is VALID [2022-04-07 19:06:04,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {2962#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2962#true} is VALID [2022-04-07 19:06:04,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {2962#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:04,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {2962#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:04,922 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2962#true} {3048#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3048#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:04,922 INFO L272 TraceCheckUtils]: 39: Hoare triple {3048#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2962#true} is VALID [2022-04-07 19:06:04,922 INFO L290 TraceCheckUtils]: 40: Hoare triple {2962#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2962#true} is VALID [2022-04-07 19:06:04,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {2962#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:04,922 INFO L290 TraceCheckUtils]: 42: Hoare triple {2962#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:04,923 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2962#true} {3048#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3048#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:04,923 INFO L290 TraceCheckUtils]: 44: Hoare triple {3048#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {3048#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:04,923 INFO L290 TraceCheckUtils]: 45: Hoare triple {3048#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {3103#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} is VALID [2022-04-07 19:06:04,924 INFO L290 TraceCheckUtils]: 46: Hoare triple {3103#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3103#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} is VALID [2022-04-07 19:06:04,924 INFO L272 TraceCheckUtils]: 47: Hoare triple {3103#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2962#true} is VALID [2022-04-07 19:06:04,924 INFO L290 TraceCheckUtils]: 48: Hoare triple {2962#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2962#true} is VALID [2022-04-07 19:06:04,924 INFO L290 TraceCheckUtils]: 49: Hoare triple {2962#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:04,924 INFO L290 TraceCheckUtils]: 50: Hoare triple {2962#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:04,925 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2962#true} {3103#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3103#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} is VALID [2022-04-07 19:06:04,925 INFO L272 TraceCheckUtils]: 52: Hoare triple {3103#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3125#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:06:04,925 INFO L290 TraceCheckUtils]: 53: Hoare triple {3125#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3129#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:06:04,926 INFO L290 TraceCheckUtils]: 54: Hoare triple {3129#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= 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[] {2963#false} is VALID [2022-04-07 19:06:04,926 INFO L290 TraceCheckUtils]: 55: Hoare triple {2963#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2963#false} is VALID [2022-04-07 19:06:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-07 19:06:04,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:06:05,145 INFO L290 TraceCheckUtils]: 55: Hoare triple {2963#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2963#false} is VALID [2022-04-07 19:06:05,146 INFO L290 TraceCheckUtils]: 54: Hoare triple {3129#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= 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[] {2963#false} is VALID [2022-04-07 19:06:05,146 INFO L290 TraceCheckUtils]: 53: Hoare triple {3125#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3129#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:06:05,160 INFO L272 TraceCheckUtils]: 52: Hoare triple {3145#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3125#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:06:05,161 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2962#true} {3145#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3145#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:06:05,161 INFO L290 TraceCheckUtils]: 50: Hoare triple {2962#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:05,161 INFO L290 TraceCheckUtils]: 49: Hoare triple {2962#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:05,161 INFO L290 TraceCheckUtils]: 48: Hoare triple {2962#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2962#true} is VALID [2022-04-07 19:06:05,161 INFO L272 TraceCheckUtils]: 47: Hoare triple {3145#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2962#true} is VALID [2022-04-07 19:06:05,161 INFO L290 TraceCheckUtils]: 46: Hoare triple {3145#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3145#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:06:05,381 INFO L290 TraceCheckUtils]: 45: Hoare triple {3167#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {3145#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:06:05,393 INFO L290 TraceCheckUtils]: 44: Hoare triple {3167#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {3167#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-07 19:06:05,394 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2962#true} {3167#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3167#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-07 19:06:05,394 INFO L290 TraceCheckUtils]: 42: Hoare triple {2962#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:05,394 INFO L290 TraceCheckUtils]: 41: Hoare triple {2962#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:05,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {2962#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2962#true} is VALID [2022-04-07 19:06:05,394 INFO L272 TraceCheckUtils]: 39: Hoare triple {3167#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2962#true} is VALID [2022-04-07 19:06:05,394 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2962#true} {3167#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3167#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-07 19:06:05,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {2962#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:05,395 INFO L290 TraceCheckUtils]: 36: Hoare triple {2962#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:05,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {2962#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2962#true} is VALID [2022-04-07 19:06:05,395 INFO L272 TraceCheckUtils]: 34: Hoare triple {3167#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2962#true} is VALID [2022-04-07 19:06:05,412 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2962#true} {3167#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3167#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-07 19:06:05,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {2962#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:05,412 INFO L290 TraceCheckUtils]: 31: Hoare triple {2962#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:05,412 INFO L290 TraceCheckUtils]: 30: Hoare triple {2962#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2962#true} is VALID [2022-04-07 19:06:05,412 INFO L272 TraceCheckUtils]: 29: Hoare triple {3167#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2962#true} is VALID [2022-04-07 19:06:05,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {3167#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3167#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-07 19:06:05,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {2962#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3167#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-07 19:06:05,413 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2962#true} {2962#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2962#true} is VALID [2022-04-07 19:06:05,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {2962#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:05,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {2962#true} [102] L8-->L8-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[] {2962#true} is VALID [2022-04-07 19:06:05,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {2962#true} [99] assume_abort_if_notENTRY-->L8: 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] {2962#true} is VALID [2022-04-07 19:06:05,414 INFO L272 TraceCheckUtils]: 22: Hoare triple {2962#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2962#true} is VALID [2022-04-07 19:06:05,414 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2962#true} {2962#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2962#true} is VALID [2022-04-07 19:06:05,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {2962#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:05,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {2962#true} [102] L8-->L8-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[] {2962#true} is VALID [2022-04-07 19:06:05,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {2962#true} [99] assume_abort_if_notENTRY-->L8: 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] {2962#true} is VALID [2022-04-07 19:06:05,414 INFO L272 TraceCheckUtils]: 17: Hoare triple {2962#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2962#true} is VALID [2022-04-07 19:06:05,414 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2962#true} {2962#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2962#true} is VALID [2022-04-07 19:06:05,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {2962#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:05,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {2962#true} [102] L8-->L8-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[] {2962#true} is VALID [2022-04-07 19:06:05,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {2962#true} [99] assume_abort_if_notENTRY-->L8: 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] {2962#true} is VALID [2022-04-07 19:06:05,415 INFO L272 TraceCheckUtils]: 12: Hoare triple {2962#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2962#true} is VALID [2022-04-07 19:06:05,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {2962#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {2962#true} is VALID [2022-04-07 19:06:05,415 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2962#true} {2962#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2962#true} is VALID [2022-04-07 19:06:05,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {2962#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:05,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {2962#true} [102] L8-->L8-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[] {2962#true} is VALID [2022-04-07 19:06:05,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {2962#true} [99] assume_abort_if_notENTRY-->L8: 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] {2962#true} is VALID [2022-04-07 19:06:05,415 INFO L272 TraceCheckUtils]: 6: Hoare triple {2962#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2962#true} is VALID [2022-04-07 19:06:05,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {2962#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2962#true} is VALID [2022-04-07 19:06:05,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {2962#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:05,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2962#true} {2962#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:05,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {2962#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:05,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {2962#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2962#true} is VALID [2022-04-07 19:06:05,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {2962#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2962#true} is VALID [2022-04-07 19:06:05,416 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-07 19:06:05,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:06:05,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124486803] [2022-04-07 19:06:05,416 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:06:05,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709895062] [2022-04-07 19:06:05,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709895062] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:06:05,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:06:05,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 19:06:05,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824799826] [2022-04-07 19:06:05,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:06:05,417 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 56 [2022-04-07 19:06:05,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:06:05,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 19:06:05,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:06:05,716 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 19:06:05,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:06:05,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 19:06:05,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 19:06:05,716 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 19:06:08,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:08,612 INFO L93 Difference]: Finished difference Result 108 states and 139 transitions. [2022-04-07 19:06:08,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 19:06:08,612 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 56 [2022-04-07 19:06:08,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:06:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 19:06:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-07 19:06:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 19:06:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-07 19:06:08,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2022-04-07 19:06:08,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:06:08,928 INFO L225 Difference]: With dead ends: 108 [2022-04-07 19:06:08,929 INFO L226 Difference]: Without dead ends: 103 [2022-04-07 19:06:08,929 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-07 19:06:08,929 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 19:06:08,930 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 154 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 19:06:08,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-07 19:06:08,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 88. [2022-04-07 19:06:08,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:06:08,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 88 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 19:06:08,934 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 88 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 19:06:08,934 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 88 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 19:06:08,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:08,937 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-04-07 19:06:08,937 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-07 19:06:08,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:08,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:08,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 103 states. [2022-04-07 19:06:08,938 INFO L87 Difference]: Start difference. First operand has 88 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 103 states. [2022-04-07 19:06:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:08,941 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-04-07 19:06:08,941 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-07 19:06:08,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:08,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:08,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:06:08,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:06:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 19:06:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2022-04-07 19:06:08,943 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 56 [2022-04-07 19:06:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:06:08,943 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2022-04-07 19:06:08,943 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-07 19:06:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2022-04-07 19:06:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-07 19:06:08,944 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:06:08,944 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:06:08,963 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 19:06:09,159 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 19:06:09,160 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:06:09,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:06:09,160 INFO L85 PathProgramCache]: Analyzing trace with hash -296466288, now seen corresponding path program 1 times [2022-04-07 19:06:09,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:06:09,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488660035] [2022-04-07 19:06:09,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:06:09,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:06:09,183 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:06:09,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [614648471] [2022-04-07 19:06:09,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:06:09,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:06:09,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:06:09,196 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:06:09,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-07 19:06:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:06:09,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 19:06:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:06:09,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:06:09,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {3713#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {3713#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3713#true} is VALID [2022-04-07 19:06:09,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {3713#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3713#true} {3713#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {3713#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {3713#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3713#true} is VALID [2022-04-07 19:06:09,559 INFO L272 TraceCheckUtils]: 6: Hoare triple {3713#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3713#true} is VALID [2022-04-07 19:06:09,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {3713#true} [99] assume_abort_if_notENTRY-->L8: 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] {3713#true} is VALID [2022-04-07 19:06:09,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {3713#true} [102] L8-->L8-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[] {3713#true} is VALID [2022-04-07 19:06:09,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {3713#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,560 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3713#true} {3713#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3713#true} is VALID [2022-04-07 19:06:09,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {3713#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {3713#true} is VALID [2022-04-07 19:06:09,560 INFO L272 TraceCheckUtils]: 12: Hoare triple {3713#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3713#true} is VALID [2022-04-07 19:06:09,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {3713#true} [99] assume_abort_if_notENTRY-->L8: 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] {3713#true} is VALID [2022-04-07 19:06:09,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {3713#true} [102] L8-->L8-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[] {3713#true} is VALID [2022-04-07 19:06:09,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {3713#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,560 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3713#true} {3713#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3713#true} is VALID [2022-04-07 19:06:09,560 INFO L272 TraceCheckUtils]: 17: Hoare triple {3713#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3713#true} is VALID [2022-04-07 19:06:09,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {3713#true} [99] assume_abort_if_notENTRY-->L8: 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] {3713#true} is VALID [2022-04-07 19:06:09,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {3713#true} [102] L8-->L8-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[] {3713#true} is VALID [2022-04-07 19:06:09,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {3713#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,560 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3713#true} {3713#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3713#true} is VALID [2022-04-07 19:06:09,560 INFO L272 TraceCheckUtils]: 22: Hoare triple {3713#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3713#true} is VALID [2022-04-07 19:06:09,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {3713#true} [99] assume_abort_if_notENTRY-->L8: 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] {3713#true} is VALID [2022-04-07 19:06:09,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {3713#true} [102] L8-->L8-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[] {3713#true} is VALID [2022-04-07 19:06:09,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {3713#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,561 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3713#true} {3713#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3713#true} is VALID [2022-04-07 19:06:09,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {3713#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:09,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {3799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:09,561 INFO L272 TraceCheckUtils]: 29: Hoare triple {3799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3713#true} is VALID [2022-04-07 19:06:09,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {3713#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3713#true} is VALID [2022-04-07 19:06:09,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {3713#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {3713#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,562 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3713#true} {3799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:09,562 INFO L272 TraceCheckUtils]: 34: Hoare triple {3799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3713#true} is VALID [2022-04-07 19:06:09,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {3713#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3713#true} is VALID [2022-04-07 19:06:09,562 INFO L290 TraceCheckUtils]: 36: Hoare triple {3713#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,562 INFO L290 TraceCheckUtils]: 37: Hoare triple {3713#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,563 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3713#true} {3799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:09,563 INFO L272 TraceCheckUtils]: 39: Hoare triple {3799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3713#true} is VALID [2022-04-07 19:06:09,563 INFO L290 TraceCheckUtils]: 40: Hoare triple {3713#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3713#true} is VALID [2022-04-07 19:06:09,563 INFO L290 TraceCheckUtils]: 41: Hoare triple {3713#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,563 INFO L290 TraceCheckUtils]: 42: Hoare triple {3713#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,564 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3713#true} {3799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:09,564 INFO L290 TraceCheckUtils]: 44: Hoare triple {3799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {3799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:09,565 INFO L290 TraceCheckUtils]: 45: Hoare triple {3799#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {3854#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-07 19:06:09,565 INFO L290 TraceCheckUtils]: 46: Hoare triple {3854#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3854#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-07 19:06:09,565 INFO L272 TraceCheckUtils]: 47: Hoare triple {3854#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3713#true} is VALID [2022-04-07 19:06:09,565 INFO L290 TraceCheckUtils]: 48: Hoare triple {3713#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3713#true} is VALID [2022-04-07 19:06:09,565 INFO L290 TraceCheckUtils]: 49: Hoare triple {3713#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,565 INFO L290 TraceCheckUtils]: 50: Hoare triple {3713#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,566 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3713#true} {3854#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3854#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-07 19:06:09,566 INFO L272 TraceCheckUtils]: 52: Hoare triple {3854#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3713#true} is VALID [2022-04-07 19:06:09,566 INFO L290 TraceCheckUtils]: 53: Hoare triple {3713#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3713#true} is VALID [2022-04-07 19:06:09,566 INFO L290 TraceCheckUtils]: 54: Hoare triple {3713#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,566 INFO L290 TraceCheckUtils]: 55: Hoare triple {3713#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,566 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3713#true} {3854#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3854#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-07 19:06:09,567 INFO L272 TraceCheckUtils]: 57: Hoare triple {3854#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3713#true} is VALID [2022-04-07 19:06:09,567 INFO L290 TraceCheckUtils]: 58: Hoare triple {3713#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3713#true} is VALID [2022-04-07 19:06:09,567 INFO L290 TraceCheckUtils]: 59: Hoare triple {3713#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,567 INFO L290 TraceCheckUtils]: 60: Hoare triple {3713#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,567 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3713#true} {3854#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3854#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-07 19:06:09,568 INFO L290 TraceCheckUtils]: 62: Hoare triple {3854#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {3854#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-07 19:06:09,568 INFO L290 TraceCheckUtils]: 63: Hoare triple {3854#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [127] L43-->L43-2: Formula: (and (not (< v_main_~b~0_4 v_main_~a~0_4)) (= v_main_~b~0_3 (+ v_main_~b~0_4 (* (- 1) v_main_~a~0_4))) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {3909#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-07 19:06:09,568 INFO L290 TraceCheckUtils]: 64: Hoare triple {3909#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3909#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-07 19:06:09,569 INFO L272 TraceCheckUtils]: 65: Hoare triple {3909#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3916#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:06:09,569 INFO L290 TraceCheckUtils]: 66: Hoare triple {3916#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3920#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:06:09,570 INFO L290 TraceCheckUtils]: 67: Hoare triple {3920#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= 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[] {3714#false} is VALID [2022-04-07 19:06:09,570 INFO L290 TraceCheckUtils]: 68: Hoare triple {3714#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3714#false} is VALID [2022-04-07 19:06:09,570 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-07 19:06:09,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:06:09,790 INFO L290 TraceCheckUtils]: 68: Hoare triple {3714#false} [120] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3714#false} is VALID [2022-04-07 19:06:09,790 INFO L290 TraceCheckUtils]: 67: Hoare triple {3920#(<= 1 __VERIFIER_assert_~cond)} [116] L11-->L12: Formula: (= 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[] {3714#false} is VALID [2022-04-07 19:06:09,790 INFO L290 TraceCheckUtils]: 66: Hoare triple {3916#(<= 1 |__VERIFIER_assert_#in~cond|)} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3920#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:06:09,791 INFO L272 TraceCheckUtils]: 65: Hoare triple {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3916#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:06:09,791 INFO L290 TraceCheckUtils]: 64: Hoare triple {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-07 19:06:09,793 INFO L290 TraceCheckUtils]: 63: Hoare triple {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [127] L43-->L43-2: Formula: (and (not (< v_main_~b~0_4 v_main_~a~0_4)) (= v_main_~b~0_3 (+ v_main_~b~0_4 (* (- 1) v_main_~a~0_4))) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-07 19:06:09,794 INFO L290 TraceCheckUtils]: 62: Hoare triple {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-07 19:06:09,794 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3713#true} {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-07 19:06:09,794 INFO L290 TraceCheckUtils]: 60: Hoare triple {3713#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,794 INFO L290 TraceCheckUtils]: 59: Hoare triple {3713#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,795 INFO L290 TraceCheckUtils]: 58: Hoare triple {3713#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3713#true} is VALID [2022-04-07 19:06:09,795 INFO L272 TraceCheckUtils]: 57: Hoare triple {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3713#true} is VALID [2022-04-07 19:06:09,795 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3713#true} {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-07 19:06:09,795 INFO L290 TraceCheckUtils]: 55: Hoare triple {3713#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,795 INFO L290 TraceCheckUtils]: 54: Hoare triple {3713#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,795 INFO L290 TraceCheckUtils]: 53: Hoare triple {3713#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3713#true} is VALID [2022-04-07 19:06:09,795 INFO L272 TraceCheckUtils]: 52: Hoare triple {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3713#true} is VALID [2022-04-07 19:06:09,797 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3713#true} {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-07 19:06:09,797 INFO L290 TraceCheckUtils]: 50: Hoare triple {3713#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,797 INFO L290 TraceCheckUtils]: 49: Hoare triple {3713#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,797 INFO L290 TraceCheckUtils]: 48: Hoare triple {3713#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3713#true} is VALID [2022-04-07 19:06:09,797 INFO L272 TraceCheckUtils]: 47: Hoare triple {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3713#true} is VALID [2022-04-07 19:06:09,797 INFO L290 TraceCheckUtils]: 46: Hoare triple {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-07 19:06:09,799 INFO L290 TraceCheckUtils]: 45: Hoare triple {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [126] L43-->L43-2: Formula: (and (= v_main_~a~0_2 (+ v_main_~a~0_3 (* (- 1) v_main_~b~0_2))) (< v_main_~b~0_2 v_main_~a~0_3) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_3} OutVars{main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~p~0, main_~r~0, main_~a~0] {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-07 19:06:09,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [124] L38-->L43: Formula: (not (= v_main_~a~0_1 v_main_~b~0_1)) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-07 19:06:09,800 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3713#true} {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [136] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-07 19:06:09,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {3713#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {3713#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {3713#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3713#true} is VALID [2022-04-07 19:06:09,800 INFO L272 TraceCheckUtils]: 39: Hoare triple {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [118] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (+ (* v_main_~q~0_11 v_main_~x~0_14) (* v_main_~s~0_11 v_main_~y~0_13)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_14, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3713#true} is VALID [2022-04-07 19:06:09,801 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3713#true} {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [135] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-07 19:06:09,801 INFO L290 TraceCheckUtils]: 37: Hoare triple {3713#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,801 INFO L290 TraceCheckUtils]: 36: Hoare triple {3713#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,801 INFO L290 TraceCheckUtils]: 35: Hoare triple {3713#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3713#true} is VALID [2022-04-07 19:06:09,801 INFO L272 TraceCheckUtils]: 34: Hoare triple {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [114] L36-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_13) (* v_main_~r~0_11 v_main_~y~0_12)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_13, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3713#true} is VALID [2022-04-07 19:06:09,807 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3713#true} {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [134] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-07 19:06:09,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {3713#true} [122] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {3713#true} [117] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {3713#true} [113] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3713#true} is VALID [2022-04-07 19:06:09,810 INFO L272 TraceCheckUtils]: 29: Hoare triple {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [111] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3713#true} is VALID [2022-04-07 19:06:09,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [109] L43-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-07 19:06:09,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {3713#true} [106] L26-->L43-2: Formula: (and (= v_main_~a~0_7 v_main_~x~0_8) (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~b~0_9 v_main_~y~0_7) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_9, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3936#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-07 19:06:09,812 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3713#true} {3713#true} [133] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3713#true} is VALID [2022-04-07 19:06:09,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {3713#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {3713#true} [102] L8-->L8-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[] {3713#true} is VALID [2022-04-07 19:06:09,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {3713#true} [99] assume_abort_if_notENTRY-->L8: 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] {3713#true} is VALID [2022-04-07 19:06:09,812 INFO L272 TraceCheckUtils]: 22: Hoare triple {3713#true} [105] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3713#true} is VALID [2022-04-07 19:06:09,812 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3713#true} {3713#true} [132] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3713#true} is VALID [2022-04-07 19:06:09,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {3713#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {3713#true} [102] L8-->L8-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[] {3713#true} is VALID [2022-04-07 19:06:09,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {3713#true} [99] assume_abort_if_notENTRY-->L8: 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] {3713#true} is VALID [2022-04-07 19:06:09,813 INFO L272 TraceCheckUtils]: 17: Hoare triple {3713#true} [103] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 v_main_~x~0_12) 1 0)) InVars {main_~x~0=v_main_~x~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3713#true} is VALID [2022-04-07 19:06:09,813 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3713#true} {3713#true} [131] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3713#true} is VALID [2022-04-07 19:06:09,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {3713#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {3713#true} [102] L8-->L8-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[] {3713#true} is VALID [2022-04-07 19:06:09,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {3713#true} [99] assume_abort_if_notENTRY-->L8: 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] {3713#true} is VALID [2022-04-07 19:06:09,813 INFO L272 TraceCheckUtils]: 12: Hoare triple {3713#true} [100] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= v_main_~y~0_10 20) (<= 0 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3713#true} is VALID [2022-04-07 19:06:09,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {3713#true} [98] L22-1-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~y~0] {3713#true} is VALID [2022-04-07 19:06:09,815 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3713#true} {3713#true} [130] assume_abort_if_notEXIT-->L22-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3713#true} is VALID [2022-04-07 19:06:09,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {3713#true} [104] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {3713#true} [102] L8-->L8-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[] {3713#true} is VALID [2022-04-07 19:06:09,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {3713#true} [99] assume_abort_if_notENTRY-->L8: 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] {3713#true} is VALID [2022-04-07 19:06:09,815 INFO L272 TraceCheckUtils]: 6: Hoare triple {3713#true} [97] L22-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= v_main_~x~0_11 20) (<= 0 v_main_~x~0_11)) 1 0)) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3713#true} is VALID [2022-04-07 19:06:09,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {3713#true} [95] mainENTRY-->L22: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3713#true} is VALID [2022-04-07 19:06:09,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {3713#true} [92] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3713#true} {3713#true} [129] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {3713#true} [96] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {3713#true} [93] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3713#true} is VALID [2022-04-07 19:06:09,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {3713#true} [91] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3713#true} is VALID [2022-04-07 19:06:09,816 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-04-07 19:06:09,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:06:09,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488660035] [2022-04-07 19:06:09,816 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:06:09,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614648471] [2022-04-07 19:06:09,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614648471] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 19:06:09,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 19:06:09,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-04-07 19:06:09,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099156626] [2022-04-07 19:06:09,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:06:09,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2022-04-07 19:06:09,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:06:09,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-07 19:06:09,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:06:09,842 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:06:09,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:06:09,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:06:09,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 19:06:09,843 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-07 19:06:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:09,962 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2022-04-07 19:06:09,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:06:09,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2022-04-07 19:06:09,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:06:09,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-07 19:06:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-07 19:06:09,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-07 19:06:09,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-07 19:06:09,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-04-07 19:06:09,999 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 19:06:09,999 INFO L225 Difference]: With dead ends: 86 [2022-04-07 19:06:09,999 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 19:06:10,000 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-07 19:06:10,000 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:06:10,000 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 108 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:06:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 19:06:10,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 19:06:10,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:06:10,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 19:06:10,001 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 19:06:10,001 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 19:06:10,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:10,001 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 19:06:10,001 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 19:06:10,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:10,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:10,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 19:06:10,001 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 19:06:10,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:10,001 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 19:06:10,001 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 19:06:10,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:10,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:10,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:06:10,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:06:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 19:06:10,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 19:06:10,002 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2022-04-07 19:06:10,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:06:10,002 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 19:06:10,002 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-07 19:06:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 19:06:10,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:10,004 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 19:06:10,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-07 19:06:10,215 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-07 19:06:10,218 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:06:10,219 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 19:06:10,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:06:10 BasicIcfg [2022-04-07 19:06:10,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 19:06:10,221 INFO L158 Benchmark]: Toolchain (without parser) took 30745.66ms. Allocated memory was 216.0MB in the beginning and 260.0MB in the end (delta: 44.0MB). Free memory was 193.2MB in the beginning and 100.7MB in the end (delta: 92.5MB). Peak memory consumption was 136.4MB. Max. memory is 8.0GB. [2022-04-07 19:06:10,221 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 216.0MB. Free memory is still 179.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 19:06:10,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.89ms. Allocated memory is still 216.0MB. Free memory was 193.2MB in the beginning and 189.7MB in the end (delta: 3.5MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2022-04-07 19:06:10,221 INFO L158 Benchmark]: Boogie Preprocessor took 22.80ms. Allocated memory is still 216.0MB. Free memory was 189.7MB in the beginning and 188.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 19:06:10,221 INFO L158 Benchmark]: RCFGBuilder took 315.45ms. Allocated memory is still 216.0MB. Free memory was 188.3MB in the beginning and 176.4MB in the end (delta: 11.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-07 19:06:10,222 INFO L158 Benchmark]: IcfgTransformer took 34.27ms. Allocated memory is still 216.0MB. Free memory was 176.4MB in the beginning and 174.6MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 19:06:10,222 INFO L158 Benchmark]: TraceAbstraction took 30104.83ms. Allocated memory was 216.0MB in the beginning and 260.0MB in the end (delta: 44.0MB). Free memory was 174.0MB in the beginning and 100.7MB in the end (delta: 73.3MB). Peak memory consumption was 117.4MB. Max. memory is 8.0GB. [2022-04-07 19:06:10,223 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 216.0MB. Free memory is still 179.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 252.89ms. Allocated memory is still 216.0MB. Free memory was 193.2MB in the beginning and 189.7MB in the end (delta: 3.5MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.80ms. Allocated memory is still 216.0MB. Free memory was 189.7MB in the beginning and 188.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 315.45ms. Allocated memory is still 216.0MB. Free memory was 188.3MB in the beginning and 176.4MB in the end (delta: 11.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 34.27ms. Allocated memory is still 216.0MB. Free memory was 176.4MB in the beginning and 174.6MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 30104.83ms. Allocated memory was 216.0MB in the beginning and 260.0MB in the end (delta: 44.0MB). Free memory was 174.0MB in the beginning and 100.7MB in the end (delta: 73.3MB). Peak memory consumption was 117.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.1s, OverallIterations: 9, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 1115 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 757 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 523 IncrementalHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 358 mSDtfsCounter, 523 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 635 GetRequests, 576 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=8, InterpolantAutomatonStates: 48, 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, 9 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 21.8s InterpolantComputationTime, 426 NumberOfCodeBlocks, 426 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 1676 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1087 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 627/666 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-07 19:06:10,243 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...