/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/cohencu-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 18:25:36,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 18:25:36,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 18:25:36,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 18:25:36,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 18:25:36,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 18:25:36,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 18:25:36,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 18:25:36,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 18:25:36,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 18:25:36,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 18:25:36,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 18:25:36,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 18:25:36,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 18:25:36,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 18:25:36,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 18:25:36,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 18:25:36,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 18:25:36,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 18:25:36,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 18:25:36,771 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 18:25:36,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 18:25:36,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 18:25:36,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 18:25:36,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 18:25:36,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 18:25:36,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 18:25:36,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 18:25:36,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 18:25:36,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 18:25:36,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 18:25:36,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 18:25:36,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 18:25:36,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 18:25:36,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 18:25:36,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 18:25:36,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 18:25:36,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 18:25:36,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 18:25:36,782 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 18:25:36,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 18:25:36,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 18:25:36,784 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 18:25:36,789 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 18:25:36,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 18:25:36,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 18:25:36,791 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 18:25:36,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 18:25:36,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 18:25:36,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 18:25:36,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 18:25:36,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 18:25:36,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 18:25:36,791 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 18:25:36,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 18:25:36,792 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 18:25:36,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 18:25:36,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 18:25:36,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 18:25:36,792 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 18:25:36,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 18:25:36,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 18:25:36,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 18:25:36,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 18:25:36,793 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 18:25:36,793 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 18:25:36,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 18:25:36,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 18:25:36,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 18:25:36,994 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 18:25:36,997 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 18:25:36,998 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2022-04-07 18:25:37,037 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dac572a2/8204a9fbd864414aa560ef54bd9f2d75/FLAGe56835680 [2022-04-07 18:25:37,389 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 18:25:37,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2022-04-07 18:25:37,398 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dac572a2/8204a9fbd864414aa560ef54bd9f2d75/FLAGe56835680 [2022-04-07 18:25:37,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dac572a2/8204a9fbd864414aa560ef54bd9f2d75 [2022-04-07 18:25:37,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 18:25:37,826 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 18:25:37,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 18:25:37,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 18:25:37,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 18:25:37,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 06:25:37" (1/1) ... [2022-04-07 18:25:37,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe723fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:25:37, skipping insertion in model container [2022-04-07 18:25:37,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 06:25:37" (1/1) ... [2022-04-07 18:25:37,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 18:25:37,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 18:25:37,946 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/cohencu-ll_unwindbound2.c[588,601] [2022-04-07 18:25:37,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 18:25:37,970 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 18:25:37,977 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/cohencu-ll_unwindbound2.c[588,601] [2022-04-07 18:25:37,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 18:25:37,992 INFO L208 MainTranslator]: Completed translation [2022-04-07 18:25:37,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:25:37 WrapperNode [2022-04-07 18:25:37,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 18:25:37,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 18:25:37,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 18:25:37,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 18:25:38,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:25:37" (1/1) ... [2022-04-07 18:25:38,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:25:37" (1/1) ... [2022-04-07 18:25:38,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:25:37" (1/1) ... [2022-04-07 18:25:38,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:25:37" (1/1) ... [2022-04-07 18:25:38,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:25:37" (1/1) ... [2022-04-07 18:25:38,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:25:37" (1/1) ... [2022-04-07 18:25:38,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:25:37" (1/1) ... [2022-04-07 18:25:38,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 18:25:38,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 18:25:38,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 18:25:38,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 18:25:38,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:25:37" (1/1) ... [2022-04-07 18:25:38,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 18:25:38,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:25:38,048 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 18:25:38,052 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 18:25:38,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 18:25:38,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 18:25:38,077 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 18:25:38,077 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 18:25:38,078 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 18:25:38,078 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 18:25:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 18:25:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 18:25:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 18:25:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 18:25:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-07 18:25:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 18:25:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 18:25:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 18:25:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 18:25:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 18:25:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 18:25:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 18:25:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 18:25:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 18:25:38,117 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 18:25:38,118 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 18:25:38,227 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 18:25:38,232 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 18:25:38,232 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 18:25:38,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 06:25:38 BoogieIcfgContainer [2022-04-07 18:25:38,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 18:25:38,234 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 18:25:38,234 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 18:25:38,236 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 18:25:38,238 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 06:25:38" (1/1) ... [2022-04-07 18:25:38,239 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 18:25:38,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 06:25:38 BasicIcfg [2022-04-07 18:25:38,278 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 18:25:38,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 18:25:38,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 18:25:38,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 18:25:38,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 06:25:37" (1/4) ... [2022-04-07 18:25:38,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a16ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 06:25:38, skipping insertion in model container [2022-04-07 18:25:38,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:25:37" (2/4) ... [2022-04-07 18:25:38,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a16ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 06:25:38, skipping insertion in model container [2022-04-07 18:25:38,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 06:25:38" (3/4) ... [2022-04-07 18:25:38,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a16ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 06:25:38, skipping insertion in model container [2022-04-07 18:25:38,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 06:25:38" (4/4) ... [2022-04-07 18:25:38,295 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound2.cJordan [2022-04-07 18:25:38,302 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 18:25:38,302 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 18:25:38,336 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 18:25:38,341 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 18:25:38,341 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 18:25:38,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 18:25:38,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 18:25:38,365 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:25:38,366 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:25:38,366 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:25:38,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:25:38,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1427487266, now seen corresponding path program 1 times [2022-04-07 18:25:38,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:25:38,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34925163] [2022-04-07 18:25:38,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:25:38,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:25:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:38,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 18:25:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:38,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {34#true} is VALID [2022-04-07 18:25:38,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 18:25:38,526 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 18:25:38,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 18:25:38,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {34#true} is VALID [2022-04-07 18:25:38,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 18:25:38,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 18:25:38,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 18:25:38,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {34#true} is VALID [2022-04-07 18:25:38,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} [90] L33-3-->L33-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 18:25:38,530 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} [92] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {35#false} is VALID [2022-04-07 18:25:38,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {35#false} is VALID [2022-04-07 18:25:38,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 18:25:38,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 18:25:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 18:25:38,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:25:38,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34925163] [2022-04-07 18:25:38,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34925163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:25:38,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:25:38,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 18:25:38,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479564586] [2022-04-07 18:25:38,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:25:38,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 18:25:38,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:25:38,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 18:25:38,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:38,559 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 18:25:38,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:25:38,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 18:25:38,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 18:25:38,577 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 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 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 18:25:38,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:38,759 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-07 18:25:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 18:25:38,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 18:25:38,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:25:38,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 18:25:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-07 18:25:38,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 18:25:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-07 18:25:38,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-07 18:25:38,821 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 18:25:38,832 INFO L225 Difference]: With dead ends: 32 [2022-04-07 18:25:38,832 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 18:25:38,834 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 18:25:38,838 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 18:25:38,840 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 18:25:38,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 18:25:38,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-07 18:25:38,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:25:38,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 18:25:38,866 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 18:25:38,866 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 18:25:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:38,875 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-07 18:25:38,875 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-07 18:25:38,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:38,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:38,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-07 18:25:38,878 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-07 18:25:38,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:38,882 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-07 18:25:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-07 18:25:38,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:38,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:38,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:25:38,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:25:38,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 18:25:38,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-07 18:25:38,902 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-07 18:25:38,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:25:38,902 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-07 18:25:38,903 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 18:25:38,903 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-07 18:25:38,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 18:25:38,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:25:38,905 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:25:38,906 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 18:25:38,907 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:25:38,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:25:38,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1331862890, now seen corresponding path program 1 times [2022-04-07 18:25:38,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:25:38,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705067632] [2022-04-07 18:25:38,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:25:38,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:25:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:39,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 18:25:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:39,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {161#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {159#(= ~counter~0 0)} is VALID [2022-04-07 18:25:39,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#(= ~counter~0 0)} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#(= ~counter~0 0)} is VALID [2022-04-07 18:25:39,022 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159#(= ~counter~0 0)} {154#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#(= ~counter~0 0)} is VALID [2022-04-07 18:25:39,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 18:25:39,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {159#(= ~counter~0 0)} is VALID [2022-04-07 18:25:39,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#(= ~counter~0 0)} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#(= ~counter~0 0)} is VALID [2022-04-07 18:25:39,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#(= ~counter~0 0)} {154#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#(= ~counter~0 0)} is VALID [2022-04-07 18:25:39,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#(= ~counter~0 0)} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#(= ~counter~0 0)} is VALID [2022-04-07 18:25:39,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#(= ~counter~0 0)} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {159#(= ~counter~0 0)} is VALID [2022-04-07 18:25:39,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#(= ~counter~0 0)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {160#(= |main_#t~post5| 0)} is VALID [2022-04-07 18:25:39,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {160#(= |main_#t~post5| 0)} [93] L33-1-->L33-4: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {155#false} is VALID [2022-04-07 18:25:39,029 INFO L272 TraceCheckUtils]: 8: Hoare triple {155#false} [92] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {155#false} is VALID [2022-04-07 18:25:39,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {155#false} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {155#false} is VALID [2022-04-07 18:25:39,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#false} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {155#false} is VALID [2022-04-07 18:25:39,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {155#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#false} is VALID [2022-04-07 18:25:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 18:25:39,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:25:39,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705067632] [2022-04-07 18:25:39,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705067632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:25:39,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:25:39,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 18:25:39,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068296733] [2022-04-07 18:25:39,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:25:39,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 18:25:39,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:25:39,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 18:25:39,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:39,043 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 18:25:39,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:25:39,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 18:25:39,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 18:25:39,044 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 18:25:39,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:39,267 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-07 18:25:39,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 18:25:39,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 18:25:39,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:25:39,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 18:25:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-07 18:25:39,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 18:25:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-07 18:25:39,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-07 18:25:39,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:39,314 INFO L225 Difference]: With dead ends: 28 [2022-04-07 18:25:39,314 INFO L226 Difference]: Without dead ends: 28 [2022-04-07 18:25:39,317 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 18:25:39,319 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 18:25:39,319 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 18:25:39,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-07 18:25:39,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-07 18:25:39,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:25:39,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 18:25:39,325 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 18:25:39,325 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 18:25:39,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:39,333 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-07 18:25:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-07 18:25:39,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:39,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:39,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-07 18:25:39,337 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-07 18:25:39,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:39,339 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-07 18:25:39,339 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-07 18:25:39,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:39,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:39,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:25:39,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:25:39,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 18:25:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-07 18:25:39,342 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-07 18:25:39,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:25:39,342 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-07 18:25:39,342 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 18:25:39,342 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-07 18:25:39,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 18:25:39,343 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:25:39,343 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:25:39,343 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 18:25:39,343 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:25:39,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:25:39,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1332935366, now seen corresponding path program 1 times [2022-04-07 18:25:39,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:25:39,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037449779] [2022-04-07 18:25:39,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:25:39,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:25:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:39,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 18:25:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:39,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {286#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {278#true} is VALID [2022-04-07 18:25:39,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {278#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-07 18:25:39,441 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {278#true} {278#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-07 18:25:39,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {278#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 18:25:39,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {278#true} is VALID [2022-04-07 18:25:39,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {278#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-07 18:25:39,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-07 18:25:39,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {278#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-07 18:25:39,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {278#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {283#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-07 18:25:39,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {283#(= (+ (* main_~n~0 6) 6) main_~z~0)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {283#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-07 18:25:39,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {283#(= (+ (* main_~n~0 6) 6) main_~z~0)} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {283#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-07 18:25:39,444 INFO L272 TraceCheckUtils]: 8: Hoare triple {283#(= (+ (* main_~n~0 6) 6) main_~z~0)} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {284#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 18:25:39,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#(not (= |__VERIFIER_assert_#in~cond| 0))} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {285#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 18:25:39,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {285#(not (= __VERIFIER_assert_~cond 0))} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {279#false} is VALID [2022-04-07 18:25:39,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {279#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {279#false} is VALID [2022-04-07 18:25:39,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 18:25:39,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:25:39,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037449779] [2022-04-07 18:25:39,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037449779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:25:39,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:25:39,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 18:25:39,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289523139] [2022-04-07 18:25:39,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:25:39,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 18:25:39,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:25:39,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 18:25:39,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:39,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 18:25:39,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:25:39,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 18:25:39,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 18:25:39,460 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 18:25:39,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:39,791 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 18:25:39,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 18:25:39,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 18:25:39,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:25:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 18:25:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-07 18:25:39,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 18:25:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-07 18:25:39,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-07 18:25:39,832 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 18:25:39,833 INFO L225 Difference]: With dead ends: 32 [2022-04-07 18:25:39,833 INFO L226 Difference]: Without dead ends: 32 [2022-04-07 18:25:39,833 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 18:25:39,834 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 18:25:39,834 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 18:25:39,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-07 18:25:39,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-07 18:25:39,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:25:39,840 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 18:25:39,842 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 18:25:39,842 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 18:25:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:39,846 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 18:25:39,846 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 18:25:39,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:39,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:39,847 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 18:25:39,847 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 18:25:39,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:39,848 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 18:25:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 18:25:39,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:39,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:39,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:25:39,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:25:39,849 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 18:25:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-07 18:25:39,850 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-07 18:25:39,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:25:39,851 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-07 18:25:39,851 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 18:25:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 18:25:39,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 18:25:39,851 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:25:39,851 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:25:39,851 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 18:25:39,851 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:25:39,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:25:39,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1273314772, now seen corresponding path program 1 times [2022-04-07 18:25:39,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:25:39,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133758655] [2022-04-07 18:25:39,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:25:39,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:25:39,876 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:25:39,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1910738010] [2022-04-07 18:25:39,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:25:39,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:25:39,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:25:39,884 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 18:25:39,885 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 18:25:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:39,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 18:25:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:39,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:25:40,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-07 18:25:40,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {425#true} is VALID [2022-04-07 18:25:40,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-07 18:25:40,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-07 18:25:40,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-07 18:25:40,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {445#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 18:25:40,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {445#(and (= main_~n~0 0) (= main_~y~0 1))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {445#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 18:25:40,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {445#(and (= main_~n~0 0) (= main_~y~0 1))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {445#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 18:25:40,096 INFO L272 TraceCheckUtils]: 8: Hoare triple {445#(and (= main_~n~0 0) (= main_~y~0 1))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {425#true} is VALID [2022-04-07 18:25:40,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {425#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {425#true} is VALID [2022-04-07 18:25:40,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {425#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-07 18:25:40,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {425#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {425#true} is VALID [2022-04-07 18:25:40,097 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {425#true} {445#(and (= main_~n~0 0) (= main_~y~0 1))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {445#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 18:25:40,098 INFO L272 TraceCheckUtils]: 13: Hoare triple {445#(and (= main_~n~0 0) (= main_~y~0 1))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {470#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 18:25:40,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {470#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {474#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:25:40,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {426#false} is VALID [2022-04-07 18:25:40,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {426#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {426#false} is VALID [2022-04-07 18:25:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 18:25:40,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 18:25:40,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:25:40,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133758655] [2022-04-07 18:25:40,100 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:25:40,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910738010] [2022-04-07 18:25:40,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910738010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:25:40,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:25:40,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 18:25:40,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484101387] [2022-04-07 18:25:40,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:25:40,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-07 18:25:40,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:25:40,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:25:40,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:40,122 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 18:25:40,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:25:40,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 18:25:40,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 18:25:40,123 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:25:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:40,304 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-07 18:25:40,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 18:25:40,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-07 18:25:40,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:25:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:25:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-07 18:25:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:25:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-07 18:25:40,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-07 18:25:40,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:40,373 INFO L225 Difference]: With dead ends: 48 [2022-04-07 18:25:40,373 INFO L226 Difference]: Without dead ends: 48 [2022-04-07 18:25:40,376 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 18:25:40,379 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 18:25:40,380 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 133 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 18:25:40,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-07 18:25:40,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-07 18:25:40,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:25:40,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 18:25:40,389 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 18:25:40,390 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 18:25:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:40,394 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-07 18:25:40,399 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-07 18:25:40,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:40,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:40,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-07 18:25:40,400 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-07 18:25:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:40,403 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-07 18:25:40,403 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-07 18:25:40,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:40,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:40,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:25:40,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:25:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 18:25:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-07 18:25:40,405 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-07 18:25:40,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:25:40,405 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-07 18:25:40,406 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:25:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-07 18:25:40,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 18:25:40,406 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:25:40,406 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:25:40,425 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 18:25:40,607 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:25:40,607 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:25:40,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:25:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1649805282, now seen corresponding path program 1 times [2022-04-07 18:25:40,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:25:40,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755269056] [2022-04-07 18:25:40,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:25:40,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:25:40,618 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:25:40,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [361528560] [2022-04-07 18:25:40,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:25:40,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:25:40,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:25:40,621 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 18:25:40,624 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 18:25:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:40,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 18:25:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:40,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:25:40,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {664#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-07 18:25:40,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {664#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {664#true} is VALID [2022-04-07 18:25:40,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {664#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-07 18:25:40,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {664#true} {664#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-07 18:25:40,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {664#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-07 18:25:40,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {664#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {684#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 18:25:40,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {684#(and (= main_~x~0 0) (= main_~n~0 0))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {684#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 18:25:40,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {684#(and (= main_~x~0 0) (= main_~n~0 0))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {684#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 18:25:40,782 INFO L272 TraceCheckUtils]: 8: Hoare triple {684#(and (= main_~x~0 0) (= main_~n~0 0))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {664#true} is VALID [2022-04-07 18:25:40,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {664#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {664#true} is VALID [2022-04-07 18:25:40,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {664#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-07 18:25:40,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {664#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-07 18:25:40,783 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {664#true} {684#(and (= main_~x~0 0) (= main_~n~0 0))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {684#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 18:25:40,783 INFO L272 TraceCheckUtils]: 13: Hoare triple {684#(and (= main_~x~0 0) (= main_~n~0 0))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {664#true} is VALID [2022-04-07 18:25:40,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {664#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {664#true} is VALID [2022-04-07 18:25:40,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-07 18:25:40,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {664#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#true} is VALID [2022-04-07 18:25:40,784 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {664#true} {684#(and (= main_~x~0 0) (= main_~n~0 0))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {684#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 18:25:40,784 INFO L272 TraceCheckUtils]: 18: Hoare triple {684#(and (= main_~x~0 0) (= main_~n~0 0))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {724#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 18:25:40,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {724#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {728#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:25:40,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {728#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {665#false} is VALID [2022-04-07 18:25:40,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {665#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {665#false} is VALID [2022-04-07 18:25:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 18:25:40,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 18:25:40,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:25:40,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755269056] [2022-04-07 18:25:40,786 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:25:40,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361528560] [2022-04-07 18:25:40,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361528560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:25:40,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:25:40,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 18:25:40,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110022134] [2022-04-07 18:25:40,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:25:40,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 18:25:40,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:25:40,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:25:40,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:40,799 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 18:25:40,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:25:40,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 18:25:40,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 18:25:40,799 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:25:41,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:41,055 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-07 18:25:41,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 18:25:41,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 18:25:41,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:25:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:25:41,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-07 18:25:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:25:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-07 18:25:41,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-07 18:25:41,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:41,116 INFO L225 Difference]: With dead ends: 52 [2022-04-07 18:25:41,116 INFO L226 Difference]: Without dead ends: 52 [2022-04-07 18:25:41,117 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 18:25:41,117 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 18:25:41,117 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 146 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 18:25:41,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-07 18:25:41,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-07 18:25:41,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:25:41,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 18:25:41,121 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 18:25:41,121 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 18:25:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:41,123 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-07 18:25:41,123 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-07 18:25:41,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:41,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:41,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-07 18:25:41,124 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-07 18:25:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:41,126 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-07 18:25:41,126 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-07 18:25:41,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:41,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:41,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:25:41,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:25:41,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-07 18:25:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-07 18:25:41,128 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-07 18:25:41,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:25:41,128 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-07 18:25:41,128 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:25:41,128 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-07 18:25:41,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 18:25:41,128 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:25:41,129 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:25:41,149 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 18:25:41,344 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:25:41,345 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:25:41,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:25:41,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1442767915, now seen corresponding path program 1 times [2022-04-07 18:25:41,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:25:41,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614386672] [2022-04-07 18:25:41,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:25:41,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:25:41,354 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:25:41,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [387485948] [2022-04-07 18:25:41,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:25:41,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:25:41,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:25:41,355 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 18:25:41,356 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 18:25:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:41,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 18:25:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:41,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:25:41,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {940#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-07 18:25:41,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {940#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {940#true} is VALID [2022-04-07 18:25:41,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {940#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-07 18:25:41,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {940#true} {940#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-07 18:25:41,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {940#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-07 18:25:41,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {940#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:41,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:41,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:41,520 INFO L272 TraceCheckUtils]: 8: Hoare triple {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {940#true} is VALID [2022-04-07 18:25:41,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {940#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {940#true} is VALID [2022-04-07 18:25:41,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {940#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-07 18:25:41,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {940#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-07 18:25:41,521 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {940#true} {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:41,521 INFO L272 TraceCheckUtils]: 13: Hoare triple {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {940#true} is VALID [2022-04-07 18:25:41,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {940#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {940#true} is VALID [2022-04-07 18:25:41,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {940#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-07 18:25:41,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {940#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-07 18:25:41,522 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {940#true} {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:41,522 INFO L272 TraceCheckUtils]: 18: Hoare triple {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {940#true} is VALID [2022-04-07 18:25:41,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {940#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {940#true} is VALID [2022-04-07 18:25:41,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {940#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-07 18:25:41,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {940#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#true} is VALID [2022-04-07 18:25:41,527 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {940#true} {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:41,529 INFO L272 TraceCheckUtils]: 23: Hoare triple {960#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1015#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 18:25:41,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {1015#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1019#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:25:41,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {1019#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {941#false} is VALID [2022-04-07 18:25:41,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {941#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {941#false} is VALID [2022-04-07 18:25:41,530 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 18:25:41,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 18:25:41,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:25:41,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614386672] [2022-04-07 18:25:41,530 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:25:41,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387485948] [2022-04-07 18:25:41,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387485948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:25:41,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:25:41,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 18:25:41,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569316365] [2022-04-07 18:25:41,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:25:41,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-07 18:25:41,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:25:41,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 18:25:41,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:41,546 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 18:25:41,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:25:41,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 18:25:41,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 18:25:41,547 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 18:25:41,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:41,777 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-04-07 18:25:41,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 18:25:41,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-07 18:25:41,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:25:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 18:25:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-07 18:25:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 18:25:41,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-07 18:25:41,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-07 18:25:41,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:41,830 INFO L225 Difference]: With dead ends: 60 [2022-04-07 18:25:41,830 INFO L226 Difference]: Without dead ends: 50 [2022-04-07 18:25:41,830 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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 18:25:41,831 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 18:25:41,831 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 126 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 18:25:41,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-07 18:25:41,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-07 18:25:41,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:25:41,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:25:41,834 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:25:41,834 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:25:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:41,835 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-07 18:25:41,835 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-07 18:25:41,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:41,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:41,836 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-07 18:25:41,836 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-07 18:25:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:41,840 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-07 18:25:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-07 18:25:41,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:41,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:41,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:25:41,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:25:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:25:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-07 18:25:41,842 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-07 18:25:41,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:25:41,843 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-07 18:25:41,843 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 18:25:41,843 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-07 18:25:41,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-07 18:25:41,844 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:25:41,844 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 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 18:25:41,862 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 18:25:42,063 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:25:42,063 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:25:42,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:25:42,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1251454759, now seen corresponding path program 1 times [2022-04-07 18:25:42,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:25:42,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284295186] [2022-04-07 18:25:42,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:25:42,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:25:42,073 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:25:42,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1767350522] [2022-04-07 18:25:42,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:25:42,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:25:42,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:25:42,074 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 18:25:42,075 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 18:25:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:42,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 18:25:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:42,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:25:42,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {1237#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-07 18:25:42,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {1237#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1245#(<= ~counter~0 0)} is VALID [2022-04-07 18:25:42,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {1245#(<= ~counter~0 0)} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1245#(<= ~counter~0 0)} is VALID [2022-04-07 18:25:42,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1245#(<= ~counter~0 0)} {1237#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1245#(<= ~counter~0 0)} is VALID [2022-04-07 18:25:42,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {1245#(<= ~counter~0 0)} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1245#(<= ~counter~0 0)} is VALID [2022-04-07 18:25:42,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {1245#(<= ~counter~0 0)} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {1245#(<= ~counter~0 0)} is VALID [2022-04-07 18:25:42,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {1245#(<= ~counter~0 0)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {1261#(<= ~counter~0 1)} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,305 INFO L272 TraceCheckUtils]: 8: Hoare triple {1261#(<= ~counter~0 1)} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {1261#(<= ~counter~0 1)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {1261#(<= ~counter~0 1)} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {1261#(<= ~counter~0 1)} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,316 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1261#(<= ~counter~0 1)} {1261#(<= ~counter~0 1)} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,316 INFO L272 TraceCheckUtils]: 13: Hoare triple {1261#(<= ~counter~0 1)} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {1261#(<= ~counter~0 1)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {1261#(<= ~counter~0 1)} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {1261#(<= ~counter~0 1)} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,318 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1261#(<= ~counter~0 1)} {1261#(<= ~counter~0 1)} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,318 INFO L272 TraceCheckUtils]: 18: Hoare triple {1261#(<= ~counter~0 1)} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {1261#(<= ~counter~0 1)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {1261#(<= ~counter~0 1)} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {1261#(<= ~counter~0 1)} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,319 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1261#(<= ~counter~0 1)} {1261#(<= ~counter~0 1)} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,320 INFO L272 TraceCheckUtils]: 23: Hoare triple {1261#(<= ~counter~0 1)} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {1261#(<= ~counter~0 1)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {1261#(<= ~counter~0 1)} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#(<= ~counter~0 1)} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,321 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1261#(<= ~counter~0 1)} {1261#(<= ~counter~0 1)} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,322 INFO L272 TraceCheckUtils]: 28: Hoare triple {1261#(<= ~counter~0 1)} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {1261#(<= ~counter~0 1)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {1261#(<= ~counter~0 1)} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {1261#(<= ~counter~0 1)} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,323 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1261#(<= ~counter~0 1)} {1261#(<= ~counter~0 1)} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {1261#(<= ~counter~0 1)} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,324 INFO L290 TraceCheckUtils]: 34: Hoare triple {1261#(<= ~counter~0 1)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1346#(<= |main_#t~post5| 1)} is VALID [2022-04-07 18:25:42,331 INFO L290 TraceCheckUtils]: 35: Hoare triple {1346#(<= |main_#t~post5| 1)} [93] L33-1-->L33-4: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1238#false} is VALID [2022-04-07 18:25:42,331 INFO L272 TraceCheckUtils]: 36: Hoare triple {1238#false} [92] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1238#false} is VALID [2022-04-07 18:25:42,331 INFO L290 TraceCheckUtils]: 37: Hoare triple {1238#false} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1238#false} is VALID [2022-04-07 18:25:42,331 INFO L290 TraceCheckUtils]: 38: Hoare triple {1238#false} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1238#false} is VALID [2022-04-07 18:25:42,332 INFO L290 TraceCheckUtils]: 39: Hoare triple {1238#false} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1238#false} is VALID [2022-04-07 18:25:42,332 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1238#false} {1238#false} [121] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1238#false} is VALID [2022-04-07 18:25:42,332 INFO L272 TraceCheckUtils]: 41: Hoare triple {1238#false} [95] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) (* v_main_~x~0_13 v_main_~z~0_19)) (* v_main_~x~0_13 (* v_main_~a~0_8 6)) (* v_main_~x~0_13 12)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~x~0=v_main_~x~0_13, main_~z~0=v_main_~z~0_19, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~a~0] {1238#false} is VALID [2022-04-07 18:25:42,332 INFO L290 TraceCheckUtils]: 42: Hoare triple {1238#false} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1238#false} is VALID [2022-04-07 18:25:42,332 INFO L290 TraceCheckUtils]: 43: Hoare triple {1238#false} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1238#false} is VALID [2022-04-07 18:25:42,332 INFO L290 TraceCheckUtils]: 44: Hoare triple {1238#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1238#false} is VALID [2022-04-07 18:25:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-07 18:25:42,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 18:25:42,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {1238#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1238#false} is VALID [2022-04-07 18:25:42,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {1238#false} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1238#false} is VALID [2022-04-07 18:25:42,517 INFO L290 TraceCheckUtils]: 42: Hoare triple {1238#false} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1238#false} is VALID [2022-04-07 18:25:42,517 INFO L272 TraceCheckUtils]: 41: Hoare triple {1238#false} [95] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) (* v_main_~x~0_13 v_main_~z~0_19)) (* v_main_~x~0_13 (* v_main_~a~0_8 6)) (* v_main_~x~0_13 12)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~x~0=v_main_~x~0_13, main_~z~0=v_main_~z~0_19, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~a~0] {1238#false} is VALID [2022-04-07 18:25:42,517 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1237#true} {1238#false} [121] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1238#false} is VALID [2022-04-07 18:25:42,517 INFO L290 TraceCheckUtils]: 39: Hoare triple {1237#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-07 18:25:42,518 INFO L290 TraceCheckUtils]: 38: Hoare triple {1237#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-07 18:25:42,518 INFO L290 TraceCheckUtils]: 37: Hoare triple {1237#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1237#true} is VALID [2022-04-07 18:25:42,518 INFO L272 TraceCheckUtils]: 36: Hoare triple {1238#false} [92] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1237#true} is VALID [2022-04-07 18:25:42,518 INFO L290 TraceCheckUtils]: 35: Hoare triple {1346#(<= |main_#t~post5| 1)} [93] L33-1-->L33-4: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1238#false} is VALID [2022-04-07 18:25:42,518 INFO L290 TraceCheckUtils]: 34: Hoare triple {1261#(<= ~counter~0 1)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1346#(<= |main_#t~post5| 1)} is VALID [2022-04-07 18:25:42,519 INFO L290 TraceCheckUtils]: 33: Hoare triple {1261#(<= ~counter~0 1)} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,520 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1237#true} {1261#(<= ~counter~0 1)} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {1237#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-07 18:25:42,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {1237#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-07 18:25:42,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {1237#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1237#true} is VALID [2022-04-07 18:25:42,520 INFO L272 TraceCheckUtils]: 28: Hoare triple {1261#(<= ~counter~0 1)} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {1237#true} is VALID [2022-04-07 18:25:42,521 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1237#true} {1261#(<= ~counter~0 1)} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {1237#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-07 18:25:42,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {1237#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-07 18:25:42,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {1237#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1237#true} is VALID [2022-04-07 18:25:42,521 INFO L272 TraceCheckUtils]: 23: Hoare triple {1261#(<= ~counter~0 1)} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1237#true} is VALID [2022-04-07 18:25:42,522 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1237#true} {1261#(<= ~counter~0 1)} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {1237#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-07 18:25:42,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {1237#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-07 18:25:42,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {1237#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1237#true} is VALID [2022-04-07 18:25:42,522 INFO L272 TraceCheckUtils]: 18: Hoare triple {1261#(<= ~counter~0 1)} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1237#true} is VALID [2022-04-07 18:25:42,523 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1237#true} {1261#(<= ~counter~0 1)} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {1237#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-07 18:25:42,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {1237#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-07 18:25:42,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {1237#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1237#true} is VALID [2022-04-07 18:25:42,523 INFO L272 TraceCheckUtils]: 13: Hoare triple {1261#(<= ~counter~0 1)} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1237#true} is VALID [2022-04-07 18:25:42,524 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1237#true} {1261#(<= ~counter~0 1)} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {1237#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-07 18:25:42,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {1237#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-07 18:25:42,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {1237#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1237#true} is VALID [2022-04-07 18:25:42,524 INFO L272 TraceCheckUtils]: 8: Hoare triple {1261#(<= ~counter~0 1)} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1237#true} is VALID [2022-04-07 18:25:42,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {1261#(<= ~counter~0 1)} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {1245#(<= ~counter~0 0)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1261#(<= ~counter~0 1)} is VALID [2022-04-07 18:25:42,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {1245#(<= ~counter~0 0)} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {1245#(<= ~counter~0 0)} is VALID [2022-04-07 18:25:42,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {1245#(<= ~counter~0 0)} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1245#(<= ~counter~0 0)} is VALID [2022-04-07 18:25:42,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1245#(<= ~counter~0 0)} {1237#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1245#(<= ~counter~0 0)} is VALID [2022-04-07 18:25:42,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {1245#(<= ~counter~0 0)} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1245#(<= ~counter~0 0)} is VALID [2022-04-07 18:25:42,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {1237#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1245#(<= ~counter~0 0)} is VALID [2022-04-07 18:25:42,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {1237#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1237#true} is VALID [2022-04-07 18:25:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-07 18:25:42,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:25:42,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284295186] [2022-04-07 18:25:42,533 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:25:42,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767350522] [2022-04-07 18:25:42,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767350522] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 18:25:42,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 18:25:42,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-07 18:25:42,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79635676] [2022-04-07 18:25:42,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 18:25:42,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 45 [2022-04-07 18:25:42,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:25:42,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-07 18:25:42,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:42,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 18:25:42,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:25:42,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 18:25:42,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 18:25:42,565 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-07 18:25:42,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:42,838 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-07 18:25:42,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 18:25:42,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 45 [2022-04-07 18:25:42,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:25:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-07 18:25:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-07 18:25:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-07 18:25:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-07 18:25:42,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-07 18:25:42,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:42,881 INFO L225 Difference]: With dead ends: 56 [2022-04-07 18:25:42,881 INFO L226 Difference]: Without dead ends: 56 [2022-04-07 18:25:42,882 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-07 18:25:42,882 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 18:25:42,882 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 113 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 18:25:42,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-07 18:25:42,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-07 18:25:42,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:25:42,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:25:42,885 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:25:42,885 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:25:42,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:42,887 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-07 18:25:42,887 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-07 18:25:42,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:42,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:42,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-07 18:25:42,888 INFO L87 Difference]: Start difference. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-07 18:25:42,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:42,889 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-07 18:25:42,889 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-07 18:25:42,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:42,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:42,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:25:42,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:25:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:25:42,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-07 18:25:42,891 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 45 [2022-04-07 18:25:42,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:25:42,891 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-07 18:25:42,891 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-07 18:25:42,891 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-07 18:25:42,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-07 18:25:42,892 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:25:42,892 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:25:42,908 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 18:25:43,107 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:25:43,107 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:25:43,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:25:43,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1899744846, now seen corresponding path program 1 times [2022-04-07 18:25:43,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:25:43,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805674403] [2022-04-07 18:25:43,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:25:43,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:25:43,118 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:25:43,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [74662405] [2022-04-07 18:25:43,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:25:43,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:25:43,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:25:43,119 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 18:25:43,132 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 18:25:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:43,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 18:25:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:43,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:25:43,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {1737#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {1737#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1737#true} is VALID [2022-04-07 18:25:43,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {1737#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1737#true} {1737#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {1737#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {1737#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:43,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:43,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:43,336 INFO L272 TraceCheckUtils]: 8: Hoare triple {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1737#true} is VALID [2022-04-07 18:25:43,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-07 18:25:43,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,337 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1737#true} {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:43,337 INFO L272 TraceCheckUtils]: 13: Hoare triple {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1737#true} is VALID [2022-04-07 18:25:43,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-07 18:25:43,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,338 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1737#true} {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:43,338 INFO L272 TraceCheckUtils]: 18: Hoare triple {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1737#true} is VALID [2022-04-07 18:25:43,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-07 18:25:43,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,339 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1737#true} {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:43,339 INFO L272 TraceCheckUtils]: 23: Hoare triple {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1737#true} is VALID [2022-04-07 18:25:43,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-07 18:25:43,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,339 INFO L290 TraceCheckUtils]: 26: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,340 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1737#true} {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:43,340 INFO L272 TraceCheckUtils]: 28: Hoare triple {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {1737#true} is VALID [2022-04-07 18:25:43,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-07 18:25:43,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,341 INFO L290 TraceCheckUtils]: 31: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,341 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1737#true} {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:43,341 INFO L290 TraceCheckUtils]: 33: Hoare triple {1757#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1842#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 18:25:43,342 INFO L290 TraceCheckUtils]: 34: Hoare triple {1842#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1842#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 18:25:43,342 INFO L290 TraceCheckUtils]: 35: Hoare triple {1842#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1842#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 18:25:43,342 INFO L272 TraceCheckUtils]: 36: Hoare triple {1842#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1737#true} is VALID [2022-04-07 18:25:43,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-07 18:25:43,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,342 INFO L290 TraceCheckUtils]: 39: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,343 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1737#true} {1842#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1842#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 18:25:43,343 INFO L272 TraceCheckUtils]: 41: Hoare triple {1842#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1867#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 18:25:43,344 INFO L290 TraceCheckUtils]: 42: Hoare triple {1867#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1871#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:25:43,344 INFO L290 TraceCheckUtils]: 43: Hoare triple {1871#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1738#false} is VALID [2022-04-07 18:25:43,344 INFO L290 TraceCheckUtils]: 44: Hoare triple {1738#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1738#false} is VALID [2022-04-07 18:25:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-07 18:25:43,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 18:25:43,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {1738#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1738#false} is VALID [2022-04-07 18:25:43,521 INFO L290 TraceCheckUtils]: 43: Hoare triple {1871#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1738#false} is VALID [2022-04-07 18:25:43,522 INFO L290 TraceCheckUtils]: 42: Hoare triple {1867#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1871#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:25:43,524 INFO L272 TraceCheckUtils]: 41: Hoare triple {1887#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1867#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 18:25:43,525 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1737#true} {1887#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1887#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-07 18:25:43,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,525 INFO L290 TraceCheckUtils]: 38: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,526 INFO L290 TraceCheckUtils]: 37: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-07 18:25:43,526 INFO L272 TraceCheckUtils]: 36: Hoare triple {1887#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1737#true} is VALID [2022-04-07 18:25:43,526 INFO L290 TraceCheckUtils]: 35: Hoare triple {1887#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1887#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-07 18:25:43,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {1887#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1887#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-07 18:25:43,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1887#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-07 18:25:43,535 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1737#true} {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 18:25:43,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-07 18:25:43,535 INFO L272 TraceCheckUtils]: 28: Hoare triple {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {1737#true} is VALID [2022-04-07 18:25:43,536 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1737#true} {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 18:25:43,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-07 18:25:43,536 INFO L272 TraceCheckUtils]: 23: Hoare triple {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {1737#true} is VALID [2022-04-07 18:25:43,536 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1737#true} {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 18:25:43,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-07 18:25:43,537 INFO L272 TraceCheckUtils]: 18: Hoare triple {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {1737#true} is VALID [2022-04-07 18:25:43,537 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1737#true} {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 18:25:43,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-07 18:25:43,537 INFO L272 TraceCheckUtils]: 13: Hoare triple {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {1737#true} is VALID [2022-04-07 18:25:43,538 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1737#true} {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 18:25:43,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {1737#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {1737#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {1737#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1737#true} is VALID [2022-04-07 18:25:43,538 INFO L272 TraceCheckUtils]: 8: Hoare triple {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1737#true} is VALID [2022-04-07 18:25:43,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 18:25:43,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 18:25:43,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {1737#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {1912#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-07 18:25:43,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {1737#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1737#true} {1737#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {1737#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {1737#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1737#true} is VALID [2022-04-07 18:25:43,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {1737#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1737#true} is VALID [2022-04-07 18:25:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-07 18:25:43,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:25:43,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805674403] [2022-04-07 18:25:43,540 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:25:43,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74662405] [2022-04-07 18:25:43,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74662405] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 18:25:43,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 18:25:43,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 18:25:43,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285093531] [2022-04-07 18:25:43,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 18:25:43,541 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 45 [2022-04-07 18:25:43,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:25:43,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 18:25:43,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:43,585 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 18:25:43,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:25:43,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 18:25:43,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 18:25:43,586 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 18:25:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:44,524 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-07 18:25:44,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 18:25:44,524 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 45 [2022-04-07 18:25:44,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:25:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 18:25:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-07 18:25:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 18:25:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-07 18:25:44,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-07 18:25:44,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:44,606 INFO L225 Difference]: With dead ends: 76 [2022-04-07 18:25:44,606 INFO L226 Difference]: Without dead ends: 76 [2022-04-07 18:25:44,607 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 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 18:25:44,607 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 18:25:44,607 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 128 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 18:25:44,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-07 18:25:44,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2022-04-07 18:25:44,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:25:44,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 64 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:25:44,611 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 64 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:25:44,611 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 64 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:25:44,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:44,613 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-07 18:25:44,613 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-07 18:25:44,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:44,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:44,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 76 states. [2022-04-07 18:25:44,613 INFO L87 Difference]: Start difference. First operand has 64 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 76 states. [2022-04-07 18:25:44,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:44,615 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-07 18:25:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-07 18:25:44,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:44,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:44,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:25:44,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:25:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:25:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2022-04-07 18:25:44,617 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 45 [2022-04-07 18:25:44,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:25:44,617 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2022-04-07 18:25:44,618 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 18:25:44,618 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2022-04-07 18:25:44,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-07 18:25:44,618 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:25:44,618 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:25:44,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 18:25:44,831 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:25:44,831 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:25:44,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:25:44,832 INFO L85 PathProgramCache]: Analyzing trace with hash 400776220, now seen corresponding path program 2 times [2022-04-07 18:25:44,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:25:44,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029229408] [2022-04-07 18:25:44,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:25:44,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:25:44,844 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:25:44,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [999149083] [2022-04-07 18:25:44,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 18:25:44,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:25:44,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:25:44,845 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 18:25:44,846 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 18:25:44,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 18:25:44,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 18:25:44,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 18:25:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:44,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:25:45,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {2312#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {2312#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2312#true} is VALID [2022-04-07 18:25:45,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {2312#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2312#true} {2312#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {2312#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {2312#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 18:25:45,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 18:25:45,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 18:25:45,074 INFO L272 TraceCheckUtils]: 8: Hoare triple {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2312#true} is VALID [2022-04-07 18:25:45,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-07 18:25:45,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,074 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2312#true} {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 18:25:45,074 INFO L272 TraceCheckUtils]: 13: Hoare triple {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2312#true} is VALID [2022-04-07 18:25:45,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-07 18:25:45,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,075 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2312#true} {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 18:25:45,075 INFO L272 TraceCheckUtils]: 18: Hoare triple {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2312#true} is VALID [2022-04-07 18:25:45,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-07 18:25:45,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,076 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2312#true} {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 18:25:45,076 INFO L272 TraceCheckUtils]: 23: Hoare triple {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {2312#true} is VALID [2022-04-07 18:25:45,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-07 18:25:45,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,077 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2312#true} {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 18:25:45,077 INFO L272 TraceCheckUtils]: 28: Hoare triple {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {2312#true} is VALID [2022-04-07 18:25:45,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-07 18:25:45,077 INFO L290 TraceCheckUtils]: 30: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,078 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2312#true} {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 18:25:45,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {2332#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-07 18:25:45,079 INFO L290 TraceCheckUtils]: 34: Hoare triple {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-07 18:25:45,079 INFO L290 TraceCheckUtils]: 35: Hoare triple {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-07 18:25:45,079 INFO L272 TraceCheckUtils]: 36: Hoare triple {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2312#true} is VALID [2022-04-07 18:25:45,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-07 18:25:45,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,079 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2312#true} {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-07 18:25:45,080 INFO L272 TraceCheckUtils]: 41: Hoare triple {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2312#true} is VALID [2022-04-07 18:25:45,080 INFO L290 TraceCheckUtils]: 42: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-07 18:25:45,080 INFO L290 TraceCheckUtils]: 43: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,080 INFO L290 TraceCheckUtils]: 44: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,080 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2312#true} {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-07 18:25:45,081 INFO L272 TraceCheckUtils]: 46: Hoare triple {2417#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2457#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 18:25:45,081 INFO L290 TraceCheckUtils]: 47: Hoare triple {2457#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2461#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:25:45,081 INFO L290 TraceCheckUtils]: 48: Hoare triple {2461#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2313#false} is VALID [2022-04-07 18:25:45,081 INFO L290 TraceCheckUtils]: 49: Hoare triple {2313#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2313#false} is VALID [2022-04-07 18:25:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-07 18:25:45,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 18:25:45,253 INFO L290 TraceCheckUtils]: 49: Hoare triple {2313#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2313#false} is VALID [2022-04-07 18:25:45,253 INFO L290 TraceCheckUtils]: 48: Hoare triple {2461#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2313#false} is VALID [2022-04-07 18:25:45,254 INFO L290 TraceCheckUtils]: 47: Hoare triple {2457#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2461#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:25:45,254 INFO L272 TraceCheckUtils]: 46: Hoare triple {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2457#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 18:25:45,255 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2312#true} {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 18:25:45,255 INFO L290 TraceCheckUtils]: 44: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,255 INFO L290 TraceCheckUtils]: 43: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,255 INFO L290 TraceCheckUtils]: 42: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-07 18:25:45,255 INFO L272 TraceCheckUtils]: 41: Hoare triple {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2312#true} is VALID [2022-04-07 18:25:45,256 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2312#true} {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 18:25:45,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-07 18:25:45,256 INFO L272 TraceCheckUtils]: 36: Hoare triple {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2312#true} is VALID [2022-04-07 18:25:45,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 18:25:45,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 18:25:45,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {2477#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 18:25:45,259 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2312#true} {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 18:25:45,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,260 INFO L290 TraceCheckUtils]: 29: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-07 18:25:45,260 INFO L272 TraceCheckUtils]: 28: Hoare triple {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {2312#true} is VALID [2022-04-07 18:25:45,260 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2312#true} {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 18:25:45,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-07 18:25:45,260 INFO L272 TraceCheckUtils]: 23: Hoare triple {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {2312#true} is VALID [2022-04-07 18:25:45,261 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2312#true} {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 18:25:45,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-07 18:25:45,261 INFO L272 TraceCheckUtils]: 18: Hoare triple {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2312#true} is VALID [2022-04-07 18:25:45,262 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2312#true} {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 18:25:45,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-07 18:25:45,262 INFO L272 TraceCheckUtils]: 13: Hoare triple {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2312#true} is VALID [2022-04-07 18:25:45,262 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2312#true} {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 18:25:45,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {2312#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {2312#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {2312#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2312#true} is VALID [2022-04-07 18:25:45,263 INFO L272 TraceCheckUtils]: 8: Hoare triple {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2312#true} is VALID [2022-04-07 18:25:45,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 18:25:45,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 18:25:45,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {2312#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {2517#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-07 18:25:45,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {2312#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2312#true} {2312#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {2312#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {2312#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2312#true} is VALID [2022-04-07 18:25:45,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {2312#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-07 18:25:45,264 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-07 18:25:45,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:25:45,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029229408] [2022-04-07 18:25:45,265 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:25:45,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999149083] [2022-04-07 18:25:45,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999149083] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 18:25:45,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 18:25:45,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 18:25:45,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029678964] [2022-04-07 18:25:45,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 18:25:45,265 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-07 18:25:45,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:25:45,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-07 18:25:45,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:45,307 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 18:25:45,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:25:45,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 18:25:45,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 18:25:45,307 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-07 18:25:45,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:45,927 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2022-04-07 18:25:45,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 18:25:45,928 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-07 18:25:45,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:25:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-07 18:25:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-07 18:25:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-07 18:25:45,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-07 18:25:45,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2022-04-07 18:25:45,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:45,995 INFO L225 Difference]: With dead ends: 80 [2022-04-07 18:25:45,995 INFO L226 Difference]: Without dead ends: 80 [2022-04-07 18:25:45,995 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-07 18:25:45,995 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 18:25:45,995 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 240 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 18:25:45,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-07 18:25:45,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2022-04-07 18:25:45,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:25:45,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 71 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 18:25:45,999 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 71 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 18:25:45,999 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 71 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 18:25:46,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:46,002 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2022-04-07 18:25:46,002 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-07 18:25:46,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:46,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:46,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 80 states. [2022-04-07 18:25:46,003 INFO L87 Difference]: Start difference. First operand has 71 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 80 states. [2022-04-07 18:25:46,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:46,004 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2022-04-07 18:25:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-07 18:25:46,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:46,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:46,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:25:46,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:25:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 18:25:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2022-04-07 18:25:46,006 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 50 [2022-04-07 18:25:46,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:25:46,007 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2022-04-07 18:25:46,007 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-07 18:25:46,007 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-04-07 18:25:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-07 18:25:46,007 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:25:46,007 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:25:46,024 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 18:25:46,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:25:46,224 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:25:46,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:25:46,224 INFO L85 PathProgramCache]: Analyzing trace with hash -895540175, now seen corresponding path program 3 times [2022-04-07 18:25:46,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:25:46,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113159262] [2022-04-07 18:25:46,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:25:46,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:25:46,232 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:25:46,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [901164711] [2022-04-07 18:25:46,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 18:25:46,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:25:46,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:25:46,233 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 18:25:46,234 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 18:25:46,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-07 18:25:46,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 18:25:46,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 18:25:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:46,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:25:46,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {2932#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2932#true} is VALID [2022-04-07 18:25:46,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {2932#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2932#true} {2932#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {2932#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {2932#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:46,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:46,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:46,518 INFO L272 TraceCheckUtils]: 8: Hoare triple {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2932#true} is VALID [2022-04-07 18:25:46,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-07 18:25:46,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,519 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2932#true} {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:46,519 INFO L272 TraceCheckUtils]: 13: Hoare triple {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2932#true} is VALID [2022-04-07 18:25:46,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-07 18:25:46,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,520 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2932#true} {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:46,520 INFO L272 TraceCheckUtils]: 18: Hoare triple {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2932#true} is VALID [2022-04-07 18:25:46,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-07 18:25:46,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,521 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2932#true} {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:46,521 INFO L272 TraceCheckUtils]: 23: Hoare triple {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {2932#true} is VALID [2022-04-07 18:25:46,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-07 18:25:46,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,521 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2932#true} {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:46,521 INFO L272 TraceCheckUtils]: 28: Hoare triple {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {2932#true} is VALID [2022-04-07 18:25:46,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-07 18:25:46,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,522 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2932#true} {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 18:25:46,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {2952#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-07 18:25:46,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-07 18:25:46,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-07 18:25:46,523 INFO L272 TraceCheckUtils]: 36: Hoare triple {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2932#true} is VALID [2022-04-07 18:25:46,523 INFO L290 TraceCheckUtils]: 37: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-07 18:25:46,523 INFO L290 TraceCheckUtils]: 38: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,523 INFO L290 TraceCheckUtils]: 39: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,524 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2932#true} {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-07 18:25:46,524 INFO L272 TraceCheckUtils]: 41: Hoare triple {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2932#true} is VALID [2022-04-07 18:25:46,524 INFO L290 TraceCheckUtils]: 42: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-07 18:25:46,524 INFO L290 TraceCheckUtils]: 43: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,524 INFO L290 TraceCheckUtils]: 44: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,525 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2932#true} {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-07 18:25:46,525 INFO L272 TraceCheckUtils]: 46: Hoare triple {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2932#true} is VALID [2022-04-07 18:25:46,525 INFO L290 TraceCheckUtils]: 47: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-07 18:25:46,525 INFO L290 TraceCheckUtils]: 48: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,525 INFO L290 TraceCheckUtils]: 49: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,525 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2932#true} {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-07 18:25:46,526 INFO L272 TraceCheckUtils]: 51: Hoare triple {3037#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3092#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 18:25:46,526 INFO L290 TraceCheckUtils]: 52: Hoare triple {3092#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3096#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:25:46,526 INFO L290 TraceCheckUtils]: 53: Hoare triple {3096#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2933#false} is VALID [2022-04-07 18:25:46,527 INFO L290 TraceCheckUtils]: 54: Hoare triple {2933#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2933#false} is VALID [2022-04-07 18:25:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-07 18:25:46,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 18:25:46,907 INFO L290 TraceCheckUtils]: 54: Hoare triple {2933#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2933#false} is VALID [2022-04-07 18:25:46,907 INFO L290 TraceCheckUtils]: 53: Hoare triple {3096#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2933#false} is VALID [2022-04-07 18:25:46,907 INFO L290 TraceCheckUtils]: 52: Hoare triple {3092#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3096#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:25:46,908 INFO L272 TraceCheckUtils]: 51: Hoare triple {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3092#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 18:25:46,908 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2932#true} {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 18:25:46,909 INFO L290 TraceCheckUtils]: 49: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,909 INFO L290 TraceCheckUtils]: 48: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,909 INFO L290 TraceCheckUtils]: 47: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-07 18:25:46,909 INFO L272 TraceCheckUtils]: 46: Hoare triple {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2932#true} is VALID [2022-04-07 18:25:46,916 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2932#true} {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 18:25:46,916 INFO L290 TraceCheckUtils]: 44: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,916 INFO L290 TraceCheckUtils]: 43: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-07 18:25:46,916 INFO L272 TraceCheckUtils]: 41: Hoare triple {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2932#true} is VALID [2022-04-07 18:25:46,916 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2932#true} {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 18:25:46,917 INFO L290 TraceCheckUtils]: 39: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,917 INFO L290 TraceCheckUtils]: 38: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,917 INFO L290 TraceCheckUtils]: 37: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-07 18:25:46,917 INFO L272 TraceCheckUtils]: 36: Hoare triple {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2932#true} is VALID [2022-04-07 18:25:46,917 INFO L290 TraceCheckUtils]: 35: Hoare triple {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 18:25:46,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 18:25:46,920 INFO L290 TraceCheckUtils]: 33: Hoare triple {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {3112#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-07 18:25:46,921 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2932#true} {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 18:25:46,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-07 18:25:46,921 INFO L272 TraceCheckUtils]: 28: Hoare triple {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {2932#true} is VALID [2022-04-07 18:25:46,922 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2932#true} {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 18:25:46,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,922 INFO L290 TraceCheckUtils]: 24: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-07 18:25:46,922 INFO L272 TraceCheckUtils]: 23: Hoare triple {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {2932#true} is VALID [2022-04-07 18:25:46,922 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2932#true} {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 18:25:46,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-07 18:25:46,923 INFO L272 TraceCheckUtils]: 18: Hoare triple {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {2932#true} is VALID [2022-04-07 18:25:46,923 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2932#true} {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 18:25:46,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-07 18:25:46,923 INFO L272 TraceCheckUtils]: 13: Hoare triple {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {2932#true} is VALID [2022-04-07 18:25:46,924 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2932#true} {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 18:25:46,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {2932#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {2932#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {2932#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2932#true} is VALID [2022-04-07 18:25:46,924 INFO L272 TraceCheckUtils]: 8: Hoare triple {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2932#true} is VALID [2022-04-07 18:25:46,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 18:25:46,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 18:25:46,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {2932#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {3167#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-07 18:25:46,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {2932#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2932#true} {2932#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {2932#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2932#true} is VALID [2022-04-07 18:25:46,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {2932#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2932#true} is VALID [2022-04-07 18:25:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-07 18:25:46,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:25:46,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113159262] [2022-04-07 18:25:46,926 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:25:46,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901164711] [2022-04-07 18:25:46,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901164711] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 18:25:46,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 18:25:46,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 18:25:46,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929657584] [2022-04-07 18:25:46,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 18:25:46,929 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-07 18:25:46,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:25:46,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-07 18:25:46,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:46,976 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 18:25:46,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:25:46,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 18:25:46,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-07 18:25:46,977 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-07 18:25:48,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:48,088 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2022-04-07 18:25:48,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 18:25:48,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-07 18:25:48,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:25:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-07 18:25:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-07 18:25:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-07 18:25:48,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-07 18:25:48,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-07 18:25:48,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:48,192 INFO L225 Difference]: With dead ends: 88 [2022-04-07 18:25:48,192 INFO L226 Difference]: Without dead ends: 82 [2022-04-07 18:25:48,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-07 18:25:48,193 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-07 18:25:48,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 136 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-07 18:25:48,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-07 18:25:48,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2022-04-07 18:25:48,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:25:48,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 76 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:25:48,196 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 76 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:25:48,197 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 76 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:25:48,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:48,198 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-07 18:25:48,198 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-04-07 18:25:48,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:48,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:48,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 82 states. [2022-04-07 18:25:48,199 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 82 states. [2022-04-07 18:25:48,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:48,200 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-07 18:25:48,200 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-04-07 18:25:48,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:48,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:48,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:25:48,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:25:48,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:25:48,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2022-04-07 18:25:48,201 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 55 [2022-04-07 18:25:48,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:25:48,202 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2022-04-07 18:25:48,202 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-07 18:25:48,202 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-07 18:25:48,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-07 18:25:48,202 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:25:48,202 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:25:48,218 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 18:25:48,410 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:25:48,411 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:25:48,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:25:48,411 INFO L85 PathProgramCache]: Analyzing trace with hash 999510626, now seen corresponding path program 1 times [2022-04-07 18:25:48,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:25:48,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408094066] [2022-04-07 18:25:48,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:25:48,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:25:48,420 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:25:48,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1997519400] [2022-04-07 18:25:48,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:25:48,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:25:48,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:25:48,421 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 18:25:48,422 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 18:25:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:48,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-07 18:25:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:25:48,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:25:52,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {3601#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {3601#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {3601#true} is VALID [2022-04-07 18:25:52,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {3601#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3601#true} {3601#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {3601#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {3601#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 18:25:52,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 18:25:52,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 18:25:52,460 INFO L272 TraceCheckUtils]: 8: Hoare triple {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3601#true} is VALID [2022-04-07 18:25:52,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:52,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,461 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3601#true} {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 18:25:52,461 INFO L272 TraceCheckUtils]: 13: Hoare triple {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3601#true} is VALID [2022-04-07 18:25:52,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:52,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,461 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3601#true} {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 18:25:52,462 INFO L272 TraceCheckUtils]: 18: Hoare triple {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3601#true} is VALID [2022-04-07 18:25:52,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:52,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,462 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3601#true} {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 18:25:52,462 INFO L272 TraceCheckUtils]: 23: Hoare triple {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3601#true} is VALID [2022-04-07 18:25:52,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:52,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,463 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3601#true} {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 18:25:52,463 INFO L272 TraceCheckUtils]: 28: Hoare triple {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {3601#true} is VALID [2022-04-07 18:25:52,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:52,463 INFO L290 TraceCheckUtils]: 30: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,463 INFO L290 TraceCheckUtils]: 31: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,464 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3601#true} {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-07 18:25:52,464 INFO L290 TraceCheckUtils]: 33: Hoare triple {3621#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 18:25:52,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 18:25:52,465 INFO L290 TraceCheckUtils]: 35: Hoare triple {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 18:25:52,465 INFO L272 TraceCheckUtils]: 36: Hoare triple {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3601#true} is VALID [2022-04-07 18:25:52,465 INFO L290 TraceCheckUtils]: 37: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:52,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,466 INFO L290 TraceCheckUtils]: 39: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,466 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3601#true} {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 18:25:52,466 INFO L272 TraceCheckUtils]: 41: Hoare triple {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3601#true} is VALID [2022-04-07 18:25:52,466 INFO L290 TraceCheckUtils]: 42: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:52,466 INFO L290 TraceCheckUtils]: 43: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,467 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3601#true} {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 18:25:52,467 INFO L272 TraceCheckUtils]: 46: Hoare triple {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3601#true} is VALID [2022-04-07 18:25:52,467 INFO L290 TraceCheckUtils]: 47: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:52,467 INFO L290 TraceCheckUtils]: 48: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,467 INFO L290 TraceCheckUtils]: 49: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,468 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3601#true} {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 18:25:52,468 INFO L272 TraceCheckUtils]: 51: Hoare triple {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3601#true} is VALID [2022-04-07 18:25:52,468 INFO L290 TraceCheckUtils]: 52: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:52,468 INFO L290 TraceCheckUtils]: 53: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,468 INFO L290 TraceCheckUtils]: 54: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,468 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3601#true} {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 18:25:52,468 INFO L272 TraceCheckUtils]: 56: Hoare triple {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {3601#true} is VALID [2022-04-07 18:25:52,468 INFO L290 TraceCheckUtils]: 57: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:52,468 INFO L290 TraceCheckUtils]: 58: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,468 INFO L290 TraceCheckUtils]: 59: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,469 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3601#true} {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-07 18:25:52,470 INFO L290 TraceCheckUtils]: 61: Hoare triple {3706#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} [111] L38-->L33-4: Formula: (not (<= v_main_~n~0_8 v_main_~a~0_6)) InVars {main_~n~0=v_main_~n~0_8, main_~a~0=v_main_~a~0_6} OutVars{main_~n~0=v_main_~n~0_8, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[] {3791#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-07 18:25:52,470 INFO L272 TraceCheckUtils]: 62: Hoare triple {3791#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} [92] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3601#true} is VALID [2022-04-07 18:25:52,470 INFO L290 TraceCheckUtils]: 63: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:52,470 INFO L290 TraceCheckUtils]: 64: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,470 INFO L290 TraceCheckUtils]: 65: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,470 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3601#true} {3791#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} [121] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3791#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-07 18:25:52,471 INFO L272 TraceCheckUtils]: 67: Hoare triple {3791#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} [95] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) (* v_main_~x~0_13 v_main_~z~0_19)) (* v_main_~x~0_13 (* v_main_~a~0_8 6)) (* v_main_~x~0_13 12)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~x~0=v_main_~x~0_13, main_~z~0=v_main_~z~0_19, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~a~0] {3810#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 18:25:52,471 INFO L290 TraceCheckUtils]: 68: Hoare triple {3810#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3814#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:25:52,472 INFO L290 TraceCheckUtils]: 69: Hoare triple {3814#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3602#false} is VALID [2022-04-07 18:25:52,472 INFO L290 TraceCheckUtils]: 70: Hoare triple {3602#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3602#false} is VALID [2022-04-07 18:25:52,472 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-07 18:25:52,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 18:25:52,991 INFO L290 TraceCheckUtils]: 70: Hoare triple {3602#false} [103] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3602#false} is VALID [2022-04-07 18:25:52,991 INFO L290 TraceCheckUtils]: 69: Hoare triple {3814#(<= 1 __VERIFIER_assert_~cond)} [99] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3602#false} is VALID [2022-04-07 18:25:52,992 INFO L290 TraceCheckUtils]: 68: Hoare triple {3810#(<= 1 |__VERIFIER_assert_#in~cond|)} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3814#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:25:52,992 INFO L272 TraceCheckUtils]: 67: Hoare triple {3830#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} [95] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) (* v_main_~x~0_13 v_main_~z~0_19)) (* v_main_~x~0_13 (* v_main_~a~0_8 6)) (* v_main_~x~0_13 12)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~x~0=v_main_~x~0_13, main_~z~0=v_main_~z~0_19, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~a~0] {3810#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 18:25:52,993 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3601#true} {3830#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} [121] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3830#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-07 18:25:52,993 INFO L290 TraceCheckUtils]: 65: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,993 INFO L290 TraceCheckUtils]: 64: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,993 INFO L290 TraceCheckUtils]: 63: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:52,993 INFO L272 TraceCheckUtils]: 62: Hoare triple {3830#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} [92] L33-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_18 (+ (* v_main_~n~0_14 6) 6)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~z~0=v_main_~z~0_18, main_~n~0=v_main_~n~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3601#true} is VALID [2022-04-07 18:25:52,993 INFO L290 TraceCheckUtils]: 61: Hoare triple {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [111] L38-->L33-4: Formula: (not (<= v_main_~n~0_8 v_main_~a~0_6)) InVars {main_~n~0=v_main_~n~0_8, main_~a~0=v_main_~a~0_6} OutVars{main_~n~0=v_main_~n~0_8, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[] {3830#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-07 18:25:52,994 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3601#true} {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 18:25:52,994 INFO L290 TraceCheckUtils]: 59: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,994 INFO L290 TraceCheckUtils]: 58: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,994 INFO L290 TraceCheckUtils]: 57: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:52,994 INFO L272 TraceCheckUtils]: 56: Hoare triple {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {3601#true} is VALID [2022-04-07 18:25:52,994 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3601#true} {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 18:25:52,994 INFO L290 TraceCheckUtils]: 54: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,995 INFO L290 TraceCheckUtils]: 53: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,995 INFO L290 TraceCheckUtils]: 52: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:52,995 INFO L272 TraceCheckUtils]: 51: Hoare triple {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3601#true} is VALID [2022-04-07 18:25:52,995 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3601#true} {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 18:25:52,995 INFO L290 TraceCheckUtils]: 49: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,995 INFO L290 TraceCheckUtils]: 48: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,995 INFO L290 TraceCheckUtils]: 47: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:52,995 INFO L272 TraceCheckUtils]: 46: Hoare triple {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3601#true} is VALID [2022-04-07 18:25:52,996 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3601#true} {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 18:25:52,996 INFO L290 TraceCheckUtils]: 44: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,996 INFO L290 TraceCheckUtils]: 43: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,996 INFO L290 TraceCheckUtils]: 42: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:52,996 INFO L272 TraceCheckUtils]: 41: Hoare triple {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3601#true} is VALID [2022-04-07 18:25:52,996 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3601#true} {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 18:25:52,997 INFO L290 TraceCheckUtils]: 39: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,997 INFO L290 TraceCheckUtils]: 38: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:52,997 INFO L290 TraceCheckUtils]: 37: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:52,997 INFO L272 TraceCheckUtils]: 36: Hoare triple {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3601#true} is VALID [2022-04-07 18:25:52,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 18:25:52,997 INFO L290 TraceCheckUtils]: 34: Hoare triple {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 18:25:53,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [112] L38-->L33-3: Formula: (and (<= v_main_~n~0_10 v_main_~a~0_7) (= (+ v_main_~y~0_12 v_main_~z~0_14) v_main_~y~0_11) (= v_main_~n~0_9 (+ v_main_~n~0_10 1)) (= v_main_~z~0_13 (+ v_main_~z~0_14 6)) (= v_main_~x~0_9 (+ v_main_~x~0_10 v_main_~y~0_12))) InVars {main_~y~0=v_main_~y~0_12, main_~n~0=v_main_~n~0_10, main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_14, main_~a~0=v_main_~a~0_7} OutVars{main_~y~0=v_main_~y~0_11, main_~n~0=v_main_~n~0_9, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_13, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {3849#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-07 18:25:53,000 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3601#true} {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [120] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 18:25:53,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:53,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:53,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:53,001 INFO L272 TraceCheckUtils]: 28: Hoare triple {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [110] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_17 (- 6)) (* v_main_~y~0_15 (- 12)) (* v_main_~z~0_17 v_main_~z~0_17) 12) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~y~0=v_main_~y~0_15, main_~z~0=v_main_~z~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {3601#true} is VALID [2022-04-07 18:25:53,001 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3601#true} {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [119] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 18:25:53,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:53,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:53,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:53,001 INFO L272 TraceCheckUtils]: 23: Hoare triple {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [108] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* v_main_~y~0_14 (- 12)) (* v_main_~y~0_14 v_main_~z~0_16) (* v_main_~x~0_12 (- 18)) (- 6) (* v_main_~z~0_16 2)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {3601#true} is VALID [2022-04-07 18:25:53,002 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3601#true} {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [118] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 18:25:53,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:53,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:53,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:53,002 INFO L272 TraceCheckUtils]: 18: Hoare triple {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [106] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x~0_11 (* v_main_~n~0_13 (* v_main_~n~0_13 v_main_~n~0_13))) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_11, main_~n~0=v_main_~n~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~n~0] {3601#true} is VALID [2022-04-07 18:25:53,003 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3601#true} {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [117] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 18:25:53,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:53,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:53,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:53,003 INFO L272 TraceCheckUtils]: 13: Hoare triple {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [101] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= v_main_~y~0_13 (let ((.cse0 (* v_main_~n~0_12 3))) (+ (* v_main_~n~0_12 .cse0) .cse0 1))) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~n~0=v_main_~n~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {3601#true} is VALID [2022-04-07 18:25:53,003 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3601#true} {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [116] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 18:25:53,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {3601#true} [105] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:53,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {3601#true} [100] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:53,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {3601#true} [96] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3601#true} is VALID [2022-04-07 18:25:53,004 INFO L272 TraceCheckUtils]: 8: Hoare triple {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [97] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~z~0_15 (+ 6 (* v_main_~n~0_11 6))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_15, main_~n~0=v_main_~n~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3601#true} is VALID [2022-04-07 18:25:53,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [94] L33-1-->L34: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 18:25:53,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} [91] L33-3-->L33-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 18:25:53,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {3601#true} [88] mainENTRY-->L33-3: Formula: (and (= v_main_~x~0_4 0) (= v_main_~z~0_7 6) (= v_main_~y~0_5 1) (= v_main_~a~0_3 (let ((.cse0 (mod |v_main_#t~nondet4_2| 65536))) (ite (<= .cse0 32767) .cse0 (+ (- 65536) .cse0)))) (= v_main_~n~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_5, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_7, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0, main_~a~0] {3934#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-07 18:25:53,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {3601#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:53,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3601#true} {3601#true} [115] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:53,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {3601#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:53,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {3601#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {3601#true} is VALID [2022-04-07 18:25:53,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {3601#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3601#true} is VALID [2022-04-07 18:25:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-07 18:25:53,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:25:53,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408094066] [2022-04-07 18:25:53,006 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:25:53,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997519400] [2022-04-07 18:25:53,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997519400] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 18:25:53,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 18:25:53,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-07 18:25:53,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459917035] [2022-04-07 18:25:53,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 18:25:53,008 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-07 18:25:53,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:25:53,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-07 18:25:53,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:53,095 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 18:25:53,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:25:53,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 18:25:53,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-07 18:25:53,096 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-07 18:25:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:53,940 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2022-04-07 18:25:53,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 18:25:53,940 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-07 18:25:53,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:25:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-07 18:25:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-07 18:25:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-07 18:25:53,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-07 18:25:53,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2022-04-07 18:25:54,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:25:54,056 INFO L225 Difference]: With dead ends: 107 [2022-04-07 18:25:54,056 INFO L226 Difference]: Without dead ends: 107 [2022-04-07 18:25:54,056 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-07 18:25:54,056 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 12 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 18:25:54,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 168 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 18:25:54,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-07 18:25:54,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 97. [2022-04-07 18:25:54,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:25:54,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 97 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 18:25:54,060 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 97 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 18:25:54,060 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 97 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 18:25:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:54,062 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2022-04-07 18:25:54,062 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2022-04-07 18:25:54,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:54,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:54,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 107 states. [2022-04-07 18:25:54,068 INFO L87 Difference]: Start difference. First operand has 97 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 107 states. [2022-04-07 18:25:54,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:25:54,070 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2022-04-07 18:25:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2022-04-07 18:25:54,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:25:54,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:25:54,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:25:54,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:25:54,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-07 18:25:54,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2022-04-07 18:25:54,072 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 71 [2022-04-07 18:25:54,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:25:54,072 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2022-04-07 18:25:54,072 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-07 18:25:54,072 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2022-04-07 18:25:54,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-07 18:25:54,073 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:25:54,073 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:25:54,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-07 18:25:54,273 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,SelfDestructingSolverStorable10 [2022-04-07 18:25:54,273 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:25:54,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:25:54,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1401496737, now seen corresponding path program 2 times [2022-04-07 18:25:54,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:25:54,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892834855] [2022-04-07 18:25:54,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:25:54,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:25:54,282 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:25:54,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1867473789] [2022-04-07 18:25:54,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 18:25:54,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:25:54,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:25:54,283 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 18:25:54,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-07 18:25:54,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 18:25:54,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-07 18:25:54,327 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 18:25:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 18:25:54,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 18:25:54,380 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 18:25:54,381 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 18:25:54,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-07 18:25:54,582 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:25:54,585 INFO L719 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:25:54,587 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 18:25:54,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 06:25:54 BasicIcfg [2022-04-07 18:25:54,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 18:25:54,617 INFO L158 Benchmark]: Toolchain (without parser) took 16790.37ms. Allocated memory was 181.4MB in the beginning and 262.1MB in the end (delta: 80.7MB). Free memory was 132.1MB in the beginning and 129.6MB in the end (delta: 2.5MB). Peak memory consumption was 83.2MB. Max. memory is 8.0GB. [2022-04-07 18:25:54,617 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory was 148.8MB in the beginning and 148.7MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 18:25:54,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.35ms. Allocated memory is still 181.4MB. Free memory was 131.8MB in the beginning and 156.0MB in the end (delta: -24.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 18:25:54,617 INFO L158 Benchmark]: Boogie Preprocessor took 31.60ms. Allocated memory is still 181.4MB. Free memory was 156.0MB in the beginning and 154.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 18:25:54,617 INFO L158 Benchmark]: RCFGBuilder took 208.49ms. Allocated memory is still 181.4MB. Free memory was 154.1MB in the beginning and 142.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 18:25:54,617 INFO L158 Benchmark]: IcfgTransformer took 44.25ms. Allocated memory is still 181.4MB. Free memory was 142.6MB in the beginning and 140.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 18:25:54,617 INFO L158 Benchmark]: TraceAbstraction took 16336.76ms. Allocated memory was 181.4MB in the beginning and 262.1MB in the end (delta: 80.7MB). Free memory was 140.5MB in the beginning and 129.6MB in the end (delta: 10.9MB). Peak memory consumption was 93.0MB. Max. memory is 8.0GB. [2022-04-07 18:25:54,618 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.12ms. Allocated memory is still 181.4MB. Free memory was 148.8MB in the beginning and 148.7MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 164.35ms. Allocated memory is still 181.4MB. Free memory was 131.8MB in the beginning and 156.0MB in the end (delta: -24.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.60ms. Allocated memory is still 181.4MB. Free memory was 156.0MB in the beginning and 154.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 208.49ms. Allocated memory is still 181.4MB. Free memory was 154.1MB in the beginning and 142.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 44.25ms. Allocated memory is still 181.4MB. Free memory was 142.6MB in the beginning and 140.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 16336.76ms. Allocated memory was 181.4MB in the beginning and 262.1MB in the end (delta: 80.7MB). Free memory was 140.5MB in the beginning and 129.6MB in the end (delta: 10.9MB). Peak memory consumption was 93.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=5, counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [\old(counter)=0, a=2, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=2, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=2, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=2, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=2, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=2, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=2, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=2, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=2, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=2, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=2, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=2, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=2, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=2, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=2, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [\old(counter)=0, a=2, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND FALSE !(counter++<2) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=2, counter=3, n=2, x=8, y=19, z=18] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 12, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 141 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 1355 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 875 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1066 IncrementalHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 480 mSDtfsCounter, 1066 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 626 GetRequests, 556 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=11, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 52 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 440 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 2945 SizeOfPredicates, 12 NumberOfNonLiveVariables, 981 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 1252/1302 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-07 18:25:54,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...