/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/ps4-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 19:57:54,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 19:57:54,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 19:57:54,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 19:57:54,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 19:57:54,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 19:57:54,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 19:57:54,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 19:57:54,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 19:57:54,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 19:57:54,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 19:57:54,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 19:57:54,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 19:57:54,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 19:57:54,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 19:57:54,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 19:57:54,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 19:57:54,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 19:57:54,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 19:57:54,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 19:57:54,491 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 19:57:54,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 19:57:54,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 19:57:54,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 19:57:54,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 19:57:54,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 19:57:54,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 19:57:54,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 19:57:54,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 19:57:54,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 19:57:54,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 19:57:54,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 19:57:54,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 19:57:54,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 19:57:54,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 19:57:54,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 19:57:54,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 19:57:54,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 19:57:54,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 19:57:54,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 19:57:54,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 19:57:54,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 19:57:54,507 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 19:57:54,516 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 19:57:54,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 19:57:54,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 19:57:54,518 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 19:57:54,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 19:57:54,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 19:57:54,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 19:57:54,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 19:57:54,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 19:57:54,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 19:57:54,519 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 19:57:54,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 19:57:54,519 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 19:57:54,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 19:57:54,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 19:57:54,519 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 19:57:54,519 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 19:57:54,519 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 19:57:54,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 19:57:54,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 19:57:54,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 19:57:54,520 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 19:57:54,520 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 19:57:54,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 19:57:54,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 19:57:54,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 19:57:54,727 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 19:57:54,728 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 19:57:54,728 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound10.c [2022-04-27 19:57:54,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a583922/5715b273dfe84c50a1c143e3bc823bbe/FLAGe65f6ffa7 [2022-04-27 19:57:55,061 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 19:57:55,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound10.c [2022-04-27 19:57:55,066 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a583922/5715b273dfe84c50a1c143e3bc823bbe/FLAGe65f6ffa7 [2022-04-27 19:57:55,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a583922/5715b273dfe84c50a1c143e3bc823bbe [2022-04-27 19:57:55,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 19:57:55,492 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 19:57:55,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 19:57:55,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 19:57:55,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 19:57:55,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 07:57:55" (1/1) ... [2022-04-27 19:57:55,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64843fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:57:55, skipping insertion in model container [2022-04-27 19:57:55,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 07:57:55" (1/1) ... [2022-04-27 19:57:55,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 19:57:55,512 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 19:57:55,632 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/ps4-ll_unwindbound10.c[458,471] [2022-04-27 19:57:55,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 19:57:55,672 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 19:57:55,680 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/ps4-ll_unwindbound10.c[458,471] [2022-04-27 19:57:55,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 19:57:55,691 INFO L208 MainTranslator]: Completed translation [2022-04-27 19:57:55,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:57:55 WrapperNode [2022-04-27 19:57:55,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 19:57:55,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 19:57:55,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 19:57:55,693 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 19:57:55,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:57:55" (1/1) ... [2022-04-27 19:57:55,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:57:55" (1/1) ... [2022-04-27 19:57:55,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:57:55" (1/1) ... [2022-04-27 19:57:55,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:57:55" (1/1) ... [2022-04-27 19:57:55,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:57:55" (1/1) ... [2022-04-27 19:57:55,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:57:55" (1/1) ... [2022-04-27 19:57:55,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:57:55" (1/1) ... [2022-04-27 19:57:55,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 19:57:55,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 19:57:55,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 19:57:55,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 19:57:55,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:57:55" (1/1) ... [2022-04-27 19:57:55,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 19:57:55,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:57:55,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 19:57:55,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 19:57:55,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 19:57:55,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 19:57:55,762 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 19:57:55,762 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 19:57:55,763 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 19:57:55,763 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 19:57:55,763 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 19:57:55,763 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 19:57:55,763 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 19:57:55,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 19:57:55,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 19:57:55,763 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 19:57:55,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 19:57:55,763 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 19:57:55,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 19:57:55,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 19:57:55,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 19:57:55,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 19:57:55,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 19:57:55,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 19:57:55,809 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 19:57:55,810 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 19:57:55,944 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 19:57:55,962 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 19:57:55,962 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 19:57:55,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 07:57:55 BoogieIcfgContainer [2022-04-27 19:57:55,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 19:57:55,964 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 19:57:55,964 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 19:57:55,964 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 19:57:55,966 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 07:57:55" (1/1) ... [2022-04-27 19:57:55,968 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 19:57:55,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 07:57:55 BasicIcfg [2022-04-27 19:57:55,983 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 19:57:55,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 19:57:55,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 19:57:56,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 19:57:56,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 07:57:55" (1/4) ... [2022-04-27 19:57:56,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9ebe63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 07:57:56, skipping insertion in model container [2022-04-27 19:57:56,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 07:57:55" (2/4) ... [2022-04-27 19:57:56,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9ebe63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 07:57:56, skipping insertion in model container [2022-04-27 19:57:56,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 07:57:55" (3/4) ... [2022-04-27 19:57:56,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9ebe63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 07:57:56, skipping insertion in model container [2022-04-27 19:57:56,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 07:57:55" (4/4) ... [2022-04-27 19:57:56,002 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound10.cJordan [2022-04-27 19:57:56,011 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 19:57:56,011 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 19:57:56,048 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 19:57:56,054 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@319e1967, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@edafd39 [2022-04-27 19:57:56,054 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 19:57:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:57:56,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 19:57:56,068 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:57:56,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:57:56,069 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:57:56,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:57:56,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1984627219, now seen corresponding path program 1 times [2022-04-27 19:57:56,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:57:56,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629748053] [2022-04-27 19:57:56,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:57:56,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:57:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:57:56,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 19:57:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:57:56,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {26#true} is VALID [2022-04-27 19:57:56,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 19:57:56,234 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 19:57:56,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 19:57:56,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {26#true} is VALID [2022-04-27 19:57:56,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 19:57:56,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 19:57:56,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 19:57:56,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {26#true} is VALID [2022-04-27 19:57:56,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} [66] L27-3-->L27-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 19:57:56,240 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {27#false} is VALID [2022-04-27 19:57:56,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {27#false} is VALID [2022-04-27 19:57:56,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 19:57:56,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 19:57:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 19:57:56,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:57:56,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629748053] [2022-04-27 19:57:56,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629748053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 19:57:56,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 19:57:56,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 19:57:56,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174960610] [2022-04-27 19:57:56,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:57:56,248 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-27 19:57:56,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:57:56,250 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-27 19:57:56,266 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-27 19:57:56,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 19:57:56,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:57:56,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 19:57:56,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 19:57:56,285 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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-27 19:57:56,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:57:56,382 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 19:57:56,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 19:57:56,383 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-27 19:57:56,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:57:56,384 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-27 19:57:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-04-27 19:57:56,390 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-27 19:57:56,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-04-27 19:57:56,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 30 transitions. [2022-04-27 19:57:56,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:57:56,439 INFO L225 Difference]: With dead ends: 24 [2022-04-27 19:57:56,440 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 19:57:56,441 INFO L412 NwaCegarLoop]: 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-27 19:57:56,444 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 19:57:56,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 19:57:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 19:57:56,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-27 19:57:56,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:57:56,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:57:56,468 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:57:56,468 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:57:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:57:56,475 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-27 19:57:56,475 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 19:57:56,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:57:56,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:57:56,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-27 19:57:56,476 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-27 19:57:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:57:56,480 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-27 19:57:56,480 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 19:57:56,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:57:56,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:57:56,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:57:56,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:57:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:57:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-27 19:57:56,483 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2022-04-27 19:57:56,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:57:56,484 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-27 19:57:56,484 INFO L496 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-27 19:57:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-27 19:57:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 19:57:56,485 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:57:56,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:57:56,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 19:57:56,488 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:57:56,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:57:56,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1423332195, now seen corresponding path program 1 times [2022-04-27 19:57:56,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:57:56,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350356645] [2022-04-27 19:57:56,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:57:56,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:57:56,513 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:57:56,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [377113758] [2022-04-27 19:57:56,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:57:56,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:57:56,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:57:56,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:57:56,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 19:57:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:57:56,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 19:57:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:57:56,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:57:56,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {114#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {114#true} is VALID [2022-04-27 19:57:56,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {114#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {122#(<= ~counter~0 0)} is VALID [2022-04-27 19:57:56,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {122#(<= ~counter~0 0)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {122#(<= ~counter~0 0)} is VALID [2022-04-27 19:57:56,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122#(<= ~counter~0 0)} {114#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {122#(<= ~counter~0 0)} is VALID [2022-04-27 19:57:56,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {122#(<= ~counter~0 0)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {122#(<= ~counter~0 0)} is VALID [2022-04-27 19:57:56,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {122#(<= ~counter~0 0)} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {122#(<= ~counter~0 0)} is VALID [2022-04-27 19:57:56,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {122#(<= ~counter~0 0)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {138#(<= |main_#t~post5| 0)} is VALID [2022-04-27 19:57:56,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {138#(<= |main_#t~post5| 0)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 10)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {115#false} is VALID [2022-04-27 19:57:56,694 INFO L272 TraceCheckUtils]: 8: Hoare triple {115#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {115#false} is VALID [2022-04-27 19:57:56,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {115#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {115#false} is VALID [2022-04-27 19:57:56,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {115#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {115#false} is VALID [2022-04-27 19:57:56,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {115#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#false} is VALID [2022-04-27 19:57:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 19:57:56,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 19:57:56,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:57:56,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350356645] [2022-04-27 19:57:56,696 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:57:56,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377113758] [2022-04-27 19:57:56,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377113758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 19:57:56,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 19:57:56,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 19:57:56,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830645515] [2022-04-27 19:57:56,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:57:56,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-27 19:57:56,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:57:56,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 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-27 19:57:56,711 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-27 19:57:56,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 19:57:56,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:57:56,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 19:57:56,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 19:57:56,712 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 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-27 19:57:56,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:57:56,774 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 19:57:56,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 19:57:56,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-27 19:57:56,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:57:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 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-27 19:57:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-04-27 19:57:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 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-27 19:57:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-04-27 19:57:56,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2022-04-27 19:57:56,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:57:56,804 INFO L225 Difference]: With dead ends: 20 [2022-04-27 19:57:56,804 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 19:57:56,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 19:57:56,806 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 19:57:56,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 19:57:56,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 19:57:56,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 19:57:56,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:57:56,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:57:56,812 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:57:56,813 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:57:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:57:56,815 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 19:57:56,815 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 19:57:56,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:57:56,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:57:56,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 19:57:56,816 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 19:57:56,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:57:56,818 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 19:57:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 19:57:56,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:57:56,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:57:56,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:57:56,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:57:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:57:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-27 19:57:56,820 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-27 19:57:56,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:57:56,820 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-27 19:57:56,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-27 19:57:56,820 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 19:57:56,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 19:57:56,820 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:57:56,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:57:56,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 19:57:57,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:57:57,031 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:57:57,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:57:57,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1424404671, now seen corresponding path program 1 times [2022-04-27 19:57:57,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:57:57,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929117276] [2022-04-27 19:57:57,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:57:57,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:57:57,054 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:57:57,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [898554631] [2022-04-27 19:57:57,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:57:57,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:57:57,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:57:57,061 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:57:57,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 19:57:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:57:57,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 19:57:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:57:57,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:57:57,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {233#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#true} is VALID [2022-04-27 19:57:57,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {233#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {233#true} is VALID [2022-04-27 19:57:57,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {233#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#true} is VALID [2022-04-27 19:57:57,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {233#true} {233#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#true} is VALID [2022-04-27 19:57:57,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {233#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#true} is VALID [2022-04-27 19:57:57,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {233#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {253#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:57:57,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {253#(and (= main_~x~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {253#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:57:57,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {253#(and (= main_~x~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {253#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:57:57,188 INFO L272 TraceCheckUtils]: 8: Hoare triple {253#(and (= main_~x~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {263#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:57:57,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {267#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:57:57,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {267#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {234#false} is VALID [2022-04-27 19:57:57,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {234#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#false} is VALID [2022-04-27 19:57:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 19:57:57,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 19:57:57,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:57:57,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929117276] [2022-04-27 19:57:57,190 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:57:57,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898554631] [2022-04-27 19:57:57,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898554631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 19:57:57,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 19:57:57,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 19:57:57,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996327755] [2022-04-27 19:57:57,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:57:57,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 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-27 19:57:57,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:57:57,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 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-27 19:57:57,199 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-27 19:57:57,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 19:57:57,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:57:57,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 19:57:57,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 19:57:57,200 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 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-27 19:57:57,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:57:57,374 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-27 19:57:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 19:57:57,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 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-27 19:57:57,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:57:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 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-27 19:57:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-04-27 19:57:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 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-27 19:57:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-04-27 19:57:57,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2022-04-27 19:57:57,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:57:57,404 INFO L225 Difference]: With dead ends: 28 [2022-04-27 19:57:57,405 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 19:57:57,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 19:57:57,405 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 19:57:57,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 19:57:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 19:57:57,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 19:57:57,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:57:57,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 19:57:57,408 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 19:57:57,408 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 19:57:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:57:57,410 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 19:57:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 19:57:57,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:57:57,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:57:57,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 19:57:57,410 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 19:57:57,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:57:57,411 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 19:57:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 19:57:57,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:57:57,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:57:57,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:57:57,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:57:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 19:57:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-27 19:57:57,413 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2022-04-27 19:57:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:57:57,413 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-27 19:57:57,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 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-27 19:57:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 19:57:57,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 19:57:57,414 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:57:57,414 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:57:57,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 19:57:57,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 19:57:57,628 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:57:57,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:57:57,628 INFO L85 PathProgramCache]: Analyzing trace with hash -381498108, now seen corresponding path program 1 times [2022-04-27 19:57:57,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:57:57,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400667438] [2022-04-27 19:57:57,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:57:57,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:57:57,640 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:57:57,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2031394553] [2022-04-27 19:57:57,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:57:57,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:57:57,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:57:57,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:57:57,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 19:57:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:57:57,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 19:57:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:57:57,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:57:57,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {381#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 19:57:57,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {381#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {389#(<= ~counter~0 0)} is VALID [2022-04-27 19:57:57,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {389#(<= ~counter~0 0)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#(<= ~counter~0 0)} is VALID [2022-04-27 19:57:57,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {389#(<= ~counter~0 0)} {381#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#(<= ~counter~0 0)} is VALID [2022-04-27 19:57:57,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {389#(<= ~counter~0 0)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#(<= ~counter~0 0)} is VALID [2022-04-27 19:57:57,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {389#(<= ~counter~0 0)} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {389#(<= ~counter~0 0)} is VALID [2022-04-27 19:57:57,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {389#(<= ~counter~0 0)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:57:57,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {405#(<= ~counter~0 1)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:57:57,810 INFO L272 TraceCheckUtils]: 8: Hoare triple {405#(<= ~counter~0 1)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:57:57,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {405#(<= ~counter~0 1)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:57:57,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {405#(<= ~counter~0 1)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:57:57,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {405#(<= ~counter~0 1)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:57:57,811 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {405#(<= ~counter~0 1)} {405#(<= ~counter~0 1)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:57:57,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {405#(<= ~counter~0 1)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {405#(<= ~counter~0 1)} is VALID [2022-04-27 19:57:57,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {405#(<= ~counter~0 1)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {430#(<= |main_#t~post5| 1)} is VALID [2022-04-27 19:57:57,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {430#(<= |main_#t~post5| 1)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 10)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {382#false} is VALID [2022-04-27 19:57:57,812 INFO L272 TraceCheckUtils]: 16: Hoare triple {382#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {382#false} is VALID [2022-04-27 19:57:57,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {382#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {382#false} is VALID [2022-04-27 19:57:57,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {382#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {382#false} is VALID [2022-04-27 19:57:57,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {382#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {382#false} is VALID [2022-04-27 19:57:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 19:57:57,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:57:57,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {382#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {382#false} is VALID [2022-04-27 19:57:57,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {382#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {382#false} is VALID [2022-04-27 19:57:57,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {382#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {382#false} is VALID [2022-04-27 19:57:57,966 INFO L272 TraceCheckUtils]: 16: Hoare triple {382#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {382#false} is VALID [2022-04-27 19:57:57,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {458#(< |main_#t~post5| 10)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 10)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {382#false} is VALID [2022-04-27 19:57:57,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {462#(< ~counter~0 10)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {458#(< |main_#t~post5| 10)} is VALID [2022-04-27 19:57:57,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {462#(< ~counter~0 10)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {462#(< ~counter~0 10)} is VALID [2022-04-27 19:57:57,967 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {381#true} {462#(< ~counter~0 10)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {462#(< ~counter~0 10)} is VALID [2022-04-27 19:57:57,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {381#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 19:57:57,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {381#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 19:57:57,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {381#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {381#true} is VALID [2022-04-27 19:57:57,968 INFO L272 TraceCheckUtils]: 8: Hoare triple {462#(< ~counter~0 10)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {381#true} is VALID [2022-04-27 19:57:57,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {462#(< ~counter~0 10)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {462#(< ~counter~0 10)} is VALID [2022-04-27 19:57:57,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {487#(< ~counter~0 9)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {462#(< ~counter~0 10)} is VALID [2022-04-27 19:57:57,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {487#(< ~counter~0 9)} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {487#(< ~counter~0 9)} is VALID [2022-04-27 19:57:57,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {487#(< ~counter~0 9)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#(< ~counter~0 9)} is VALID [2022-04-27 19:57:57,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {487#(< ~counter~0 9)} {381#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#(< ~counter~0 9)} is VALID [2022-04-27 19:57:57,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#(< ~counter~0 9)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#(< ~counter~0 9)} is VALID [2022-04-27 19:57:57,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {381#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {487#(< ~counter~0 9)} is VALID [2022-04-27 19:57:57,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {381#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#true} is VALID [2022-04-27 19:57:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 19:57:57,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:57:57,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400667438] [2022-04-27 19:57:57,975 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:57:57,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031394553] [2022-04-27 19:57:57,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031394553] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 19:57:57,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 19:57:57,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 19:57:57,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599785851] [2022-04-27 19:57:57,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 19:57:57,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-27 19:57:57,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:57:57,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 19:57:58,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:57:58,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 19:57:58,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:57:58,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 19:57:58,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 19:57:58,003 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 19:57:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:57:58,185 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 19:57:58,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 19:57:58,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-27 19:57:58,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:57:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 19:57:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-27 19:57:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 19:57:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-27 19:57:58,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-27 19:57:58,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:57:58,247 INFO L225 Difference]: With dead ends: 52 [2022-04-27 19:57:58,247 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 19:57:58,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 19:57:58,248 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 30 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 19:57:58,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 86 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 19:57:58,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 19:57:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-27 19:57:58,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:57:58,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 19:57:58,252 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 19:57:58,252 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 19:57:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:57:58,254 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 19:57:58,254 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 19:57:58,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:57:58,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:57:58,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-27 19:57:58,255 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-27 19:57:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:57:58,257 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 19:57:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 19:57:58,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:57:58,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:57:58,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:57:58,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:57:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 19:57:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-27 19:57:58,259 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 20 [2022-04-27 19:57:58,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:57:58,259 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-27 19:57:58,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 19:57:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-27 19:57:58,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 19:57:58,259 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:57:58,259 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:57:58,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 19:57:58,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:57:58,476 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:57:58,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:57:58,476 INFO L85 PathProgramCache]: Analyzing trace with hash -380425632, now seen corresponding path program 1 times [2022-04-27 19:57:58,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:57:58,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013909054] [2022-04-27 19:57:58,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:57:58,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:57:58,487 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:57:58,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [119119108] [2022-04-27 19:57:58,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:57:58,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:57:58,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:57:58,488 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:57:58,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 19:57:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:57:58,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 19:57:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:57:58,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:57:58,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {718#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {718#true} is VALID [2022-04-27 19:57:58,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {718#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {718#true} is VALID [2022-04-27 19:57:58,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {718#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {718#true} is VALID [2022-04-27 19:57:58,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {718#true} {718#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {718#true} is VALID [2022-04-27 19:57:58,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {718#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {718#true} is VALID [2022-04-27 19:57:58,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {718#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {738#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:57:58,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {738#(and (= main_~x~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {738#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:57:58,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {738#(and (= main_~x~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {738#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:57:58,633 INFO L272 TraceCheckUtils]: 8: Hoare triple {738#(and (= main_~x~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {718#true} is VALID [2022-04-27 19:57:58,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {718#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {718#true} is VALID [2022-04-27 19:57:58,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {718#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {718#true} is VALID [2022-04-27 19:57:58,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {718#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {718#true} is VALID [2022-04-27 19:57:58,634 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {718#true} {738#(and (= main_~x~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {738#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:57:58,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {738#(and (= main_~x~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {763#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 19:57:58,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {763#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {763#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 19:57:58,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {763#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {763#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-27 19:57:58,636 INFO L272 TraceCheckUtils]: 16: Hoare triple {763#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {773#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:57:58,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {777#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:57:58,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {777#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {719#false} is VALID [2022-04-27 19:57:58,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {719#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {719#false} is VALID [2022-04-27 19:57:58,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 19:57:58,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:57:58,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {719#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {719#false} is VALID [2022-04-27 19:57:58,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {777#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {719#false} is VALID [2022-04-27 19:57:58,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {777#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:57:58,757 INFO L272 TraceCheckUtils]: 16: Hoare triple {793#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {773#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:57:58,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {793#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {793#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 19:57:58,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {793#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {793#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 19:57:58,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {793#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {793#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 19:57:58,766 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {718#true} {793#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {793#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 19:57:58,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {718#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {718#true} is VALID [2022-04-27 19:57:58,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {718#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {718#true} is VALID [2022-04-27 19:57:58,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {718#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {718#true} is VALID [2022-04-27 19:57:58,766 INFO L272 TraceCheckUtils]: 8: Hoare triple {793#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {718#true} is VALID [2022-04-27 19:57:58,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {793#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {793#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 19:57:58,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {793#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {793#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 19:57:58,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {718#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {793#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 19:57:58,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {718#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {718#true} is VALID [2022-04-27 19:57:58,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {718#true} {718#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {718#true} is VALID [2022-04-27 19:57:58,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {718#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {718#true} is VALID [2022-04-27 19:57:58,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {718#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {718#true} is VALID [2022-04-27 19:57:58,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {718#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {718#true} is VALID [2022-04-27 19:57:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 19:57:58,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:57:58,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013909054] [2022-04-27 19:57:58,769 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:57:58,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119119108] [2022-04-27 19:57:58,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119119108] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 19:57:58,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 19:57:58,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 19:57:58,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307600958] [2022-04-27 19:57:58,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 19:57:58,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 19:57:58,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:57:58,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 19:57:58,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:57:58,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 19:57:58,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:57:58,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 19:57:58,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 19:57:58,791 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 19:57:58,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:57:58,866 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-04-27 19:57:58,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 19:57:58,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 19:57:58,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:57:58,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 19:57:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-27 19:57:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 19:57:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-27 19:57:58,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-27 19:57:58,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:57:58,898 INFO L225 Difference]: With dead ends: 60 [2022-04-27 19:57:58,898 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 19:57:58,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 19:57:58,899 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 19:57:58,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 19:57:58,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 19:57:58,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2022-04-27 19:57:58,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:57:58,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:57:58,902 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:57:58,902 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:57:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:57:58,903 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-27 19:57:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-27 19:57:58,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:57:58,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:57:58,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-27 19:57:58,904 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-27 19:57:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:57:58,905 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-27 19:57:58,905 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-27 19:57:58,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:57:58,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:57:58,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:57:58,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:57:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:57:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-04-27 19:57:58,907 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 20 [2022-04-27 19:57:58,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:57:58,907 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-04-27 19:57:58,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 19:57:58,907 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-04-27 19:57:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 19:57:58,908 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:57:58,908 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:57:58,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 19:57:59,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:57:59,124 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:57:59,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:57:59,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1647871298, now seen corresponding path program 1 times [2022-04-27 19:57:59,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:57:59,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217104563] [2022-04-27 19:57:59,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:57:59,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:57:59,133 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:57:59,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1536157698] [2022-04-27 19:57:59,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:57:59,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:57:59,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:57:59,136 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:57:59,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 19:57:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:57:59,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 19:57:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:57:59,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:57:59,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {1053#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1053#true} is VALID [2022-04-27 19:57:59,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {1053#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1053#true} is VALID [2022-04-27 19:57:59,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {1053#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1053#true} is VALID [2022-04-27 19:57:59,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1053#true} {1053#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1053#true} is VALID [2022-04-27 19:57:59,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {1053#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1053#true} is VALID [2022-04-27 19:57:59,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {1053#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1073#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:57:59,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {1073#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1073#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:57:59,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {1073#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1073#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:57:59,551 INFO L272 TraceCheckUtils]: 8: Hoare triple {1073#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1053#true} is VALID [2022-04-27 19:57:59,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {1053#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1053#true} is VALID [2022-04-27 19:57:59,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {1053#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1053#true} is VALID [2022-04-27 19:57:59,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {1053#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1053#true} is VALID [2022-04-27 19:57:59,552 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1053#true} {1073#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1073#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:57:59,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {1073#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1098#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 19:57:59,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {1098#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1098#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 19:57:59,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {1098#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1098#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 19:57:59,553 INFO L272 TraceCheckUtils]: 16: Hoare triple {1098#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1053#true} is VALID [2022-04-27 19:57:59,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {1053#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1111#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:57:59,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {1111#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1115#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 19:57:59,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {1115#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1115#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 19:57:59,555 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1115#(not (= |__VERIFIER_assert_#in~cond| 0))} {1098#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1122#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 19:57:59,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {1122#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {1126#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 19:57:59,557 INFO L272 TraceCheckUtils]: 22: Hoare triple {1126#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1130#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:57:59,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {1130#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1134#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:57:59,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {1134#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1054#false} is VALID [2022-04-27 19:57:59,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {1054#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1054#false} is VALID [2022-04-27 19:57:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 19:57:59,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:58:31,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:58:31,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217104563] [2022-04-27 19:58:31,693 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:58:31,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536157698] [2022-04-27 19:58:31,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536157698] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 19:58:31,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 19:58:31,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 19:58:31,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329536653] [2022-04-27 19:58:31,694 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 19:58:31,694 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-27 19:58:31,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:58:31,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:58:31,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:31,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 19:58:31,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:58:31,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 19:58:31,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-27 19:58:31,718 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:58:31,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:31,949 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-04-27 19:58:31,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 19:58:31,950 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-27 19:58:31,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:58:31,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:58:31,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2022-04-27 19:58:31,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:58:31,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2022-04-27 19:58:31,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 33 transitions. [2022-04-27 19:58:31,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:31,975 INFO L225 Difference]: With dead ends: 48 [2022-04-27 19:58:31,975 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 19:58:31,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-04-27 19:58:31,976 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 19:58:31,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 89 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 19:58:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 19:58:31,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 19:58:31,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:58:31,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:58:31,979 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:58:31,979 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:58:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:31,980 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-27 19:58:31,980 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-27 19:58:31,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:31,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:31,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 19:58:31,980 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 19:58:31,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:31,982 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-27 19:58:31,982 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-27 19:58:31,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:31,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:31,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:58:31,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:58:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:58:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-27 19:58:31,983 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 26 [2022-04-27 19:58:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:58:31,983 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-27 19:58:31,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 19:58:31,983 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-27 19:58:31,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 19:58:31,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:58:31,984 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:58:31,999 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-27 19:58:32,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:32,200 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:58:32,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:58:32,200 INFO L85 PathProgramCache]: Analyzing trace with hash 31133987, now seen corresponding path program 2 times [2022-04-27 19:58:32,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:58:32,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789367806] [2022-04-27 19:58:32,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:32,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:58:32,215 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:58:32,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1152317616] [2022-04-27 19:58:32,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 19:58:32,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:32,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:58:32,219 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:58:32,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 19:58:32,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 19:58:32,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 19:58:32,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 19:58:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:32,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:58:32,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {1376#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 19:58:32,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {1376#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1376#true} is VALID [2022-04-27 19:58:32,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {1376#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 19:58:32,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1376#true} {1376#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 19:58:32,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {1376#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 19:58:32,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {1376#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1396#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:32,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {1396#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1396#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:32,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {1396#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1396#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:32,564 INFO L272 TraceCheckUtils]: 8: Hoare triple {1396#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1376#true} is VALID [2022-04-27 19:58:32,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {1376#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1376#true} is VALID [2022-04-27 19:58:32,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {1376#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 19:58:32,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {1376#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 19:58:32,565 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1376#true} {1396#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1396#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:32,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {1396#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1421#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 19:58:32,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {1421#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1421#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 19:58:32,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {1421#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1421#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 19:58:32,567 INFO L272 TraceCheckUtils]: 16: Hoare triple {1421#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1376#true} is VALID [2022-04-27 19:58:32,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {1376#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1376#true} is VALID [2022-04-27 19:58:32,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {1376#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 19:58:32,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {1376#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 19:58:32,568 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1376#true} {1421#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1421#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 19:58:32,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {1421#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1446#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 19:58:32,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {1446#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1446#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 19:58:32,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {1446#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1446#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 19:58:32,569 INFO L272 TraceCheckUtils]: 24: Hoare triple {1446#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1376#true} is VALID [2022-04-27 19:58:32,569 INFO L290 TraceCheckUtils]: 25: Hoare triple {1376#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1376#true} is VALID [2022-04-27 19:58:32,569 INFO L290 TraceCheckUtils]: 26: Hoare triple {1376#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 19:58:32,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {1376#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1376#true} is VALID [2022-04-27 19:58:32,570 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1376#true} {1446#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1446#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-27 19:58:32,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {1446#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {1471#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-27 19:58:32,571 INFO L272 TraceCheckUtils]: 30: Hoare triple {1471#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1475#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:58:32,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {1475#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1479#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:58:32,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {1479#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1377#false} is VALID [2022-04-27 19:58:32,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {1377#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1377#false} is VALID [2022-04-27 19:58:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 19:58:32,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:58:32,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:58:32,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789367806] [2022-04-27 19:58:32,831 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:58:32,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152317616] [2022-04-27 19:58:32,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152317616] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 19:58:32,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 19:58:32,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 19:58:32,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321423724] [2022-04-27 19:58:32,831 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 19:58:32,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-27 19:58:32,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:58:32,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 19:58:32,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:32,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 19:58:32,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:58:32,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 19:58:32,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 19:58:32,852 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 19:58:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:33,030 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2022-04-27 19:58:33,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 19:58:33,030 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-27 19:58:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:58:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 19:58:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-27 19:58:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 19:58:33,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-27 19:58:33,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2022-04-27 19:58:33,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:33,061 INFO L225 Difference]: With dead ends: 48 [2022-04-27 19:58:33,061 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 19:58:33,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 19:58:33,061 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 19:58:33,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 19:58:33,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 19:58:33,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 19:58:33,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:58:33,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:58:33,064 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:58:33,064 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:58:33,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:33,065 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-27 19:58:33,065 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-27 19:58:33,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:33,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:33,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 19:58:33,065 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 19:58:33,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:33,066 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-27 19:58:33,066 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-27 19:58:33,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:33,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:33,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:58:33,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:58:33,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:58:33,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-04-27 19:58:33,068 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 34 [2022-04-27 19:58:33,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:58:33,068 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-04-27 19:58:33,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 19:58:33,068 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-27 19:58:33,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 19:58:33,068 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:58:33,069 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:58:33,086 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-27 19:58:33,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:33,283 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:58:33,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:58:33,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1474833412, now seen corresponding path program 3 times [2022-04-27 19:58:33,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:58:33,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256696699] [2022-04-27 19:58:33,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:33,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:58:33,293 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:58:33,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [268360497] [2022-04-27 19:58:33,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 19:58:33,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:33,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:58:33,298 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:58:33,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 19:58:33,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 19:58:33,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 19:58:33,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 19:58:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:33,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:58:33,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {1717#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1717#true} is VALID [2022-04-27 19:58:33,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {1717#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1717#true} is VALID [2022-04-27 19:58:33,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {1717#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1717#true} is VALID [2022-04-27 19:58:33,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1717#true} {1717#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1717#true} is VALID [2022-04-27 19:58:33,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {1717#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1717#true} is VALID [2022-04-27 19:58:33,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {1717#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1737#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:33,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {1737#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1737#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:33,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {1737#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1737#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:33,655 INFO L272 TraceCheckUtils]: 8: Hoare triple {1737#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1717#true} is VALID [2022-04-27 19:58:33,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {1717#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1717#true} is VALID [2022-04-27 19:58:33,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {1717#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1717#true} is VALID [2022-04-27 19:58:33,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {1717#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1717#true} is VALID [2022-04-27 19:58:33,656 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1717#true} {1737#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1737#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:33,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {1737#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1762#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 19:58:33,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {1762#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1762#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 19:58:33,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {1762#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1762#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 19:58:33,657 INFO L272 TraceCheckUtils]: 16: Hoare triple {1762#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1717#true} is VALID [2022-04-27 19:58:33,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {1717#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1717#true} is VALID [2022-04-27 19:58:33,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {1717#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1717#true} is VALID [2022-04-27 19:58:33,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {1717#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1717#true} is VALID [2022-04-27 19:58:33,658 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1717#true} {1762#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1762#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 19:58:33,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {1762#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1787#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 19:58:33,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {1787#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1787#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 19:58:33,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {1787#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1787#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 19:58:33,665 INFO L272 TraceCheckUtils]: 24: Hoare triple {1787#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1717#true} is VALID [2022-04-27 19:58:33,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {1717#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1717#true} is VALID [2022-04-27 19:58:33,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {1717#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1717#true} is VALID [2022-04-27 19:58:33,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {1717#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1717#true} is VALID [2022-04-27 19:58:33,666 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1717#true} {1787#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1787#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 19:58:33,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {1787#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1812#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 19:58:33,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {1812#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1812#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 19:58:33,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {1812#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1812#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 19:58:33,667 INFO L272 TraceCheckUtils]: 32: Hoare triple {1812#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1717#true} is VALID [2022-04-27 19:58:33,667 INFO L290 TraceCheckUtils]: 33: Hoare triple {1717#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1717#true} is VALID [2022-04-27 19:58:33,667 INFO L290 TraceCheckUtils]: 34: Hoare triple {1717#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1717#true} is VALID [2022-04-27 19:58:33,667 INFO L290 TraceCheckUtils]: 35: Hoare triple {1717#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1717#true} is VALID [2022-04-27 19:58:33,668 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1717#true} {1812#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1812#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 19:58:33,668 INFO L290 TraceCheckUtils]: 37: Hoare triple {1812#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {1837#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-27 19:58:33,669 INFO L272 TraceCheckUtils]: 38: Hoare triple {1837#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1841#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:58:33,669 INFO L290 TraceCheckUtils]: 39: Hoare triple {1841#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1845#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:58:33,669 INFO L290 TraceCheckUtils]: 40: Hoare triple {1845#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1718#false} is VALID [2022-04-27 19:58:33,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {1718#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1718#false} is VALID [2022-04-27 19:58:33,671 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 19:58:33,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:58:33,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:58:33,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256696699] [2022-04-27 19:58:33,933 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:58:33,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268360497] [2022-04-27 19:58:33,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268360497] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 19:58:33,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 19:58:33,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 19:58:33,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592173003] [2022-04-27 19:58:33,934 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 19:58:33,934 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-27 19:58:33,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:58:33,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:58:33,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:33,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 19:58:33,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:58:33,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 19:58:33,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 19:58:33,957 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:58:34,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:34,224 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-04-27 19:58:34,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 19:58:34,224 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-27 19:58:34,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:58:34,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:58:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2022-04-27 19:58:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:58:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2022-04-27 19:58:34,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 43 transitions. [2022-04-27 19:58:34,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:34,257 INFO L225 Difference]: With dead ends: 50 [2022-04-27 19:58:34,257 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 19:58:34,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 19:58:34,258 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 19:58:34,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 168 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 19:58:34,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 19:58:34,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-27 19:58:34,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:58:34,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 19:58:34,260 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 19:58:34,261 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 19:58:34,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:34,262 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-27 19:58:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-27 19:58:34,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:34,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:34,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-27 19:58:34,262 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-27 19:58:34,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:34,263 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-27 19:58:34,263 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-27 19:58:34,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:34,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:34,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:58:34,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:58:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 19:58:34,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-27 19:58:34,264 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2022-04-27 19:58:34,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:58:34,265 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-27 19:58:34,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 19:58:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-27 19:58:34,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 19:58:34,265 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:58:34,265 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:58:34,289 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-27 19:58:34,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:34,468 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:58:34,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:58:34,469 INFO L85 PathProgramCache]: Analyzing trace with hash 831591399, now seen corresponding path program 2 times [2022-04-27 19:58:34,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:58:34,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101826882] [2022-04-27 19:58:34,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:34,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:58:34,481 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:58:34,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083680948] [2022-04-27 19:58:34,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 19:58:34,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:34,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:58:34,482 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-27 19:58:34,483 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-27 19:58:34,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 19:58:34,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 19:58:34,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 19:58:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:34,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:58:34,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {2091#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2091#true} is VALID [2022-04-27 19:58:34,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {2091#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2099#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:34,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {2099#(<= ~counter~0 0)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2099#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:34,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2099#(<= ~counter~0 0)} {2091#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2099#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:34,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {2099#(<= ~counter~0 0)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2099#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:34,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {2099#(<= ~counter~0 0)} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {2099#(<= ~counter~0 0)} is VALID [2022-04-27 19:58:34,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {2099#(<= ~counter~0 0)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2115#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:34,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {2115#(<= ~counter~0 1)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2115#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:34,746 INFO L272 TraceCheckUtils]: 8: Hoare triple {2115#(<= ~counter~0 1)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2115#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:34,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {2115#(<= ~counter~0 1)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2115#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:34,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {2115#(<= ~counter~0 1)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2115#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:34,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {2115#(<= ~counter~0 1)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2115#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:34,749 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2115#(<= ~counter~0 1)} {2115#(<= ~counter~0 1)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2115#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:34,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {2115#(<= ~counter~0 1)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2115#(<= ~counter~0 1)} is VALID [2022-04-27 19:58:34,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {2115#(<= ~counter~0 1)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2140#(<= ~counter~0 2)} is VALID [2022-04-27 19:58:34,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {2140#(<= ~counter~0 2)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2140#(<= ~counter~0 2)} is VALID [2022-04-27 19:58:34,750 INFO L272 TraceCheckUtils]: 16: Hoare triple {2140#(<= ~counter~0 2)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2140#(<= ~counter~0 2)} is VALID [2022-04-27 19:58:34,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {2140#(<= ~counter~0 2)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2140#(<= ~counter~0 2)} is VALID [2022-04-27 19:58:34,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {2140#(<= ~counter~0 2)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2140#(<= ~counter~0 2)} is VALID [2022-04-27 19:58:34,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {2140#(<= ~counter~0 2)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2140#(<= ~counter~0 2)} is VALID [2022-04-27 19:58:34,752 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2140#(<= ~counter~0 2)} {2140#(<= ~counter~0 2)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2140#(<= ~counter~0 2)} is VALID [2022-04-27 19:58:34,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {2140#(<= ~counter~0 2)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2140#(<= ~counter~0 2)} is VALID [2022-04-27 19:58:34,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {2140#(<= ~counter~0 2)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2165#(<= ~counter~0 3)} is VALID [2022-04-27 19:58:34,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {2165#(<= ~counter~0 3)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2165#(<= ~counter~0 3)} is VALID [2022-04-27 19:58:34,753 INFO L272 TraceCheckUtils]: 24: Hoare triple {2165#(<= ~counter~0 3)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2165#(<= ~counter~0 3)} is VALID [2022-04-27 19:58:34,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {2165#(<= ~counter~0 3)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2165#(<= ~counter~0 3)} is VALID [2022-04-27 19:58:34,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {2165#(<= ~counter~0 3)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2165#(<= ~counter~0 3)} is VALID [2022-04-27 19:58:34,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {2165#(<= ~counter~0 3)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2165#(<= ~counter~0 3)} is VALID [2022-04-27 19:58:34,755 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2165#(<= ~counter~0 3)} {2165#(<= ~counter~0 3)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2165#(<= ~counter~0 3)} is VALID [2022-04-27 19:58:34,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {2165#(<= ~counter~0 3)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2165#(<= ~counter~0 3)} is VALID [2022-04-27 19:58:34,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {2165#(<= ~counter~0 3)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2190#(<= ~counter~0 4)} is VALID [2022-04-27 19:58:34,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {2190#(<= ~counter~0 4)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2190#(<= ~counter~0 4)} is VALID [2022-04-27 19:58:34,764 INFO L272 TraceCheckUtils]: 32: Hoare triple {2190#(<= ~counter~0 4)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2190#(<= ~counter~0 4)} is VALID [2022-04-27 19:58:34,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {2190#(<= ~counter~0 4)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2190#(<= ~counter~0 4)} is VALID [2022-04-27 19:58:34,765 INFO L290 TraceCheckUtils]: 34: Hoare triple {2190#(<= ~counter~0 4)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2190#(<= ~counter~0 4)} is VALID [2022-04-27 19:58:34,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {2190#(<= ~counter~0 4)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2190#(<= ~counter~0 4)} is VALID [2022-04-27 19:58:34,769 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2190#(<= ~counter~0 4)} {2190#(<= ~counter~0 4)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2190#(<= ~counter~0 4)} is VALID [2022-04-27 19:58:34,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {2190#(<= ~counter~0 4)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2190#(<= ~counter~0 4)} is VALID [2022-04-27 19:58:34,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {2190#(<= ~counter~0 4)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2215#(<= |main_#t~post5| 4)} is VALID [2022-04-27 19:58:34,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {2215#(<= |main_#t~post5| 4)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 10)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2092#false} is VALID [2022-04-27 19:58:34,770 INFO L272 TraceCheckUtils]: 40: Hoare triple {2092#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2092#false} is VALID [2022-04-27 19:58:34,770 INFO L290 TraceCheckUtils]: 41: Hoare triple {2092#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2092#false} is VALID [2022-04-27 19:58:34,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {2092#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2092#false} is VALID [2022-04-27 19:58:34,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {2092#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2092#false} is VALID [2022-04-27 19:58:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 19:58:34,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:58:35,049 INFO L290 TraceCheckUtils]: 43: Hoare triple {2092#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2092#false} is VALID [2022-04-27 19:58:35,050 INFO L290 TraceCheckUtils]: 42: Hoare triple {2092#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2092#false} is VALID [2022-04-27 19:58:35,050 INFO L290 TraceCheckUtils]: 41: Hoare triple {2092#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2092#false} is VALID [2022-04-27 19:58:35,050 INFO L272 TraceCheckUtils]: 40: Hoare triple {2092#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2092#false} is VALID [2022-04-27 19:58:35,050 INFO L290 TraceCheckUtils]: 39: Hoare triple {2243#(< |main_#t~post5| 10)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 10)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2092#false} is VALID [2022-04-27 19:58:35,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {2247#(< ~counter~0 10)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2243#(< |main_#t~post5| 10)} is VALID [2022-04-27 19:58:35,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {2247#(< ~counter~0 10)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2247#(< ~counter~0 10)} is VALID [2022-04-27 19:58:35,051 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2091#true} {2247#(< ~counter~0 10)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2247#(< ~counter~0 10)} is VALID [2022-04-27 19:58:35,052 INFO L290 TraceCheckUtils]: 35: Hoare triple {2091#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2091#true} is VALID [2022-04-27 19:58:35,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {2091#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2091#true} is VALID [2022-04-27 19:58:35,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {2091#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2091#true} is VALID [2022-04-27 19:58:35,052 INFO L272 TraceCheckUtils]: 32: Hoare triple {2247#(< ~counter~0 10)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2091#true} is VALID [2022-04-27 19:58:35,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {2247#(< ~counter~0 10)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2247#(< ~counter~0 10)} is VALID [2022-04-27 19:58:35,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {2272#(< ~counter~0 9)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2247#(< ~counter~0 10)} is VALID [2022-04-27 19:58:35,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {2272#(< ~counter~0 9)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2272#(< ~counter~0 9)} is VALID [2022-04-27 19:58:35,053 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2091#true} {2272#(< ~counter~0 9)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2272#(< ~counter~0 9)} is VALID [2022-04-27 19:58:35,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {2091#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2091#true} is VALID [2022-04-27 19:58:35,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {2091#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2091#true} is VALID [2022-04-27 19:58:35,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {2091#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2091#true} is VALID [2022-04-27 19:58:35,055 INFO L272 TraceCheckUtils]: 24: Hoare triple {2272#(< ~counter~0 9)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2091#true} is VALID [2022-04-27 19:58:35,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {2272#(< ~counter~0 9)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2272#(< ~counter~0 9)} is VALID [2022-04-27 19:58:35,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {2297#(< ~counter~0 8)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2272#(< ~counter~0 9)} is VALID [2022-04-27 19:58:35,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {2297#(< ~counter~0 8)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2297#(< ~counter~0 8)} is VALID [2022-04-27 19:58:35,056 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2091#true} {2297#(< ~counter~0 8)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2297#(< ~counter~0 8)} is VALID [2022-04-27 19:58:35,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {2091#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2091#true} is VALID [2022-04-27 19:58:35,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {2091#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2091#true} is VALID [2022-04-27 19:58:35,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {2091#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2091#true} is VALID [2022-04-27 19:58:35,056 INFO L272 TraceCheckUtils]: 16: Hoare triple {2297#(< ~counter~0 8)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2091#true} is VALID [2022-04-27 19:58:35,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {2297#(< ~counter~0 8)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2297#(< ~counter~0 8)} is VALID [2022-04-27 19:58:35,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {2322#(< ~counter~0 7)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2297#(< ~counter~0 8)} is VALID [2022-04-27 19:58:35,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {2322#(< ~counter~0 7)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2322#(< ~counter~0 7)} is VALID [2022-04-27 19:58:35,058 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2091#true} {2322#(< ~counter~0 7)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2322#(< ~counter~0 7)} is VALID [2022-04-27 19:58:35,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {2091#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2091#true} is VALID [2022-04-27 19:58:35,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {2091#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2091#true} is VALID [2022-04-27 19:58:35,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {2091#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2091#true} is VALID [2022-04-27 19:58:35,058 INFO L272 TraceCheckUtils]: 8: Hoare triple {2322#(< ~counter~0 7)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2091#true} is VALID [2022-04-27 19:58:35,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {2322#(< ~counter~0 7)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2322#(< ~counter~0 7)} is VALID [2022-04-27 19:58:35,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {2347#(< ~counter~0 6)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2322#(< ~counter~0 7)} is VALID [2022-04-27 19:58:35,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {2347#(< ~counter~0 6)} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {2347#(< ~counter~0 6)} is VALID [2022-04-27 19:58:35,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {2347#(< ~counter~0 6)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2347#(< ~counter~0 6)} is VALID [2022-04-27 19:58:35,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2347#(< ~counter~0 6)} {2091#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2347#(< ~counter~0 6)} is VALID [2022-04-27 19:58:35,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {2347#(< ~counter~0 6)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2347#(< ~counter~0 6)} is VALID [2022-04-27 19:58:35,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {2091#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2347#(< ~counter~0 6)} is VALID [2022-04-27 19:58:35,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {2091#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2091#true} is VALID [2022-04-27 19:58:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 19:58:35,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:58:35,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101826882] [2022-04-27 19:58:35,063 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:58:35,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083680948] [2022-04-27 19:58:35,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083680948] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 19:58:35,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 19:58:35,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 19:58:35,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905473820] [2022-04-27 19:58:35,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 19:58:35,066 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 44 [2022-04-27 19:58:35,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:58:35,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 19:58:35,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:35,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 19:58:35,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:58:35,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 19:58:35,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 19:58:35,134 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 19:58:35,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:35,480 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-04-27 19:58:35,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 19:58:35,480 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 44 [2022-04-27 19:58:35,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:58:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 19:58:35,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 119 transitions. [2022-04-27 19:58:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 19:58:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 119 transitions. [2022-04-27 19:58:35,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 119 transitions. [2022-04-27 19:58:35,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:35,555 INFO L225 Difference]: With dead ends: 118 [2022-04-27 19:58:35,556 INFO L226 Difference]: Without dead ends: 118 [2022-04-27 19:58:35,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-27 19:58:35,556 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 150 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 19:58:35,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 142 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 19:58:35,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-27 19:58:35,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 93. [2022-04-27 19:58:35,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:58:35,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:35,560 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:35,561 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:35,563 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-04-27 19:58:35,563 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-04-27 19:58:35,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:35,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:35,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 118 states. [2022-04-27 19:58:35,564 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 118 states. [2022-04-27 19:58:35,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:35,566 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-04-27 19:58:35,566 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-04-27 19:58:35,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:35,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:35,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:58:35,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:58:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2022-04-27 19:58:35,570 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 44 [2022-04-27 19:58:35,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:58:35,570 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2022-04-27 19:58:35,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-27 19:58:35,570 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2022-04-27 19:58:35,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 19:58:35,571 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:58:35,572 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:58:35,589 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-27 19:58:35,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 19:58:35,789 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:58:35,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:58:35,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1805593115, now seen corresponding path program 4 times [2022-04-27 19:58:35,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:58:35,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31581217] [2022-04-27 19:58:35,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:35,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:58:35,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:58:35,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1456968889] [2022-04-27 19:58:35,808 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 19:58:35,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:35,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:58:35,809 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-27 19:58:35,810 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-27 19:58:35,879 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 19:58:35,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 19:58:35,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 19:58:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:35,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:58:36,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {2833#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2833#true} is VALID [2022-04-27 19:58:36,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {2833#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2833#true} is VALID [2022-04-27 19:58:36,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {2833#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2833#true} is VALID [2022-04-27 19:58:36,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2833#true} {2833#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2833#true} is VALID [2022-04-27 19:58:36,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {2833#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2833#true} is VALID [2022-04-27 19:58:36,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {2833#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:36,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {2853#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:36,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {2853#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:36,288 INFO L272 TraceCheckUtils]: 8: Hoare triple {2853#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2833#true} is VALID [2022-04-27 19:58:36,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {2833#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2833#true} is VALID [2022-04-27 19:58:36,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {2833#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2833#true} is VALID [2022-04-27 19:58:36,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {2833#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2833#true} is VALID [2022-04-27 19:58:36,289 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2833#true} {2853#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:36,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {2853#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2878#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 19:58:36,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {2878#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2878#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 19:58:36,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {2878#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2878#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 19:58:36,290 INFO L272 TraceCheckUtils]: 16: Hoare triple {2878#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2833#true} is VALID [2022-04-27 19:58:36,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {2833#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2833#true} is VALID [2022-04-27 19:58:36,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {2833#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2833#true} is VALID [2022-04-27 19:58:36,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {2833#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2833#true} is VALID [2022-04-27 19:58:36,291 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2833#true} {2878#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2878#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 19:58:36,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {2878#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2903#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:36,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {2903#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2903#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:36,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {2903#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2903#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:36,293 INFO L272 TraceCheckUtils]: 24: Hoare triple {2903#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2833#true} is VALID [2022-04-27 19:58:36,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {2833#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2833#true} is VALID [2022-04-27 19:58:36,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {2833#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2833#true} is VALID [2022-04-27 19:58:36,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {2833#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2833#true} is VALID [2022-04-27 19:58:36,294 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2833#true} {2903#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2903#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:36,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {2903#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2928#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:36,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {2928#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2928#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:36,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {2928#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2928#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:36,295 INFO L272 TraceCheckUtils]: 32: Hoare triple {2928#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2833#true} is VALID [2022-04-27 19:58:36,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {2833#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2833#true} is VALID [2022-04-27 19:58:36,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {2833#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2833#true} is VALID [2022-04-27 19:58:36,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {2833#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2833#true} is VALID [2022-04-27 19:58:36,296 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2833#true} {2928#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2928#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:36,296 INFO L290 TraceCheckUtils]: 37: Hoare triple {2928#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2953#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 19:58:36,297 INFO L290 TraceCheckUtils]: 38: Hoare triple {2953#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2953#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 19:58:36,297 INFO L290 TraceCheckUtils]: 39: Hoare triple {2953#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2953#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 19:58:36,297 INFO L272 TraceCheckUtils]: 40: Hoare triple {2953#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2833#true} is VALID [2022-04-27 19:58:36,297 INFO L290 TraceCheckUtils]: 41: Hoare triple {2833#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2833#true} is VALID [2022-04-27 19:58:36,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {2833#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2833#true} is VALID [2022-04-27 19:58:36,297 INFO L290 TraceCheckUtils]: 43: Hoare triple {2833#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2833#true} is VALID [2022-04-27 19:58:36,298 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2833#true} {2953#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2953#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 19:58:36,299 INFO L290 TraceCheckUtils]: 45: Hoare triple {2953#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {2978#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 19:58:36,299 INFO L272 TraceCheckUtils]: 46: Hoare triple {2978#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2982#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:58:36,300 INFO L290 TraceCheckUtils]: 47: Hoare triple {2982#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2986#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:58:36,300 INFO L290 TraceCheckUtils]: 48: Hoare triple {2986#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2834#false} is VALID [2022-04-27 19:58:36,300 INFO L290 TraceCheckUtils]: 49: Hoare triple {2834#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2834#false} is VALID [2022-04-27 19:58:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 19:58:36,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:58:36,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:58:36,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31581217] [2022-04-27 19:58:36,859 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:58:36,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456968889] [2022-04-27 19:58:36,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456968889] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 19:58:36,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 19:58:36,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 19:58:36,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581249847] [2022-04-27 19:58:36,859 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 19:58:36,860 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-27 19:58:36,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:58:36,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 19:58:36,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:36,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 19:58:36,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:58:36,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 19:58:36,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-27 19:58:36,885 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 19:58:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:37,231 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-04-27 19:58:37,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 19:58:37,231 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-27 19:58:37,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:58:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 19:58:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-27 19:58:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 19:58:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-27 19:58:37,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-27 19:58:37,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:37,279 INFO L225 Difference]: With dead ends: 96 [2022-04-27 19:58:37,279 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 19:58:37,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-27 19:58:37,280 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 19:58:37,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 208 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 19:58:37,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 19:58:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 19:58:37,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:58:37,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:37,284 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:37,284 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:37,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:37,286 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-04-27 19:58:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-27 19:58:37,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:37,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:37,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 19:58:37,287 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 19:58:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:37,288 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-04-27 19:58:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-27 19:58:37,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:37,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:37,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:58:37,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:58:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2022-04-27 19:58:37,290 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 50 [2022-04-27 19:58:37,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:58:37,290 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2022-04-27 19:58:37,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 19:58:37,290 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-27 19:58:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 19:58:37,290 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:58:37,290 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:58:37,309 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-27 19:58:37,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 19:58:37,503 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:58:37,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:58:37,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1447431878, now seen corresponding path program 5 times [2022-04-27 19:58:37,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:58:37,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847667317] [2022-04-27 19:58:37,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:37,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:58:37,515 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:58:37,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [308872746] [2022-04-27 19:58:37,515 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 19:58:37,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:37,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:58:37,516 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:58:37,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 19:58:37,689 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 19:58:37,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 19:58:37,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 19:58:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:37,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:58:38,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {3491#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3491#true} is VALID [2022-04-27 19:58:38,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {3491#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {3491#true} is VALID [2022-04-27 19:58:38,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {3491#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3491#true} is VALID [2022-04-27 19:58:38,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3491#true} {3491#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3491#true} is VALID [2022-04-27 19:58:38,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {3491#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3491#true} is VALID [2022-04-27 19:58:38,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {3491#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {3511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:38,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {3511#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:38,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {3511#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:38,065 INFO L272 TraceCheckUtils]: 8: Hoare triple {3511#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3491#true} is VALID [2022-04-27 19:58:38,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {3491#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3491#true} is VALID [2022-04-27 19:58:38,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {3491#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3491#true} is VALID [2022-04-27 19:58:38,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {3491#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3491#true} is VALID [2022-04-27 19:58:38,066 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3491#true} {3511#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:38,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {3511#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 19:58:38,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {3536#(and (= main_~y~0 1) (= main_~c~0 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 19:58:38,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {3536#(and (= main_~y~0 1) (= main_~c~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 19:58:38,067 INFO L272 TraceCheckUtils]: 16: Hoare triple {3536#(and (= main_~y~0 1) (= main_~c~0 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3491#true} is VALID [2022-04-27 19:58:38,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {3491#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3491#true} is VALID [2022-04-27 19:58:38,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {3491#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3491#true} is VALID [2022-04-27 19:58:38,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {3491#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3491#true} is VALID [2022-04-27 19:58:38,071 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3491#true} {3536#(and (= main_~y~0 1) (= main_~c~0 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 19:58:38,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {3536#(and (= main_~y~0 1) (= main_~c~0 1))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 19:58:38,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {3561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 19:58:38,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {3561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 19:58:38,072 INFO L272 TraceCheckUtils]: 24: Hoare triple {3561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3491#true} is VALID [2022-04-27 19:58:38,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {3491#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3491#true} is VALID [2022-04-27 19:58:38,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {3491#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3491#true} is VALID [2022-04-27 19:58:38,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {3491#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3491#true} is VALID [2022-04-27 19:58:38,073 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3491#true} {3561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 19:58:38,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {3561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3586#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 19:58:38,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {3586#(and (= main_~y~0 3) (= main_~c~0 3))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3586#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 19:58:38,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {3586#(and (= main_~y~0 3) (= main_~c~0 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3586#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 19:58:38,075 INFO L272 TraceCheckUtils]: 32: Hoare triple {3586#(and (= main_~y~0 3) (= main_~c~0 3))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3491#true} is VALID [2022-04-27 19:58:38,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {3491#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3491#true} is VALID [2022-04-27 19:58:38,075 INFO L290 TraceCheckUtils]: 34: Hoare triple {3491#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3491#true} is VALID [2022-04-27 19:58:38,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {3491#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3491#true} is VALID [2022-04-27 19:58:38,075 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3491#true} {3586#(and (= main_~y~0 3) (= main_~c~0 3))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3586#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 19:58:38,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {3586#(and (= main_~y~0 3) (= main_~c~0 3))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3611#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 19:58:38,076 INFO L290 TraceCheckUtils]: 38: Hoare triple {3611#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3611#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 19:58:38,077 INFO L290 TraceCheckUtils]: 39: Hoare triple {3611#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3611#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 19:58:38,077 INFO L272 TraceCheckUtils]: 40: Hoare triple {3611#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3491#true} is VALID [2022-04-27 19:58:38,077 INFO L290 TraceCheckUtils]: 41: Hoare triple {3491#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3491#true} is VALID [2022-04-27 19:58:38,077 INFO L290 TraceCheckUtils]: 42: Hoare triple {3491#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3491#true} is VALID [2022-04-27 19:58:38,077 INFO L290 TraceCheckUtils]: 43: Hoare triple {3491#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3491#true} is VALID [2022-04-27 19:58:38,077 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3491#true} {3611#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3611#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 19:58:38,078 INFO L290 TraceCheckUtils]: 45: Hoare triple {3611#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3636#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 19:58:38,078 INFO L290 TraceCheckUtils]: 46: Hoare triple {3636#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3636#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 19:58:38,078 INFO L290 TraceCheckUtils]: 47: Hoare triple {3636#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3636#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 19:58:38,079 INFO L272 TraceCheckUtils]: 48: Hoare triple {3636#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3491#true} is VALID [2022-04-27 19:58:38,079 INFO L290 TraceCheckUtils]: 49: Hoare triple {3491#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3491#true} is VALID [2022-04-27 19:58:38,079 INFO L290 TraceCheckUtils]: 50: Hoare triple {3491#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3491#true} is VALID [2022-04-27 19:58:38,079 INFO L290 TraceCheckUtils]: 51: Hoare triple {3491#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3491#true} is VALID [2022-04-27 19:58:38,079 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3491#true} {3636#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3636#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 19:58:38,080 INFO L290 TraceCheckUtils]: 53: Hoare triple {3636#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {3661#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-27 19:58:38,080 INFO L272 TraceCheckUtils]: 54: Hoare triple {3661#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {3665#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:58:38,081 INFO L290 TraceCheckUtils]: 55: Hoare triple {3665#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3669#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:58:38,081 INFO L290 TraceCheckUtils]: 56: Hoare triple {3669#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3492#false} is VALID [2022-04-27 19:58:38,081 INFO L290 TraceCheckUtils]: 57: Hoare triple {3492#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3492#false} is VALID [2022-04-27 19:58:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 19:58:38,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:58:38,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:58:38,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847667317] [2022-04-27 19:58:38,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:58:38,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308872746] [2022-04-27 19:58:38,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308872746] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 19:58:38,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 19:58:38,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 19:58:38,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303355091] [2022-04-27 19:58:38,324 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 19:58:38,324 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58 [2022-04-27 19:58:38,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:58:38,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 19:58:38,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:38,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 19:58:38,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:58:38,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 19:58:38,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 19:58:38,355 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 19:58:38,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:38,775 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2022-04-27 19:58:38,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 19:58:38,775 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58 [2022-04-27 19:58:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:58:38,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 19:58:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2022-04-27 19:58:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 19:58:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2022-04-27 19:58:38,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 53 transitions. [2022-04-27 19:58:38,820 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-27 19:58:38,822 INFO L225 Difference]: With dead ends: 96 [2022-04-27 19:58:38,822 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 19:58:38,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 19:58:38,824 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 19:58:38,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 252 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 19:58:38,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 19:58:38,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 19:58:38,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:58:38,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:38,839 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:38,839 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:38,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:38,842 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-27 19:58:38,842 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-27 19:58:38,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:38,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:38,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 19:58:38,842 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 19:58:38,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:38,845 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-27 19:58:38,845 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-27 19:58:38,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:38,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:38,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:58:38,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:58:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:38,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2022-04-27 19:58:38,848 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 58 [2022-04-27 19:58:38,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:58:38,848 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2022-04-27 19:58:38,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 19:58:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-27 19:58:38,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 19:58:38,849 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:58:38,849 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:58:38,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 19:58:39,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 19:58:39,055 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:58:39,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:58:39,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1416046937, now seen corresponding path program 6 times [2022-04-27 19:58:39,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:58:39,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065182504] [2022-04-27 19:58:39,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:39,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:58:39,072 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:58:39,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [624200183] [2022-04-27 19:58:39,073 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 19:58:39,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:39,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:58:39,074 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:58:39,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 19:58:39,393 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 19:58:39,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 19:58:39,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 19:58:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:39,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:58:39,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {4099#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4099#true} is VALID [2022-04-27 19:58:39,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {4099#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {4099#true} is VALID [2022-04-27 19:58:39,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {4099#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4099#true} is VALID [2022-04-27 19:58:39,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4099#true} {4099#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4099#true} is VALID [2022-04-27 19:58:39,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {4099#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4099#true} is VALID [2022-04-27 19:58:39,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {4099#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {4119#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:39,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {4119#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4119#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:39,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {4119#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4119#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:39,827 INFO L272 TraceCheckUtils]: 8: Hoare triple {4119#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4099#true} is VALID [2022-04-27 19:58:39,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {4099#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4099#true} is VALID [2022-04-27 19:58:39,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {4099#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4099#true} is VALID [2022-04-27 19:58:39,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {4099#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4099#true} is VALID [2022-04-27 19:58:39,828 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4099#true} {4119#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4119#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:39,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {4119#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4144#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 19:58:39,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {4144#(and (= main_~y~0 1) (= main_~c~0 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4144#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 19:58:39,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {4144#(and (= main_~y~0 1) (= main_~c~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4144#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 19:58:39,829 INFO L272 TraceCheckUtils]: 16: Hoare triple {4144#(and (= main_~y~0 1) (= main_~c~0 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4099#true} is VALID [2022-04-27 19:58:39,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {4099#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4099#true} is VALID [2022-04-27 19:58:39,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {4099#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4099#true} is VALID [2022-04-27 19:58:39,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {4099#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4099#true} is VALID [2022-04-27 19:58:39,830 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4099#true} {4144#(and (= main_~y~0 1) (= main_~c~0 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4144#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 19:58:39,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {4144#(and (= main_~y~0 1) (= main_~c~0 1))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4169#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 19:58:39,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {4169#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4169#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 19:58:39,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {4169#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4169#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 19:58:39,831 INFO L272 TraceCheckUtils]: 24: Hoare triple {4169#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4099#true} is VALID [2022-04-27 19:58:39,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {4099#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4099#true} is VALID [2022-04-27 19:58:39,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {4099#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4099#true} is VALID [2022-04-27 19:58:39,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {4099#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4099#true} is VALID [2022-04-27 19:58:39,831 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4099#true} {4169#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4169#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-27 19:58:39,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {4169#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 19:58:39,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {4194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 19:58:39,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {4194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 19:58:39,833 INFO L272 TraceCheckUtils]: 32: Hoare triple {4194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4099#true} is VALID [2022-04-27 19:58:39,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {4099#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4099#true} is VALID [2022-04-27 19:58:39,833 INFO L290 TraceCheckUtils]: 34: Hoare triple {4099#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4099#true} is VALID [2022-04-27 19:58:39,833 INFO L290 TraceCheckUtils]: 35: Hoare triple {4099#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4099#true} is VALID [2022-04-27 19:58:39,833 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4099#true} {4194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 19:58:39,834 INFO L290 TraceCheckUtils]: 37: Hoare triple {4194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4219#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 19:58:39,834 INFO L290 TraceCheckUtils]: 38: Hoare triple {4219#(and (= main_~y~0 4) (= main_~c~0 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4219#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 19:58:39,834 INFO L290 TraceCheckUtils]: 39: Hoare triple {4219#(and (= main_~y~0 4) (= main_~c~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4219#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 19:58:39,834 INFO L272 TraceCheckUtils]: 40: Hoare triple {4219#(and (= main_~y~0 4) (= main_~c~0 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4099#true} is VALID [2022-04-27 19:58:39,835 INFO L290 TraceCheckUtils]: 41: Hoare triple {4099#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4099#true} is VALID [2022-04-27 19:58:39,835 INFO L290 TraceCheckUtils]: 42: Hoare triple {4099#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4099#true} is VALID [2022-04-27 19:58:39,835 INFO L290 TraceCheckUtils]: 43: Hoare triple {4099#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4099#true} is VALID [2022-04-27 19:58:39,835 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4099#true} {4219#(and (= main_~y~0 4) (= main_~c~0 4))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4219#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-27 19:58:39,835 INFO L290 TraceCheckUtils]: 45: Hoare triple {4219#(and (= main_~y~0 4) (= main_~c~0 4))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4244#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 19:58:39,836 INFO L290 TraceCheckUtils]: 46: Hoare triple {4244#(and (= 5 main_~c~0) (= 5 main_~y~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4244#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 19:58:39,836 INFO L290 TraceCheckUtils]: 47: Hoare triple {4244#(and (= 5 main_~c~0) (= 5 main_~y~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4244#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 19:58:39,836 INFO L272 TraceCheckUtils]: 48: Hoare triple {4244#(and (= 5 main_~c~0) (= 5 main_~y~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4099#true} is VALID [2022-04-27 19:58:39,836 INFO L290 TraceCheckUtils]: 49: Hoare triple {4099#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4099#true} is VALID [2022-04-27 19:58:39,836 INFO L290 TraceCheckUtils]: 50: Hoare triple {4099#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4099#true} is VALID [2022-04-27 19:58:39,836 INFO L290 TraceCheckUtils]: 51: Hoare triple {4099#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4099#true} is VALID [2022-04-27 19:58:39,837 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4099#true} {4244#(and (= 5 main_~c~0) (= 5 main_~y~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4244#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 19:58:39,838 INFO L290 TraceCheckUtils]: 53: Hoare triple {4244#(and (= 5 main_~c~0) (= 5 main_~y~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4269#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 19:58:39,838 INFO L290 TraceCheckUtils]: 54: Hoare triple {4269#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4269#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 19:58:39,839 INFO L290 TraceCheckUtils]: 55: Hoare triple {4269#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4269#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 19:58:39,839 INFO L272 TraceCheckUtils]: 56: Hoare triple {4269#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4099#true} is VALID [2022-04-27 19:58:39,839 INFO L290 TraceCheckUtils]: 57: Hoare triple {4099#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4099#true} is VALID [2022-04-27 19:58:39,839 INFO L290 TraceCheckUtils]: 58: Hoare triple {4099#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4099#true} is VALID [2022-04-27 19:58:39,839 INFO L290 TraceCheckUtils]: 59: Hoare triple {4099#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4099#true} is VALID [2022-04-27 19:58:39,839 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4099#true} {4269#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4269#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-27 19:58:39,840 INFO L290 TraceCheckUtils]: 61: Hoare triple {4269#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {4294#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-27 19:58:39,841 INFO L272 TraceCheckUtils]: 62: Hoare triple {4294#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {4298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:58:39,841 INFO L290 TraceCheckUtils]: 63: Hoare triple {4298#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:58:39,841 INFO L290 TraceCheckUtils]: 64: Hoare triple {4302#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {4100#false} is VALID [2022-04-27 19:58:39,842 INFO L290 TraceCheckUtils]: 65: Hoare triple {4100#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4100#false} is VALID [2022-04-27 19:58:39,842 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 14 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 19:58:39,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:58:40,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:58:40,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065182504] [2022-04-27 19:58:40,099 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:58:40,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624200183] [2022-04-27 19:58:40,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624200183] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 19:58:40,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 19:58:40,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-27 19:58:40,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471186180] [2022-04-27 19:58:40,099 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 19:58:40,100 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66 [2022-04-27 19:58:40,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:58:40,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 19:58:40,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:40,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 19:58:40,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:58:40,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 19:58:40,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 19:58:40,133 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 19:58:40,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:40,649 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2022-04-27 19:58:40,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 19:58:40,650 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66 [2022-04-27 19:58:40,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:58:40,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 19:58:40,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-27 19:58:40,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 19:58:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-27 19:58:40,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 58 transitions. [2022-04-27 19:58:40,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:40,695 INFO L225 Difference]: With dead ends: 96 [2022-04-27 19:58:40,695 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 19:58:40,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-27 19:58:40,696 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 19:58:40,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 300 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 19:58:40,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 19:58:40,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 19:58:40,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:58:40,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:40,702 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:40,702 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:40,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:40,703 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-04-27 19:58:40,703 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-27 19:58:40,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:40,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:40,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 19:58:40,704 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 19:58:40,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:40,705 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-04-27 19:58:40,705 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-27 19:58:40,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:40,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:40,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:58:40,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:58:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:40,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2022-04-27 19:58:40,706 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 66 [2022-04-27 19:58:40,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:58:40,707 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2022-04-27 19:58:40,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 19:58:40,707 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-27 19:58:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-27 19:58:40,707 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:58:40,707 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:58:40,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 19:58:40,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 19:58:40,914 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:58:40,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:58:40,914 INFO L85 PathProgramCache]: Analyzing trace with hash 291122568, now seen corresponding path program 7 times [2022-04-27 19:58:40,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:58:40,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878984981] [2022-04-27 19:58:40,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:40,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:58:40,933 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:58:40,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [779060419] [2022-04-27 19:58:40,933 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 19:58:40,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:40,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:58:40,934 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:58:40,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 19:58:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:41,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-27 19:58:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:41,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:58:41,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {4732#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {4732#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {4732#true} is VALID [2022-04-27 19:58:41,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {4732#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4732#true} {4732#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {4732#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {4732#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {4752#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:41,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {4752#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4752#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:41,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {4752#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4752#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:41,909 INFO L272 TraceCheckUtils]: 8: Hoare triple {4752#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4732#true} is VALID [2022-04-27 19:58:41,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {4732#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4732#true} is VALID [2022-04-27 19:58:41,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {4732#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {4732#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,910 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4732#true} {4752#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4752#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:41,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {4752#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4777#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 19:58:41,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {4777#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4777#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 19:58:41,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {4777#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4777#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 19:58:41,911 INFO L272 TraceCheckUtils]: 16: Hoare triple {4777#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4732#true} is VALID [2022-04-27 19:58:41,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {4732#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4732#true} is VALID [2022-04-27 19:58:41,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {4732#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {4732#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,912 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4732#true} {4777#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4777#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-27 19:58:41,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {4777#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4802#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 19:58:41,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {4802#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4802#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 19:58:41,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {4802#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4802#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 19:58:41,915 INFO L272 TraceCheckUtils]: 24: Hoare triple {4802#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4732#true} is VALID [2022-04-27 19:58:41,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {4732#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4732#true} is VALID [2022-04-27 19:58:41,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {4732#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {4732#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,916 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4732#true} {4802#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4802#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 19:58:41,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {4802#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4827#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 19:58:41,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {4827#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4827#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 19:58:41,917 INFO L290 TraceCheckUtils]: 31: Hoare triple {4827#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4827#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 19:58:41,917 INFO L272 TraceCheckUtils]: 32: Hoare triple {4827#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4732#true} is VALID [2022-04-27 19:58:41,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {4732#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4732#true} is VALID [2022-04-27 19:58:41,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {4732#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,917 INFO L290 TraceCheckUtils]: 35: Hoare triple {4732#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,918 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4732#true} {4827#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4827#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-27 19:58:41,918 INFO L290 TraceCheckUtils]: 37: Hoare triple {4827#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4852#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:41,919 INFO L290 TraceCheckUtils]: 38: Hoare triple {4852#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4852#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:41,919 INFO L290 TraceCheckUtils]: 39: Hoare triple {4852#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4852#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:41,919 INFO L272 TraceCheckUtils]: 40: Hoare triple {4852#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4732#true} is VALID [2022-04-27 19:58:41,919 INFO L290 TraceCheckUtils]: 41: Hoare triple {4732#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4732#true} is VALID [2022-04-27 19:58:41,919 INFO L290 TraceCheckUtils]: 42: Hoare triple {4732#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,919 INFO L290 TraceCheckUtils]: 43: Hoare triple {4732#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,920 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4732#true} {4852#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4852#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:41,920 INFO L290 TraceCheckUtils]: 45: Hoare triple {4852#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4) (< 0 main_~k~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4877#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:41,920 INFO L290 TraceCheckUtils]: 46: Hoare triple {4877#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4877#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:41,921 INFO L290 TraceCheckUtils]: 47: Hoare triple {4877#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4877#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:41,921 INFO L272 TraceCheckUtils]: 48: Hoare triple {4877#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4732#true} is VALID [2022-04-27 19:58:41,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {4732#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4732#true} is VALID [2022-04-27 19:58:41,921 INFO L290 TraceCheckUtils]: 50: Hoare triple {4732#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {4732#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,921 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4732#true} {4877#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4877#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:41,922 INFO L290 TraceCheckUtils]: 53: Hoare triple {4877#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4) (< 0 main_~k~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4902#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:41,922 INFO L290 TraceCheckUtils]: 54: Hoare triple {4902#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4902#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:41,923 INFO L290 TraceCheckUtils]: 55: Hoare triple {4902#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4902#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:41,923 INFO L272 TraceCheckUtils]: 56: Hoare triple {4902#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4732#true} is VALID [2022-04-27 19:58:41,923 INFO L290 TraceCheckUtils]: 57: Hoare triple {4732#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4732#true} is VALID [2022-04-27 19:58:41,923 INFO L290 TraceCheckUtils]: 58: Hoare triple {4732#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,923 INFO L290 TraceCheckUtils]: 59: Hoare triple {4732#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,923 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4732#true} {4902#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4902#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-27 19:58:41,924 INFO L290 TraceCheckUtils]: 61: Hoare triple {4902#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 19:58:41,924 INFO L290 TraceCheckUtils]: 62: Hoare triple {4927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 19:58:41,924 INFO L290 TraceCheckUtils]: 63: Hoare triple {4927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 19:58:41,924 INFO L272 TraceCheckUtils]: 64: Hoare triple {4927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4732#true} is VALID [2022-04-27 19:58:41,925 INFO L290 TraceCheckUtils]: 65: Hoare triple {4732#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4732#true} is VALID [2022-04-27 19:58:41,925 INFO L290 TraceCheckUtils]: 66: Hoare triple {4732#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,925 INFO L290 TraceCheckUtils]: 67: Hoare triple {4732#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4732#true} is VALID [2022-04-27 19:58:41,925 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4732#true} {4927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 19:58:41,928 INFO L290 TraceCheckUtils]: 69: Hoare triple {4927#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {4952#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-27 19:58:41,928 INFO L272 TraceCheckUtils]: 70: Hoare triple {4952#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {4956#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:58:41,928 INFO L290 TraceCheckUtils]: 71: Hoare triple {4956#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4960#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:58:41,929 INFO L290 TraceCheckUtils]: 72: Hoare triple {4960#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {4733#false} is VALID [2022-04-27 19:58:41,929 INFO L290 TraceCheckUtils]: 73: Hoare triple {4733#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4733#false} is VALID [2022-04-27 19:58:41,929 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 16 proven. 112 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 19:58:41,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:58:42,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:58:42,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878984981] [2022-04-27 19:58:42,698 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:58:42,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779060419] [2022-04-27 19:58:42,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779060419] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 19:58:42,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 19:58:42,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-27 19:58:42,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465801924] [2022-04-27 19:58:42,698 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 19:58:42,699 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2022-04-27 19:58:42,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:58:42,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 19:58:42,735 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-27 19:58:42,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 19:58:42,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:58:42,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 19:58:42,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-04-27 19:58:42,735 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 19:58:43,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:43,389 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2022-04-27 19:58:43,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 19:58:43,389 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2022-04-27 19:58:43,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:58:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 19:58:43,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 63 transitions. [2022-04-27 19:58:43,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 19:58:43,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 63 transitions. [2022-04-27 19:58:43,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 63 transitions. [2022-04-27 19:58:43,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:43,445 INFO L225 Difference]: With dead ends: 96 [2022-04-27 19:58:43,445 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 19:58:43,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-04-27 19:58:43,446 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 19:58:43,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 352 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 19:58:43,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 19:58:43,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 19:58:43,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:58:43,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:43,449 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:43,449 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:43,450 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-04-27 19:58:43,450 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-27 19:58:43,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:43,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:43,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 19:58:43,451 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 19:58:43,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:43,452 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-04-27 19:58:43,452 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-27 19:58:43,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:43,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:43,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:58:43,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:58:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2022-04-27 19:58:43,453 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 74 [2022-04-27 19:58:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:58:43,453 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2022-04-27 19:58:43,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 19:58:43,453 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-27 19:58:43,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-27 19:58:43,454 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:58:43,454 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:58:43,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 19:58:43,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 19:58:43,659 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:58:43,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:58:43,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1938494313, now seen corresponding path program 8 times [2022-04-27 19:58:43,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:58:43,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436399514] [2022-04-27 19:58:43,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:43,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:58:43,669 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:58:43,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [990659856] [2022-04-27 19:58:43,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 19:58:43,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:43,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:58:43,670 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:58:43,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 19:58:44,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 19:58:44,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 19:58:44,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 19:58:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:44,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:58:44,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {5540#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {5540#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {5540#true} is VALID [2022-04-27 19:58:44,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {5540#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5540#true} {5540#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {5540#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {5540#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {5560#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:44,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {5560#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5560#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:44,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {5560#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5560#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:44,636 INFO L272 TraceCheckUtils]: 8: Hoare triple {5560#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5540#true} is VALID [2022-04-27 19:58:44,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {5540#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5540#true} is VALID [2022-04-27 19:58:44,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {5540#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {5540#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,637 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5540#true} {5560#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5560#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:44,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {5560#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5585#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 19:58:44,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {5585#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5585#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 19:58:44,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {5585#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5585#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 19:58:44,638 INFO L272 TraceCheckUtils]: 16: Hoare triple {5585#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5540#true} is VALID [2022-04-27 19:58:44,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {5540#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5540#true} is VALID [2022-04-27 19:58:44,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {5540#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {5540#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,639 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5540#true} {5585#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5585#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 19:58:44,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {5585#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5610#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 19:58:44,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {5610#(and (= main_~y~0 2) (= main_~c~0 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5610#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 19:58:44,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {5610#(and (= main_~y~0 2) (= main_~c~0 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5610#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 19:58:44,640 INFO L272 TraceCheckUtils]: 24: Hoare triple {5610#(and (= main_~y~0 2) (= main_~c~0 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5540#true} is VALID [2022-04-27 19:58:44,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {5540#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5540#true} is VALID [2022-04-27 19:58:44,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {5540#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {5540#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,640 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5540#true} {5610#(and (= main_~y~0 2) (= main_~c~0 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5610#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-27 19:58:44,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {5610#(and (= main_~y~0 2) (= main_~c~0 2))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5635#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 19:58:44,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {5635#(and (= main_~y~0 3) (= main_~c~0 3))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5635#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 19:58:44,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {5635#(and (= main_~y~0 3) (= main_~c~0 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5635#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 19:58:44,642 INFO L272 TraceCheckUtils]: 32: Hoare triple {5635#(and (= main_~y~0 3) (= main_~c~0 3))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5540#true} is VALID [2022-04-27 19:58:44,642 INFO L290 TraceCheckUtils]: 33: Hoare triple {5540#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5540#true} is VALID [2022-04-27 19:58:44,642 INFO L290 TraceCheckUtils]: 34: Hoare triple {5540#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {5540#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,642 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5540#true} {5635#(and (= main_~y~0 3) (= main_~c~0 3))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5635#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-27 19:58:44,643 INFO L290 TraceCheckUtils]: 37: Hoare triple {5635#(and (= main_~y~0 3) (= main_~c~0 3))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5660#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 19:58:44,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {5660#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5660#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 19:58:44,643 INFO L290 TraceCheckUtils]: 39: Hoare triple {5660#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5660#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 19:58:44,643 INFO L272 TraceCheckUtils]: 40: Hoare triple {5660#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5540#true} is VALID [2022-04-27 19:58:44,643 INFO L290 TraceCheckUtils]: 41: Hoare triple {5540#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5540#true} is VALID [2022-04-27 19:58:44,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {5540#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {5540#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,644 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5540#true} {5660#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5660#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-27 19:58:44,644 INFO L290 TraceCheckUtils]: 45: Hoare triple {5660#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5685#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 19:58:44,645 INFO L290 TraceCheckUtils]: 46: Hoare triple {5685#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5685#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 19:58:44,645 INFO L290 TraceCheckUtils]: 47: Hoare triple {5685#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5685#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 19:58:44,645 INFO L272 TraceCheckUtils]: 48: Hoare triple {5685#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5540#true} is VALID [2022-04-27 19:58:44,645 INFO L290 TraceCheckUtils]: 49: Hoare triple {5540#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5540#true} is VALID [2022-04-27 19:58:44,645 INFO L290 TraceCheckUtils]: 50: Hoare triple {5540#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,645 INFO L290 TraceCheckUtils]: 51: Hoare triple {5540#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,646 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5540#true} {5685#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5685#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 19:58:44,646 INFO L290 TraceCheckUtils]: 53: Hoare triple {5685#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5710#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 19:58:44,646 INFO L290 TraceCheckUtils]: 54: Hoare triple {5710#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5710#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 19:58:44,647 INFO L290 TraceCheckUtils]: 55: Hoare triple {5710#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5710#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 19:58:44,647 INFO L272 TraceCheckUtils]: 56: Hoare triple {5710#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5540#true} is VALID [2022-04-27 19:58:44,647 INFO L290 TraceCheckUtils]: 57: Hoare triple {5540#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5540#true} is VALID [2022-04-27 19:58:44,647 INFO L290 TraceCheckUtils]: 58: Hoare triple {5540#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,647 INFO L290 TraceCheckUtils]: 59: Hoare triple {5540#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,647 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5540#true} {5710#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5710#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-27 19:58:44,648 INFO L290 TraceCheckUtils]: 61: Hoare triple {5710#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5735#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-27 19:58:44,648 INFO L290 TraceCheckUtils]: 62: Hoare triple {5735#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5735#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-27 19:58:44,648 INFO L290 TraceCheckUtils]: 63: Hoare triple {5735#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5735#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-27 19:58:44,649 INFO L272 TraceCheckUtils]: 64: Hoare triple {5735#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5540#true} is VALID [2022-04-27 19:58:44,649 INFO L290 TraceCheckUtils]: 65: Hoare triple {5540#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5540#true} is VALID [2022-04-27 19:58:44,649 INFO L290 TraceCheckUtils]: 66: Hoare triple {5540#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,649 INFO L290 TraceCheckUtils]: 67: Hoare triple {5540#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,649 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5540#true} {5735#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5735#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-27 19:58:44,650 INFO L290 TraceCheckUtils]: 69: Hoare triple {5735#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5760#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 19:58:44,650 INFO L290 TraceCheckUtils]: 70: Hoare triple {5760#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5760#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 19:58:44,650 INFO L290 TraceCheckUtils]: 71: Hoare triple {5760#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5760#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 19:58:44,650 INFO L272 TraceCheckUtils]: 72: Hoare triple {5760#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5540#true} is VALID [2022-04-27 19:58:44,650 INFO L290 TraceCheckUtils]: 73: Hoare triple {5540#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5540#true} is VALID [2022-04-27 19:58:44,650 INFO L290 TraceCheckUtils]: 74: Hoare triple {5540#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,650 INFO L290 TraceCheckUtils]: 75: Hoare triple {5540#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5540#true} is VALID [2022-04-27 19:58:44,651 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {5540#true} {5760#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5760#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-27 19:58:44,651 INFO L290 TraceCheckUtils]: 77: Hoare triple {5760#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {5785#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-27 19:58:44,652 INFO L272 TraceCheckUtils]: 78: Hoare triple {5785#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {5789#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:58:44,652 INFO L290 TraceCheckUtils]: 79: Hoare triple {5789#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5793#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:58:44,653 INFO L290 TraceCheckUtils]: 80: Hoare triple {5793#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {5541#false} is VALID [2022-04-27 19:58:44,653 INFO L290 TraceCheckUtils]: 81: Hoare triple {5541#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5541#false} is VALID [2022-04-27 19:58:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 18 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-27 19:58:44,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:58:44,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:58:44,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436399514] [2022-04-27 19:58:44,906 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:58:44,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990659856] [2022-04-27 19:58:44,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990659856] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 19:58:44,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 19:58:44,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 19:58:44,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142232761] [2022-04-27 19:58:44,906 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 19:58:44,907 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82 [2022-04-27 19:58:44,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:58:44,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 19:58:44,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:44,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 19:58:44,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:58:44,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 19:58:44,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 19:58:44,948 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 19:58:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:45,716 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2022-04-27 19:58:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 19:58:45,717 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82 [2022-04-27 19:58:45,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:58:45,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 19:58:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 68 transitions. [2022-04-27 19:58:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 19:58:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 68 transitions. [2022-04-27 19:58:45,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 68 transitions. [2022-04-27 19:58:45,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:45,772 INFO L225 Difference]: With dead ends: 96 [2022-04-27 19:58:45,772 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 19:58:45,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-27 19:58:45,773 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 19:58:45,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 408 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 19:58:45,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 19:58:45,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 19:58:45,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:58:45,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:45,776 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:45,776 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:45,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:45,778 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-27 19:58:45,778 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-27 19:58:45,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:45,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:45,778 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 19:58:45,778 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-27 19:58:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:45,779 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-27 19:58:45,779 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-27 19:58:45,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:45,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:45,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:58:45,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:58:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2022-04-27 19:58:45,781 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 82 [2022-04-27 19:58:45,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:58:45,781 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2022-04-27 19:58:45,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 19:58:45,781 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-27 19:58:45,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-27 19:58:45,781 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:58:45,781 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:58:45,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-27 19:58:45,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 19:58:45,986 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:58:45,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:58:45,987 INFO L85 PathProgramCache]: Analyzing trace with hash 757893194, now seen corresponding path program 9 times [2022-04-27 19:58:45,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:58:45,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041682223] [2022-04-27 19:58:45,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:45,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:58:45,998 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:58:45,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083135694] [2022-04-27 19:58:45,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 19:58:45,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:45,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:58:45,999 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:58:46,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 19:58:46,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-04-27 19:58:46,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 19:58:46,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-27 19:58:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 19:58:46,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 19:58:46,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {6223#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {6223#true} [62] 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| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {6223#true} is VALID [2022-04-27 19:58:46,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {6223#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6223#true} {6223#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {6223#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {6223#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {6243#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:46,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {6243#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6243#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:46,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {6243#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6243#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:46,853 INFO L272 TraceCheckUtils]: 8: Hoare triple {6243#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6223#true} is VALID [2022-04-27 19:58:46,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {6223#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6223#true} is VALID [2022-04-27 19:58:46,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {6223#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {6223#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,854 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6223#true} {6243#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6243#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 19:58:46,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {6243#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6268#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 19:58:46,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {6268#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6268#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 19:58:46,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {6268#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6268#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 19:58:46,855 INFO L272 TraceCheckUtils]: 16: Hoare triple {6268#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6223#true} is VALID [2022-04-27 19:58:46,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {6223#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6223#true} is VALID [2022-04-27 19:58:46,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {6223#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {6223#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,856 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6223#true} {6268#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6268#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 19:58:46,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {6268#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6293#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 19:58:46,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {6293#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6293#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 19:58:46,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {6293#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6293#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 19:58:46,860 INFO L272 TraceCheckUtils]: 24: Hoare triple {6293#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6223#true} is VALID [2022-04-27 19:58:46,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {6223#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6223#true} is VALID [2022-04-27 19:58:46,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {6223#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {6223#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,860 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6223#true} {6293#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6293#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 19:58:46,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {6293#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6318#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 19:58:46,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {6318#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6318#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 19:58:46,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {6318#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6318#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 19:58:46,862 INFO L272 TraceCheckUtils]: 32: Hoare triple {6318#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6223#true} is VALID [2022-04-27 19:58:46,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {6223#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6223#true} is VALID [2022-04-27 19:58:46,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {6223#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {6223#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,862 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6223#true} {6318#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6318#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 19:58:46,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {6318#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6343#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-27 19:58:46,872 INFO L290 TraceCheckUtils]: 38: Hoare triple {6343#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6343#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-27 19:58:46,872 INFO L290 TraceCheckUtils]: 39: Hoare triple {6343#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6343#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-27 19:58:46,872 INFO L272 TraceCheckUtils]: 40: Hoare triple {6343#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6223#true} is VALID [2022-04-27 19:58:46,872 INFO L290 TraceCheckUtils]: 41: Hoare triple {6223#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6223#true} is VALID [2022-04-27 19:58:46,872 INFO L290 TraceCheckUtils]: 42: Hoare triple {6223#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,872 INFO L290 TraceCheckUtils]: 43: Hoare triple {6223#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,873 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6223#true} {6343#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6343#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} is VALID [2022-04-27 19:58:46,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {6343#(and (= 2 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6368#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 19:58:46,873 INFO L290 TraceCheckUtils]: 46: Hoare triple {6368#(and (= 5 main_~c~0) (= 5 main_~y~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6368#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 19:58:46,874 INFO L290 TraceCheckUtils]: 47: Hoare triple {6368#(and (= 5 main_~c~0) (= 5 main_~y~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6368#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 19:58:46,874 INFO L272 TraceCheckUtils]: 48: Hoare triple {6368#(and (= 5 main_~c~0) (= 5 main_~y~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6223#true} is VALID [2022-04-27 19:58:46,874 INFO L290 TraceCheckUtils]: 49: Hoare triple {6223#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6223#true} is VALID [2022-04-27 19:58:46,874 INFO L290 TraceCheckUtils]: 50: Hoare triple {6223#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,874 INFO L290 TraceCheckUtils]: 51: Hoare triple {6223#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,874 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6223#true} {6368#(and (= 5 main_~c~0) (= 5 main_~y~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6368#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-27 19:58:46,875 INFO L290 TraceCheckUtils]: 53: Hoare triple {6368#(and (= 5 main_~c~0) (= 5 main_~y~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6393#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 19:58:46,875 INFO L290 TraceCheckUtils]: 54: Hoare triple {6393#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6393#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 19:58:46,876 INFO L290 TraceCheckUtils]: 55: Hoare triple {6393#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6393#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 19:58:46,876 INFO L272 TraceCheckUtils]: 56: Hoare triple {6393#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6223#true} is VALID [2022-04-27 19:58:46,876 INFO L290 TraceCheckUtils]: 57: Hoare triple {6223#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6223#true} is VALID [2022-04-27 19:58:46,876 INFO L290 TraceCheckUtils]: 58: Hoare triple {6223#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,876 INFO L290 TraceCheckUtils]: 59: Hoare triple {6223#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,876 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6223#true} {6393#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6393#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 19:58:46,877 INFO L290 TraceCheckUtils]: 61: Hoare triple {6393#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6418#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 19:58:46,877 INFO L290 TraceCheckUtils]: 62: Hoare triple {6418#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6418#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 19:58:46,878 INFO L290 TraceCheckUtils]: 63: Hoare triple {6418#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6418#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 19:58:46,878 INFO L272 TraceCheckUtils]: 64: Hoare triple {6418#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6223#true} is VALID [2022-04-27 19:58:46,878 INFO L290 TraceCheckUtils]: 65: Hoare triple {6223#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6223#true} is VALID [2022-04-27 19:58:46,878 INFO L290 TraceCheckUtils]: 66: Hoare triple {6223#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,878 INFO L290 TraceCheckUtils]: 67: Hoare triple {6223#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,878 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6223#true} {6418#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6418#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-27 19:58:46,879 INFO L290 TraceCheckUtils]: 69: Hoare triple {6418#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6443#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 19:58:46,879 INFO L290 TraceCheckUtils]: 70: Hoare triple {6443#(and (= main_~y~0 8) (= main_~c~0 8))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6443#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 19:58:46,879 INFO L290 TraceCheckUtils]: 71: Hoare triple {6443#(and (= main_~y~0 8) (= main_~c~0 8))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6443#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 19:58:46,880 INFO L272 TraceCheckUtils]: 72: Hoare triple {6443#(and (= main_~y~0 8) (= main_~c~0 8))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6223#true} is VALID [2022-04-27 19:58:46,880 INFO L290 TraceCheckUtils]: 73: Hoare triple {6223#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6223#true} is VALID [2022-04-27 19:58:46,880 INFO L290 TraceCheckUtils]: 74: Hoare triple {6223#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,880 INFO L290 TraceCheckUtils]: 75: Hoare triple {6223#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,880 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {6223#true} {6443#(and (= main_~y~0 8) (= main_~c~0 8))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6443#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-27 19:58:46,880 INFO L290 TraceCheckUtils]: 77: Hoare triple {6443#(and (= main_~y~0 8) (= main_~c~0 8))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6468#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 19:58:46,881 INFO L290 TraceCheckUtils]: 78: Hoare triple {6468#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6468#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 19:58:46,881 INFO L290 TraceCheckUtils]: 79: Hoare triple {6468#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 10) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6468#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 19:58:46,881 INFO L272 TraceCheckUtils]: 80: Hoare triple {6468#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6223#true} is VALID [2022-04-27 19:58:46,881 INFO L290 TraceCheckUtils]: 81: Hoare triple {6223#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6223#true} is VALID [2022-04-27 19:58:46,881 INFO L290 TraceCheckUtils]: 82: Hoare triple {6223#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,881 INFO L290 TraceCheckUtils]: 83: Hoare triple {6223#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6223#true} is VALID [2022-04-27 19:58:46,882 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {6223#true} {6468#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6468#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-27 19:58:46,882 INFO L290 TraceCheckUtils]: 85: Hoare triple {6468#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {6493#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-27 19:58:46,883 INFO L272 TraceCheckUtils]: 86: Hoare triple {6493#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {6497#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 19:58:46,883 INFO L290 TraceCheckUtils]: 87: Hoare triple {6497#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6501#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 19:58:46,884 INFO L290 TraceCheckUtils]: 88: Hoare triple {6501#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {6224#false} is VALID [2022-04-27 19:58:46,884 INFO L290 TraceCheckUtils]: 89: Hoare triple {6224#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6224#false} is VALID [2022-04-27 19:58:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 20 proven. 180 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 19:58:46,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 19:58:47,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 19:58:47,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041682223] [2022-04-27 19:58:47,226 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 19:58:47,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083135694] [2022-04-27 19:58:47,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083135694] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 19:58:47,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 19:58:47,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-27 19:58:47,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260739796] [2022-04-27 19:58:47,226 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 19:58:47,226 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 90 [2022-04-27 19:58:47,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 19:58:47,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:47,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:47,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 19:58:47,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 19:58:47,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 19:58:47,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-27 19:58:47,269 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:48,156 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2022-04-27 19:58:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 19:58:48,156 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 90 [2022-04-27 19:58:48,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 19:58:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 73 transitions. [2022-04-27 19:58:48,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 73 transitions. [2022-04-27 19:58:48,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 73 transitions. [2022-04-27 19:58:48,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 19:58:48,215 INFO L225 Difference]: With dead ends: 98 [2022-04-27 19:58:48,215 INFO L226 Difference]: Without dead ends: 95 [2022-04-27 19:58:48,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-27 19:58:48,215 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 19:58:48,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 468 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 19:58:48,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-27 19:58:48,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-04-27 19:58:48,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 19:58:48,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 19:58:48,218 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 19:58:48,218 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 19:58:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:48,219 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2022-04-27 19:58:48,219 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-27 19:58:48,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:48,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:48,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 95 states. [2022-04-27 19:58:48,220 INFO L87 Difference]: Start difference. First operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 95 states. [2022-04-27 19:58:48,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 19:58:48,221 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2022-04-27 19:58:48,221 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-27 19:58:48,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 19:58:48,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 19:58:48,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 19:58:48,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 19:58:48,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 19:58:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2022-04-27 19:58:48,222 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 90 [2022-04-27 19:58:48,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 19:58:48,222 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2022-04-27 19:58:48,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 12 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 19:58:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-27 19:58:48,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-27 19:58:48,223 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 19:58:48,223 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 19:58:48,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 19:58:48,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:48,432 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 19:58:48,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 19:58:48,432 INFO L85 PathProgramCache]: Analyzing trace with hash -953190739, now seen corresponding path program 3 times [2022-04-27 19:58:48,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 19:58:48,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022034595] [2022-04-27 19:58:48,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 19:58:48,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 19:58:48,443 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 19:58:48,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [313948646] [2022-04-27 19:58:48,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 19:58:48,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 19:58:48,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 19:58:48,444 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 19:58:48,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 19:58:48,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 19:58:48,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-27 19:58:48,976 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 19:58:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 19:58:49,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 19:58:49,041 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 19:58:49,042 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 19:58:49,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 19:58:49,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 19:58:49,250 INFO L356 BasicCegarLoop]: Path program histogram: [9, 3, 1, 1, 1, 1] [2022-04-27 19:58:49,252 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 19:58:49,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 07:58:49 BasicIcfg [2022-04-27 19:58:49,282 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 19:58:49,282 INFO L158 Benchmark]: Toolchain (without parser) took 53789.99ms. Allocated memory was 216.0MB in the beginning and 329.3MB in the end (delta: 113.2MB). Free memory was 158.4MB in the beginning and 234.8MB in the end (delta: -76.4MB). Peak memory consumption was 37.6MB. Max. memory is 8.0GB. [2022-04-27 19:58:49,282 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 216.0MB. Free memory is still 174.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 19:58:49,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.91ms. Allocated memory was 216.0MB in the beginning and 329.3MB in the end (delta: 113.2MB). Free memory was 158.2MB in the beginning and 300.7MB in the end (delta: -142.4MB). Peak memory consumption was 14.3MB. Max. memory is 8.0GB. [2022-04-27 19:58:49,283 INFO L158 Benchmark]: Boogie Preprocessor took 23.92ms. Allocated memory is still 329.3MB. Free memory was 300.7MB in the beginning and 299.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 19:58:49,283 INFO L158 Benchmark]: RCFGBuilder took 246.31ms. Allocated memory is still 329.3MB. Free memory was 299.0MB in the beginning and 287.0MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 19:58:49,287 INFO L158 Benchmark]: IcfgTransformer took 19.71ms. Allocated memory is still 329.3MB. Free memory was 287.0MB in the beginning and 286.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 19:58:49,287 INFO L158 Benchmark]: TraceAbstraction took 53296.97ms. Allocated memory is still 329.3MB. Free memory was 285.4MB in the beginning and 234.8MB in the end (delta: 50.6MB). Peak memory consumption was 51.2MB. Max. memory is 8.0GB. [2022-04-27 19:58:49,291 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 216.0MB. Free memory is still 174.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.91ms. Allocated memory was 216.0MB in the beginning and 329.3MB in the end (delta: 113.2MB). Free memory was 158.2MB in the beginning and 300.7MB in the end (delta: -142.4MB). Peak memory consumption was 14.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.92ms. Allocated memory is still 329.3MB. Free memory was 300.7MB in the beginning and 299.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 246.31ms. Allocated memory is still 329.3MB. Free memory was 299.0MB in the beginning and 287.0MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 19.71ms. Allocated memory is still 329.3MB. Free memory was 287.0MB in the beginning and 286.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 53296.97ms. Allocated memory is still 329.3MB. Free memory was 285.4MB in the beginning and 234.8MB in the end (delta: 50.6MB). Peak memory consumption was 51.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int counter = 0; VAL [\old(counter)=13, counter=0] [L19] short k; [L20] long long y, x, c; [L21] k = __VERIFIER_nondet_short() [L23] y = 0 [L24] x = 0 [L25] c = 0 VAL [\old(counter)=0, c=0, counter=0, k=11, x=0, y=0] [L27] EXPR counter++ VAL [\old(counter)=0, c=0, counter=1, counter++=0, k=11, x=0, y=0] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=0, counter=1, k=11, x=0, y=0] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=1, counter=1, k=11, x=1, y=1] [L27] EXPR counter++ VAL [\old(counter)=0, c=1, counter=2, counter++=1, k=11, x=1, y=1] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=1, counter=2, k=11, x=1, y=1] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=2, counter=2, k=11, x=9, y=2] [L27] EXPR counter++ VAL [\old(counter)=0, c=2, counter=3, counter++=2, k=11, x=9, y=2] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=2, counter=3, k=11, x=9, y=2] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=3, counter=3, k=11, x=36, y=3] [L27] EXPR counter++ VAL [\old(counter)=0, c=3, counter=4, counter++=3, k=11, x=36, y=3] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=3, counter=4, k=11, x=36, y=3] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=4, counter=4, k=11, x=100, y=4] [L27] EXPR counter++ VAL [\old(counter)=0, c=4, counter=5, counter++=4, k=11, x=100, y=4] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=4, counter=5, k=11, x=100, y=4] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=5, counter=5, k=11, x=225, y=5] [L27] EXPR counter++ VAL [\old(counter)=0, c=5, counter=6, counter++=5, k=11, x=225, y=5] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=5, counter=6, k=11, x=225, y=5] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=6, counter=6, k=11, x=441, y=6] [L27] EXPR counter++ VAL [\old(counter)=0, c=6, counter=7, counter++=6, k=11, x=441, y=6] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=6, counter=7, k=11, x=441, y=6] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=7, counter=7, k=11, x=784, y=7] [L27] EXPR counter++ VAL [\old(counter)=0, c=7, counter=8, counter++=7, k=11, x=784, y=7] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=7, counter=8, k=11, x=784, y=7] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=8, counter=8, k=11, x=1296, y=8] [L27] EXPR counter++ VAL [\old(counter)=0, c=8, counter=9, counter++=8, k=11, x=1296, y=8] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=8, counter=9, k=11, x=1296, y=8] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=9, counter=9, k=11, x=2025, y=9] [L27] EXPR counter++ VAL [\old(counter)=0, c=9, counter=10, counter++=9, k=11, x=2025, y=9] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(counter)=0, c=9, counter=10, k=11, x=2025, y=9] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [\old(counter)=0, c=10, counter=10, k=11, x=3025, y=10] [L27] EXPR counter++ VAL [\old(counter)=0, c=10, counter=11, counter++=10, k=11, x=3025, y=10] [L27] COND FALSE !(counter++<10) [L37] CALL __VERIFIER_assert(k*y - (y*y) == 0) VAL [\old(cond)=0, \old(counter)=0, counter=11] [L10] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] [L12] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.2s, OverallIterations: 16, TraceHistogramMax: 11, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 229 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 225 mSDsluCounter, 2802 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2335 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2008 IncrementalHoareTripleChecker+Invalid, 2087 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 467 mSDtfsCounter, 2008 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 935 GetRequests, 740 SyntacticMatches, 11 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=15, InterpolantAutomatonStates: 150, 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, 15 MinimizatonAttempts, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 40.3s InterpolantComputationTime, 733 NumberOfCodeBlocks, 733 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 707 ConstructedInterpolants, 0 QuantifiedInterpolants, 3105 SizeOfPredicates, 30 NumberOfNonLiveVariables, 2155 ConjunctsInSsa, 304 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 818/1574 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-27 19:58:49,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...