/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/loop-invgen/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 17:03:18,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 17:03:18,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 17:03:18,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 17:03:18,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 17:03:18,791 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 17:03:18,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 17:03:18,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 17:03:18,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 17:03:18,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 17:03:18,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 17:03:18,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 17:03:18,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 17:03:18,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 17:03:18,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 17:03:18,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 17:03:18,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 17:03:18,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 17:03:18,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 17:03:18,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 17:03:18,813 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 17:03:18,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 17:03:18,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 17:03:18,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 17:03:18,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 17:03:18,821 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 17:03:18,821 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 17:03:18,821 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 17:03:18,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 17:03:18,822 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 17:03:18,823 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 17:03:18,823 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 17:03:18,824 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 17:03:18,825 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 17:03:18,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 17:03:18,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 17:03:18,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 17:03:18,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 17:03:18,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 17:03:18,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 17:03:18,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 17:03:18,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 17:03:18,829 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 17:03:18,837 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 17:03:18,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 17:03:18,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 17:03:18,838 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 17:03:18,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 17:03:18,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 17:03:18,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 17:03:18,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 17:03:18,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 17:03:18,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 17:03:18,839 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 17:03:18,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 17:03:18,839 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 17:03:18,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 17:03:18,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 17:03:18,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 17:03:18,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 17:03:18,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 17:03:18,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:03:18,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 17:03:18,840 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 17:03:18,841 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 17:03:18,841 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 17:03:19,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 17:03:19,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 17:03:19,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 17:03:19,064 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 17:03:19,064 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 17:03:19,065 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6.i [2022-04-07 17:03:19,121 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47aa21014/f40f45f379e54a468be447409ea798b1/FLAGfef0a594b [2022-04-07 17:03:19,460 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 17:03:19,461 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2022-04-07 17:03:19,465 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47aa21014/f40f45f379e54a468be447409ea798b1/FLAGfef0a594b [2022-04-07 17:03:19,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47aa21014/f40f45f379e54a468be447409ea798b1 [2022-04-07 17:03:19,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 17:03:19,477 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 17:03:19,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 17:03:19,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 17:03:19,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 17:03:19,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:03:19" (1/1) ... [2022-04-07 17:03:19,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc3b4ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:19, skipping insertion in model container [2022-04-07 17:03:19,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:03:19" (1/1) ... [2022-04-07 17:03:19,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 17:03:19,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 17:03:19,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i[893,906] [2022-04-07 17:03:19,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:03:19,662 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 17:03:19,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i[893,906] [2022-04-07 17:03:19,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:03:19,693 INFO L208 MainTranslator]: Completed translation [2022-04-07 17:03:19,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:19 WrapperNode [2022-04-07 17:03:19,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 17:03:19,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 17:03:19,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 17:03:19,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 17:03:19,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:19" (1/1) ... [2022-04-07 17:03:19,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:19" (1/1) ... [2022-04-07 17:03:19,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:19" (1/1) ... [2022-04-07 17:03:19,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:19" (1/1) ... [2022-04-07 17:03:19,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:19" (1/1) ... [2022-04-07 17:03:19,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:19" (1/1) ... [2022-04-07 17:03:19,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:19" (1/1) ... [2022-04-07 17:03:19,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 17:03:19,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 17:03:19,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 17:03:19,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 17:03:19,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:19" (1/1) ... [2022-04-07 17:03:19,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:03:19,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:19,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 17:03:19,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 17:03:19,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 17:03:19,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 17:03:19,797 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 17:03:19,797 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 17:03:19,797 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 17:03:19,798 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 17:03:19,798 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 17:03:19,798 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 17:03:19,798 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 17:03:19,798 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 17:03:19,798 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 17:03:19,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 17:03:19,798 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 17:03:19,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 17:03:19,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 17:03:19,798 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 17:03:19,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 17:03:19,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 17:03:19,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 17:03:19,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 17:03:19,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 17:03:19,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 17:03:19,843 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 17:03:19,844 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 17:03:20,039 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 17:03:20,044 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 17:03:20,044 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-07 17:03:20,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:03:20 BoogieIcfgContainer [2022-04-07 17:03:20,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 17:03:20,046 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 17:03:20,046 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 17:03:20,047 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 17:03:20,049 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:03:20" (1/1) ... [2022-04-07 17:03:20,051 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 17:03:20,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:03:20 BasicIcfg [2022-04-07 17:03:20,071 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 17:03:20,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 17:03:20,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 17:03:20,081 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 17:03:20,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 05:03:19" (1/4) ... [2022-04-07 17:03:20,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ee9964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:03:20, skipping insertion in model container [2022-04-07 17:03:20,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:19" (2/4) ... [2022-04-07 17:03:20,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ee9964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:03:20, skipping insertion in model container [2022-04-07 17:03:20,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:03:20" (3/4) ... [2022-04-07 17:03:20,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ee9964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:03:20, skipping insertion in model container [2022-04-07 17:03:20,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:03:20" (4/4) ... [2022-04-07 17:03:20,084 INFO L111 eAbstractionObserver]: Analyzing ICFG nested6.iJordan [2022-04-07 17:03:20,087 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 17:03:20,087 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 17:03:20,124 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 17:03:20,139 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 17:03:20,139 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 17:03:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 22 states have internal predecessors, (31), 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-07 17:03:20,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-07 17:03:20,161 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:20,162 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:20,162 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:20,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1002152396, now seen corresponding path program 1 times [2022-04-07 17:03:20,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:20,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526984507] [2022-04-07 17:03:20,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:20,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:20,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:20,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {33#true} is VALID [2022-04-07 17:03:20,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 17:03:20,406 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 17:03:20,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:03:20,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {33#true} is VALID [2022-04-07 17:03:20,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 17:03:20,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 17:03:20,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 17:03:20,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {33#true} is VALID [2022-04-07 17:03:20,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 17:03:20,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-07 17:03:20,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#(<= main_~n~0 main_~k~0)} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-07 17:03:20,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#(<= main_~n~0 main_~k~0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-07 17:03:20,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {38#(<= main_~n~0 main_~k~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-07 17:03:20,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(<= main_~n~0 main_~k~0)} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-07 17:03:20,412 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#(<= main_~n~0 main_~k~0)} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {39#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:03:20,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L18: 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] {40#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:03:20,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#(not (= __VERIFIER_assert_~cond 0))} [132] L18-->L19: 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[] {34#false} is VALID [2022-04-07 17:03:20,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-07 17:03:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:20,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:20,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526984507] [2022-04-07 17:03:20,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526984507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:03:20,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:03:20,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:03:20,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607977042] [2022-04-07 17:03:20,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:03:20,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2022-04-07 17:03:20,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:20,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:20,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:20,438 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:03:20,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:20,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:03:20,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:03:20,458 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 22 states have internal predecessors, (31), 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 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:20,826 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-07 17:03:20,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 17:03:20,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2022-04-07 17:03:20,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:20,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-07 17:03:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-07 17:03:20,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2022-04-07 17:03:20,893 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-07 17:03:20,901 INFO L225 Difference]: With dead ends: 37 [2022-04-07 17:03:20,902 INFO L226 Difference]: Without dead ends: 29 [2022-04-07 17:03:20,903 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 17:03:20,907 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:20,908 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 52 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:03:20,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-07 17:03:20,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-07 17:03:20,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:20,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:20,934 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:20,934 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:20,945 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-07 17:03:20,945 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-07 17:03:20,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:20,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:20,947 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-07 17:03:20,947 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-07 17:03:20,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:20,950 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-07 17:03:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-07 17:03:20,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:20,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:20,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:20,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-07 17:03:20,957 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2022-04-07 17:03:20,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:20,958 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-07 17:03:20,962 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:20,963 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-07 17:03:20,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 17:03:20,963 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:20,964 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:20,964 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 17:03:20,964 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:20,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:20,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1031567308, now seen corresponding path program 1 times [2022-04-07 17:03:20,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:20,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974704718] [2022-04-07 17:03:20,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:20,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:21,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:21,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {176#true} is VALID [2022-04-07 17:03:21,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#true} is VALID [2022-04-07 17:03:21,061 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {176#true} {176#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#true} is VALID [2022-04-07 17:03:21,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {176#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:03:21,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {176#true} is VALID [2022-04-07 17:03:21,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#true} is VALID [2022-04-07 17:03:21,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176#true} {176#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#true} is VALID [2022-04-07 17:03:21,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {176#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#true} is VALID [2022-04-07 17:03:21,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {176#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {176#true} is VALID [2022-04-07 17:03:21,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {176#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {176#true} is VALID [2022-04-07 17:03:21,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {176#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {176#true} is VALID [2022-04-07 17:03:21,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {176#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {176#true} is VALID [2022-04-07 17:03:21,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {176#true} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {181#(<= (* main_~i~0 2) main_~j~0)} is VALID [2022-04-07 17:03:21,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {181#(<= (* main_~i~0 2) main_~j~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {181#(<= (* main_~i~0 2) main_~j~0)} is VALID [2022-04-07 17:03:21,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {181#(<= (* main_~i~0 2) main_~j~0)} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {182#(<= (* main_~i~0 2) main_~k~0)} is VALID [2022-04-07 17:03:21,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {182#(<= (* main_~i~0 2) main_~k~0)} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {182#(<= (* main_~i~0 2) main_~k~0)} is VALID [2022-04-07 17:03:21,065 INFO L272 TraceCheckUtils]: 13: Hoare triple {182#(<= (* main_~i~0 2) main_~k~0)} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {183#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:03:21,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {183#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L18: 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] {184#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:03:21,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {184#(not (= __VERIFIER_assert_~cond 0))} [132] L18-->L19: 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[] {177#false} is VALID [2022-04-07 17:03:21,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {177#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {177#false} is VALID [2022-04-07 17:03:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:21,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:21,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974704718] [2022-04-07 17:03:21,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974704718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:03:21,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:03:21,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 17:03:21,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960204301] [2022-04-07 17:03:21,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:03:21,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-04-07 17:03:21,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:21,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:21,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:21,081 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 17:03:21,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:21,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 17:03:21,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-07 17:03:21,082 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:21,389 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-07 17:03:21,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 17:03:21,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-04-07 17:03:21,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-07 17:03:21,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-07 17:03:21,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-04-07 17:03:21,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:21,432 INFO L225 Difference]: With dead ends: 39 [2022-04-07 17:03:21,432 INFO L226 Difference]: Without dead ends: 39 [2022-04-07 17:03:21,432 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-07 17:03:21,433 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 29 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:21,433 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 45 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:03:21,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-07 17:03:21,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-04-07 17:03:21,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:21,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:21,436 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:21,437 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:21,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:21,438 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-07 17:03:21,439 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-07 17:03:21,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:21,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:21,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 39 states. [2022-04-07 17:03:21,439 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 39 states. [2022-04-07 17:03:21,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:21,444 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-07 17:03:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-07 17:03:21,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:21,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:21,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:21,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:21,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:21,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-07 17:03:21,446 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 17 [2022-04-07 17:03:21,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:21,446 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-07 17:03:21,446 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-07 17:03:21,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 17:03:21,447 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:21,447 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:21,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 17:03:21,447 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:21,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:21,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1187235258, now seen corresponding path program 1 times [2022-04-07 17:03:21,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:21,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10324050] [2022-04-07 17:03:21,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:21,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:21,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:21,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {360#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {348#true} is VALID [2022-04-07 17:03:21,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {348#true} is VALID [2022-04-07 17:03:21,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {348#true} {348#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {348#true} is VALID [2022-04-07 17:03:21,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 17:03:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:21,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {348#true} [130] __VERIFIER_assertENTRY-->L18: 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] {348#true} is VALID [2022-04-07 17:03:21,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#true} [133] L18-->L18-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[] {348#true} is VALID [2022-04-07 17:03:21,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {348#true} is VALID [2022-04-07 17:03:21,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {353#(<= main_~k~0 main_~n~0)} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {353#(<= main_~k~0 main_~n~0)} is VALID [2022-04-07 17:03:21,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {360#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:03:21,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {348#true} is VALID [2022-04-07 17:03:21,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {348#true} is VALID [2022-04-07 17:03:21,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {348#true} is VALID [2022-04-07 17:03:21,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {348#true} is VALID [2022-04-07 17:03:21,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {348#true} is VALID [2022-04-07 17:03:21,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {348#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {348#true} is VALID [2022-04-07 17:03:21,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {348#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {353#(<= main_~k~0 main_~n~0)} is VALID [2022-04-07 17:03:21,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {353#(<= main_~k~0 main_~n~0)} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {353#(<= main_~k~0 main_~n~0)} is VALID [2022-04-07 17:03:21,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {353#(<= main_~k~0 main_~n~0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {353#(<= main_~k~0 main_~n~0)} is VALID [2022-04-07 17:03:21,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {353#(<= main_~k~0 main_~n~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {353#(<= main_~k~0 main_~n~0)} is VALID [2022-04-07 17:03:21,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {353#(<= main_~k~0 main_~n~0)} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {353#(<= main_~k~0 main_~n~0)} is VALID [2022-04-07 17:03:21,548 INFO L272 TraceCheckUtils]: 12: Hoare triple {353#(<= main_~k~0 main_~n~0)} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {348#true} is VALID [2022-04-07 17:03:21,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {348#true} [130] __VERIFIER_assertENTRY-->L18: 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] {348#true} is VALID [2022-04-07 17:03:21,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {348#true} [133] L18-->L18-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[] {348#true} is VALID [2022-04-07 17:03:21,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {348#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {348#true} is VALID [2022-04-07 17:03:21,549 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {348#true} {353#(<= main_~k~0 main_~n~0)} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {353#(<= main_~k~0 main_~n~0)} is VALID [2022-04-07 17:03:21,550 INFO L272 TraceCheckUtils]: 17: Hoare triple {353#(<= main_~k~0 main_~n~0)} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {358#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:03:21,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {358#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L18: 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] {359#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:03:21,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {359#(not (= __VERIFIER_assert_~cond 0))} [132] L18-->L19: 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[] {349#false} is VALID [2022-04-07 17:03:21,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {349#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {349#false} is VALID [2022-04-07 17:03:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:21,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:21,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10324050] [2022-04-07 17:03:21,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10324050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:03:21,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:03:21,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:03:21,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179739471] [2022-04-07 17:03:21,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:03:21,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 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 21 [2022-04-07 17:03:21,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:21,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:21,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:21,565 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:03:21,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:21,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:03:21,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:03:21,566 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:21,814 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-07 17:03:21,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 17:03:21,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 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 21 [2022-04-07 17:03:21,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-07 17:03:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-07 17:03:21,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2022-04-07 17:03:21,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:21,860 INFO L225 Difference]: With dead ends: 44 [2022-04-07 17:03:21,861 INFO L226 Difference]: Without dead ends: 44 [2022-04-07 17:03:21,861 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 17:03:21,862 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:21,862 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 42 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:03:21,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-07 17:03:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-07 17:03:21,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:21,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 17:03:21,865 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 17:03:21,866 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 17:03:21,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:21,867 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-07 17:03:21,867 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-07 17:03:21,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:21,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:21,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-07 17:03:21,868 INFO L87 Difference]: Start difference. First operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-07 17:03:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:21,870 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-07 17:03:21,870 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-07 17:03:21,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:21,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:21,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:21,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 17:03:21,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-04-07 17:03:21,872 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 21 [2022-04-07 17:03:21,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:21,873 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-04-07 17:03:21,873 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:21,873 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-07 17:03:21,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 17:03:21,873 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:21,874 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:21,874 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 17:03:21,874 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:21,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:21,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1420692427, now seen corresponding path program 1 times [2022-04-07 17:03:21,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:21,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766061435] [2022-04-07 17:03:21,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:21,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:21,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:21,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {547#true} is VALID [2022-04-07 17:03:21,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {547#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-07 17:03:21,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {547#true} {547#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-07 17:03:21,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-07 17:03:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:21,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {547#true} [130] __VERIFIER_assertENTRY-->L18: 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] {547#true} is VALID [2022-04-07 17:03:21,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {547#true} [133] L18-->L18-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[] {547#true} is VALID [2022-04-07 17:03:21,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {547#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-07 17:03:21,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {547#true} {554#(<= (+ main_~k~0 1) main_~n~0)} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {554#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-07 17:03:21,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {547#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:03:21,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {547#true} is VALID [2022-04-07 17:03:21,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {547#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-07 17:03:21,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {547#true} {547#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-07 17:03:21,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {547#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-07 17:03:21,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {547#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {547#true} is VALID [2022-04-07 17:03:21,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {547#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-07 17:03:21,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {547#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-07 17:03:21,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {547#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {552#(= main_~i~0 0)} is VALID [2022-04-07 17:03:21,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {552#(= main_~i~0 0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {553#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-07 17:03:21,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {553#(<= (+ main_~j~0 1) main_~n~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {553#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-07 17:03:21,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {553#(<= (+ main_~j~0 1) main_~n~0)} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {554#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-07 17:03:21,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(<= (+ main_~k~0 1) main_~n~0)} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {554#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-07 17:03:21,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#(<= (+ main_~k~0 1) main_~n~0)} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {554#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-07 17:03:21,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#(<= (+ main_~k~0 1) main_~n~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {554#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-07 17:03:21,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {554#(<= (+ main_~k~0 1) main_~n~0)} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {554#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-07 17:03:21,989 INFO L272 TraceCheckUtils]: 16: Hoare triple {554#(<= (+ main_~k~0 1) main_~n~0)} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {547#true} is VALID [2022-04-07 17:03:21,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {547#true} [130] __VERIFIER_assertENTRY-->L18: 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] {547#true} is VALID [2022-04-07 17:03:21,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#true} [133] L18-->L18-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[] {547#true} is VALID [2022-04-07 17:03:21,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-07 17:03:21,991 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {547#true} {554#(<= (+ main_~k~0 1) main_~n~0)} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {554#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-07 17:03:21,991 INFO L272 TraceCheckUtils]: 21: Hoare triple {554#(<= (+ main_~k~0 1) main_~n~0)} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {559#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:03:21,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {559#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L18: 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] {560#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:03:21,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {560#(not (= __VERIFIER_assert_~cond 0))} [132] L18-->L19: 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[] {548#false} is VALID [2022-04-07 17:03:21,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {548#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {548#false} is VALID [2022-04-07 17:03:21,992 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-07 17:03:21,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:21,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766061435] [2022-04-07 17:03:21,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766061435] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:03:21,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820436511] [2022-04-07 17:03:21,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:21,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:22,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:22,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:03:22,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 17:03:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:22,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 17:03:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:22,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:03:22,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {547#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-07 17:03:22,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {547#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {547#true} is VALID [2022-04-07 17:03:22,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {547#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-07 17:03:22,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {547#true} {547#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-07 17:03:22,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {547#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-07 17:03:22,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {547#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {547#true} is VALID [2022-04-07 17:03:22,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {547#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-07 17:03:22,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {547#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-07 17:03:22,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {547#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {589#(<= main_~i~0 0)} is VALID [2022-04-07 17:03:22,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {589#(<= main_~i~0 0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {593#(and (< (div (- main_~j~0) (- 2)) main_~n~0) (<= (div (- main_~j~0) (- 2)) 0))} is VALID [2022-04-07 17:03:22,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {593#(and (< (div (- main_~j~0) (- 2)) main_~n~0) (<= (div (- main_~j~0) (- 2)) 0))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {593#(and (< (div (- main_~j~0) (- 2)) main_~n~0) (<= (div (- main_~j~0) (- 2)) 0))} is VALID [2022-04-07 17:03:22,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {593#(and (< (div (- main_~j~0) (- 2)) main_~n~0) (<= (div (- main_~j~0) (- 2)) 0))} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {600#(and (<= (div (* (- 1) main_~k~0) (- 2)) 0) (< (div (* (- 1) main_~k~0) (- 2)) main_~n~0))} is VALID [2022-04-07 17:03:22,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {600#(and (<= (div (* (- 1) main_~k~0) (- 2)) 0) (< (div (* (- 1) main_~k~0) (- 2)) main_~n~0))} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {548#false} is VALID [2022-04-07 17:03:22,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {548#false} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {548#false} is VALID [2022-04-07 17:03:22,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {548#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {548#false} is VALID [2022-04-07 17:03:22,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {548#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {548#false} is VALID [2022-04-07 17:03:22,900 INFO L272 TraceCheckUtils]: 16: Hoare triple {548#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {548#false} is VALID [2022-04-07 17:03:22,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {548#false} [130] __VERIFIER_assertENTRY-->L18: 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] {548#false} is VALID [2022-04-07 17:03:22,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {548#false} [133] L18-->L18-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[] {548#false} is VALID [2022-04-07 17:03:22,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {548#false} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {548#false} is VALID [2022-04-07 17:03:22,900 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {548#false} {548#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {548#false} is VALID [2022-04-07 17:03:22,900 INFO L272 TraceCheckUtils]: 21: Hoare triple {548#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {548#false} is VALID [2022-04-07 17:03:22,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {548#false} [130] __VERIFIER_assertENTRY-->L18: 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] {548#false} is VALID [2022-04-07 17:03:22,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {548#false} [132] L18-->L19: 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[] {548#false} is VALID [2022-04-07 17:03:22,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {548#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {548#false} is VALID [2022-04-07 17:03:22,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-07 17:03:22,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 17:03:22,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820436511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:03:22,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 17:03:22,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-04-07 17:03:22,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148591960] [2022-04-07 17:03:22,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:03:22,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-07 17:03:22,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:22,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:22,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:22,916 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 17:03:22,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:22,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 17:03:22,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-07 17:03:22,917 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:23,091 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-07 17:03:23,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 17:03:23,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-07 17:03:23,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:23,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-07 17:03:23,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-07 17:03:23,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-07 17:03:23,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:23,147 INFO L225 Difference]: With dead ends: 72 [2022-04-07 17:03:23,147 INFO L226 Difference]: Without dead ends: 72 [2022-04-07 17:03:23,148 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-04-07 17:03:23,148 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:23,151 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 90 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:03:23,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-07 17:03:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 48. [2022-04-07 17:03:23,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:23,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 48 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 17:03:23,157 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 48 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 17:03:23,158 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 48 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 17:03:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:23,162 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-07 17:03:23,163 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2022-04-07 17:03:23,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:23,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:23,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 72 states. [2022-04-07 17:03:23,164 INFO L87 Difference]: Start difference. First operand has 48 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 72 states. [2022-04-07 17:03:23,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:23,166 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-07 17:03:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2022-04-07 17:03:23,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:23,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:23,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:23,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 17:03:23,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-07 17:03:23,169 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 25 [2022-04-07 17:03:23,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:23,169 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-07 17:03:23,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:23,169 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-07 17:03:23,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 17:03:23,170 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:23,170 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:23,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 17:03:23,375 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:23,376 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:23,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:23,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1754984885, now seen corresponding path program 1 times [2022-04-07 17:03:23,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:23,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714609401] [2022-04-07 17:03:23,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:23,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:23,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:23,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {907#true} is VALID [2022-04-07 17:03:23,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {907#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,465 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {907#true} {907#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-07 17:03:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:23,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {907#true} [130] __VERIFIER_assertENTRY-->L18: 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] {907#true} is VALID [2022-04-07 17:03:23,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {907#true} [133] L18-->L18-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[] {907#true} is VALID [2022-04-07 17:03:23,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {907#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {907#true} {914#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {919#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-07 17:03:23,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-07 17:03:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:23,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {907#true} [130] __VERIFIER_assertENTRY-->L18: 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] {907#true} is VALID [2022-04-07 17:03:23,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {907#true} [133] L18-->L18-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[] {907#true} is VALID [2022-04-07 17:03:23,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {907#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {907#true} {920#(<= main_~k~0 main_~n~0)} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {920#(<= main_~k~0 main_~n~0)} is VALID [2022-04-07 17:03:23,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {907#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:03:23,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {907#true} is VALID [2022-04-07 17:03:23,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {907#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {907#true} {907#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {907#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {907#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {907#true} is VALID [2022-04-07 17:03:23,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {907#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {907#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {912#(= main_~i~0 0)} is VALID [2022-04-07 17:03:23,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#(= main_~i~0 0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {913#(and (<= (+ main_~j~0 1) (+ main_~i~0 main_~n~0)) (= main_~i~0 0))} is VALID [2022-04-07 17:03:23,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {913#(and (<= (+ main_~j~0 1) (+ main_~i~0 main_~n~0)) (= main_~i~0 0))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {913#(and (<= (+ main_~j~0 1) (+ main_~i~0 main_~n~0)) (= main_~i~0 0))} is VALID [2022-04-07 17:03:23,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#(and (<= (+ main_~j~0 1) (+ main_~i~0 main_~n~0)) (= main_~i~0 0))} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {914#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} is VALID [2022-04-07 17:03:23,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {914#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {914#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} is VALID [2022-04-07 17:03:23,492 INFO L272 TraceCheckUtils]: 13: Hoare triple {914#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {907#true} is VALID [2022-04-07 17:03:23,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {907#true} [130] __VERIFIER_assertENTRY-->L18: 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] {907#true} is VALID [2022-04-07 17:03:23,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {907#true} [133] L18-->L18-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[] {907#true} is VALID [2022-04-07 17:03:23,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {907#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,493 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {907#true} {914#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {919#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-07 17:03:23,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {919#(<= (+ main_~k~0 1) main_~n~0)} [131] L37-1-->L36-2: Formula: (= v_main_~k~0_10 (+ v_main_~k~0_11 1)) InVars {main_~k~0=v_main_~k~0_11} OutVars{main_~k~0=v_main_~k~0_10, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {920#(<= main_~k~0 main_~n~0)} is VALID [2022-04-07 17:03:23,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {920#(<= main_~k~0 main_~n~0)} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {920#(<= main_~k~0 main_~n~0)} is VALID [2022-04-07 17:03:23,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {920#(<= main_~k~0 main_~n~0)} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {920#(<= main_~k~0 main_~n~0)} is VALID [2022-04-07 17:03:23,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {920#(<= main_~k~0 main_~n~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {920#(<= main_~k~0 main_~n~0)} is VALID [2022-04-07 17:03:23,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {920#(<= main_~k~0 main_~n~0)} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {920#(<= main_~k~0 main_~n~0)} is VALID [2022-04-07 17:03:23,495 INFO L272 TraceCheckUtils]: 23: Hoare triple {920#(<= main_~k~0 main_~n~0)} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {907#true} is VALID [2022-04-07 17:03:23,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {907#true} [130] __VERIFIER_assertENTRY-->L18: 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] {907#true} is VALID [2022-04-07 17:03:23,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {907#true} [133] L18-->L18-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[] {907#true} is VALID [2022-04-07 17:03:23,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {907#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,496 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {907#true} {920#(<= main_~k~0 main_~n~0)} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {920#(<= main_~k~0 main_~n~0)} is VALID [2022-04-07 17:03:23,497 INFO L272 TraceCheckUtils]: 28: Hoare triple {920#(<= main_~k~0 main_~n~0)} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {925#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:03:23,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {925#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L18: 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] {926#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:03:23,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {926#(not (= __VERIFIER_assert_~cond 0))} [132] L18-->L19: 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[] {908#false} is VALID [2022-04-07 17:03:23,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {908#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {908#false} is VALID [2022-04-07 17:03:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 17:03:23,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:23,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714609401] [2022-04-07 17:03:23,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714609401] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:03:23,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158151943] [2022-04-07 17:03:23,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:23,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:23,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:23,500 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:03:23,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 17:03:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:23,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 17:03:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:23,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:03:23,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {907#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {907#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {907#true} is VALID [2022-04-07 17:03:23,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {907#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {907#true} {907#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {907#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {907#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {907#true} is VALID [2022-04-07 17:03:23,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {907#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {907#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {907#true} is VALID [2022-04-07 17:03:23,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {907#true} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {907#true} is VALID [2022-04-07 17:03:23,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {907#true} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {907#true} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {964#(<= main_~k~0 main_~j~0)} is VALID [2022-04-07 17:03:23,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {964#(<= main_~k~0 main_~j~0)} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {964#(<= main_~k~0 main_~j~0)} is VALID [2022-04-07 17:03:23,716 INFO L272 TraceCheckUtils]: 13: Hoare triple {964#(<= main_~k~0 main_~j~0)} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {907#true} is VALID [2022-04-07 17:03:23,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {907#true} [130] __VERIFIER_assertENTRY-->L18: 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] {907#true} is VALID [2022-04-07 17:03:23,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {907#true} [133] L18-->L18-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[] {907#true} is VALID [2022-04-07 17:03:23,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {907#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,717 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {907#true} {964#(<= main_~k~0 main_~j~0)} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {964#(<= main_~k~0 main_~j~0)} is VALID [2022-04-07 17:03:23,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {964#(<= main_~k~0 main_~j~0)} [131] L37-1-->L36-2: Formula: (= v_main_~k~0_10 (+ v_main_~k~0_11 1)) InVars {main_~k~0=v_main_~k~0_11} OutVars{main_~k~0=v_main_~k~0_10, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {986#(<= main_~k~0 (+ main_~j~0 1))} is VALID [2022-04-07 17:03:23,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {986#(<= main_~k~0 (+ main_~j~0 1))} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {990#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2022-04-07 17:03:23,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {990#(<= main_~n~0 (+ main_~j~0 1))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {994#(<= main_~n~0 main_~j~0)} is VALID [2022-04-07 17:03:23,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {994#(<= main_~n~0 main_~j~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {908#false} is VALID [2022-04-07 17:03:23,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {908#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {908#false} is VALID [2022-04-07 17:03:23,727 INFO L272 TraceCheckUtils]: 23: Hoare triple {908#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {908#false} is VALID [2022-04-07 17:03:23,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {908#false} [130] __VERIFIER_assertENTRY-->L18: 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] {908#false} is VALID [2022-04-07 17:03:23,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {908#false} [133] L18-->L18-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[] {908#false} is VALID [2022-04-07 17:03:23,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {908#false} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {908#false} is VALID [2022-04-07 17:03:23,728 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {908#false} {908#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {908#false} is VALID [2022-04-07 17:03:23,728 INFO L272 TraceCheckUtils]: 28: Hoare triple {908#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {908#false} is VALID [2022-04-07 17:03:23,728 INFO L290 TraceCheckUtils]: 29: Hoare triple {908#false} [130] __VERIFIER_assertENTRY-->L18: 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] {908#false} is VALID [2022-04-07 17:03:23,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {908#false} [132] L18-->L19: 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[] {908#false} is VALID [2022-04-07 17:03:23,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {908#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {908#false} is VALID [2022-04-07 17:03:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-07 17:03:23,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:03:23,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {908#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {908#false} is VALID [2022-04-07 17:03:23,880 INFO L290 TraceCheckUtils]: 30: Hoare triple {908#false} [132] L18-->L19: 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[] {908#false} is VALID [2022-04-07 17:03:23,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {908#false} [130] __VERIFIER_assertENTRY-->L18: 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] {908#false} is VALID [2022-04-07 17:03:23,880 INFO L272 TraceCheckUtils]: 28: Hoare triple {908#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {908#false} is VALID [2022-04-07 17:03:23,880 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {907#true} {908#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {908#false} is VALID [2022-04-07 17:03:23,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {907#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {907#true} [133] L18-->L18-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[] {907#true} is VALID [2022-04-07 17:03:23,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {907#true} [130] __VERIFIER_assertENTRY-->L18: 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] {907#true} is VALID [2022-04-07 17:03:23,880 INFO L272 TraceCheckUtils]: 23: Hoare triple {908#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {907#true} is VALID [2022-04-07 17:03:23,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {908#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {908#false} is VALID [2022-04-07 17:03:23,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {994#(<= main_~n~0 main_~j~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {908#false} is VALID [2022-04-07 17:03:23,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {990#(<= main_~n~0 (+ main_~j~0 1))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {994#(<= main_~n~0 main_~j~0)} is VALID [2022-04-07 17:03:23,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {986#(<= main_~k~0 (+ main_~j~0 1))} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {990#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2022-04-07 17:03:23,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {964#(<= main_~k~0 main_~j~0)} [131] L37-1-->L36-2: Formula: (= v_main_~k~0_10 (+ v_main_~k~0_11 1)) InVars {main_~k~0=v_main_~k~0_11} OutVars{main_~k~0=v_main_~k~0_10, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {986#(<= main_~k~0 (+ main_~j~0 1))} is VALID [2022-04-07 17:03:23,883 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {907#true} {964#(<= main_~k~0 main_~j~0)} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {964#(<= main_~k~0 main_~j~0)} is VALID [2022-04-07 17:03:23,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {907#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {907#true} [133] L18-->L18-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[] {907#true} is VALID [2022-04-07 17:03:23,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {907#true} [130] __VERIFIER_assertENTRY-->L18: 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] {907#true} is VALID [2022-04-07 17:03:23,883 INFO L272 TraceCheckUtils]: 13: Hoare triple {964#(<= main_~k~0 main_~j~0)} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {907#true} is VALID [2022-04-07 17:03:23,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {964#(<= main_~k~0 main_~j~0)} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {964#(<= main_~k~0 main_~j~0)} is VALID [2022-04-07 17:03:23,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {907#true} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {964#(<= main_~k~0 main_~j~0)} is VALID [2022-04-07 17:03:23,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {907#true} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {907#true} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {907#true} is VALID [2022-04-07 17:03:23,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {907#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {907#true} is VALID [2022-04-07 17:03:23,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {907#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {907#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {907#true} is VALID [2022-04-07 17:03:23,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {907#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {907#true} {907#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {907#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {907#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {907#true} is VALID [2022-04-07 17:03:23,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {907#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-07 17:03:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 17:03:23,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158151943] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:03:23,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:03:23,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 14 [2022-04-07 17:03:23,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347387801] [2022-04-07 17:03:23,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:03:23,892 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2022-04-07 17:03:23,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:23,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 17:03:23,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:23,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 17:03:23,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:23,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 17:03:23,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-07 17:03:23,921 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 17:03:24,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:24,994 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2022-04-07 17:03:24,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-07 17:03:24,995 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2022-04-07 17:03:24,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 17:03:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 93 transitions. [2022-04-07 17:03:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 17:03:25,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 93 transitions. [2022-04-07 17:03:25,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 93 transitions. [2022-04-07 17:03:25,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:25,112 INFO L225 Difference]: With dead ends: 94 [2022-04-07 17:03:25,112 INFO L226 Difference]: Without dead ends: 94 [2022-04-07 17:03:25,113 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2022-04-07 17:03:25,113 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 82 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:25,114 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 66 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 17:03:25,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-07 17:03:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 66. [2022-04-07 17:03:25,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:25,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 66 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 17:03:25,125 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 66 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 17:03:25,126 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 66 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 17:03:25,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:25,129 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2022-04-07 17:03:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2022-04-07 17:03:25,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:25,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:25,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 94 states. [2022-04-07 17:03:25,130 INFO L87 Difference]: Start difference. First operand has 66 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 94 states. [2022-04-07 17:03:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:25,137 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2022-04-07 17:03:25,138 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2022-04-07 17:03:25,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:25,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:25,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:25,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:25,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 17:03:25,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2022-04-07 17:03:25,140 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 32 [2022-04-07 17:03:25,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:25,140 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2022-04-07 17:03:25,141 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 17:03:25,141 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2022-04-07 17:03:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-07 17:03:25,141 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:25,141 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:25,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 17:03:25,353 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:25,353 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:25,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:25,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1763990758, now seen corresponding path program 1 times [2022-04-07 17:03:25,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:25,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373542284] [2022-04-07 17:03:25,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:25,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:25,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:25,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {1535#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1516#true} is VALID [2022-04-07 17:03:25,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {1516#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:25,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1516#true} {1516#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:25,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-07 17:03:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:25,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {1516#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1516#true} is VALID [2022-04-07 17:03:25,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {1516#true} [133] L18-->L18-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[] {1516#true} is VALID [2022-04-07 17:03:25,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {1516#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:25,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1516#true} {1523#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1523#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:25,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-07 17:03:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:25,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {1516#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1516#true} is VALID [2022-04-07 17:03:25,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {1516#true} [133] L18-->L18-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[] {1516#true} is VALID [2022-04-07 17:03:25,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {1516#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:25,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1516#true} {1517#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1517#false} is VALID [2022-04-07 17:03:25,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {1516#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1535#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:03:25,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {1535#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1516#true} is VALID [2022-04-07 17:03:25,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {1516#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:25,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1516#true} {1516#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:25,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {1516#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:25,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {1516#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {1516#true} is VALID [2022-04-07 17:03:25,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {1516#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:25,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {1516#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:25,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {1516#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {1521#(= main_~i~0 0)} is VALID [2022-04-07 17:03:25,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {1521#(= main_~i~0 0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1522#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-07 17:03:25,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {1522#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1522#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-07 17:03:25,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {1522#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {1523#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:25,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {1523#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {1523#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:25,469 INFO L272 TraceCheckUtils]: 13: Hoare triple {1523#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1516#true} is VALID [2022-04-07 17:03:25,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {1516#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1516#true} is VALID [2022-04-07 17:03:25,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {1516#true} [133] L18-->L18-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[] {1516#true} is VALID [2022-04-07 17:03:25,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {1516#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:25,472 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1516#true} {1523#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1523#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:25,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {1523#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} [131] L37-1-->L36-2: Formula: (= v_main_~k~0_10 (+ v_main_~k~0_11 1)) InVars {main_~k~0=v_main_~k~0_11} OutVars{main_~k~0=v_main_~k~0_10, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1528#(and (<= main_~k~0 (+ (* main_~i~0 2) 1)) (= main_~i~0 0))} is VALID [2022-04-07 17:03:25,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {1528#(and (<= main_~k~0 (+ (* main_~i~0 2) 1)) (= main_~i~0 0))} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {1529#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-07 17:03:25,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {1529#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {1529#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-07 17:03:25,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {1529#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {1529#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-07 17:03:25,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {1529#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {1530#(<= main_~n~0 main_~i~0)} is VALID [2022-04-07 17:03:25,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {1530#(<= main_~n~0 main_~i~0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1517#false} is VALID [2022-04-07 17:03:25,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {1517#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1517#false} is VALID [2022-04-07 17:03:25,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {1517#false} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {1517#false} is VALID [2022-04-07 17:03:25,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {1517#false} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {1517#false} is VALID [2022-04-07 17:03:25,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {1517#false} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {1517#false} is VALID [2022-04-07 17:03:25,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {1517#false} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {1517#false} is VALID [2022-04-07 17:03:25,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {1517#false} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {1517#false} is VALID [2022-04-07 17:03:25,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {1517#false} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1517#false} is VALID [2022-04-07 17:03:25,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {1517#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1517#false} is VALID [2022-04-07 17:03:25,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {1517#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {1517#false} is VALID [2022-04-07 17:03:25,475 INFO L272 TraceCheckUtils]: 33: Hoare triple {1517#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1516#true} is VALID [2022-04-07 17:03:25,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {1516#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1516#true} is VALID [2022-04-07 17:03:25,475 INFO L290 TraceCheckUtils]: 35: Hoare triple {1516#true} [133] L18-->L18-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[] {1516#true} is VALID [2022-04-07 17:03:25,475 INFO L290 TraceCheckUtils]: 36: Hoare triple {1516#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:25,476 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1516#true} {1517#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1517#false} is VALID [2022-04-07 17:03:25,476 INFO L272 TraceCheckUtils]: 38: Hoare triple {1517#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1517#false} is VALID [2022-04-07 17:03:25,476 INFO L290 TraceCheckUtils]: 39: Hoare triple {1517#false} [130] __VERIFIER_assertENTRY-->L18: 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] {1517#false} is VALID [2022-04-07 17:03:25,476 INFO L290 TraceCheckUtils]: 40: Hoare triple {1517#false} [132] L18-->L19: 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[] {1517#false} is VALID [2022-04-07 17:03:25,476 INFO L290 TraceCheckUtils]: 41: Hoare triple {1517#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1517#false} is VALID [2022-04-07 17:03:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-07 17:03:25,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:25,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373542284] [2022-04-07 17:03:25,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373542284] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:03:25,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083452316] [2022-04-07 17:03:25,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:25,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:25,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:25,479 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:03:25,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 17:03:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:25,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 17:03:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:25,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:03:26,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {1516#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:26,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {1516#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1516#true} is VALID [2022-04-07 17:03:26,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {1516#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:26,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1516#true} {1516#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:26,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {1516#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:26,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {1516#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {1516#true} is VALID [2022-04-07 17:03:26,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {1516#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:26,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {1516#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:26,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {1516#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {1563#(<= main_~i~0 0)} is VALID [2022-04-07 17:03:26,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {1563#(<= main_~i~0 0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1567#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:26,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {1567#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1567#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:26,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {1567#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {1574#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:26,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {1574#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {1574#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:26,044 INFO L272 TraceCheckUtils]: 13: Hoare triple {1574#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1516#true} is VALID [2022-04-07 17:03:26,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {1516#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1516#true} is VALID [2022-04-07 17:03:26,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {1516#true} [133] L18-->L18-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[] {1516#true} is VALID [2022-04-07 17:03:26,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {1516#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:26,044 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1516#true} {1574#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1574#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:26,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {1574#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} [131] L37-1-->L36-2: Formula: (= v_main_~k~0_10 (+ v_main_~k~0_11 1)) InVars {main_~k~0=v_main_~k~0_11} OutVars{main_~k~0=v_main_~k~0_10, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1596#(and (<= main_~i~0 0) (<= main_~k~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-07 17:03:26,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {1596#(and (<= main_~i~0 0) (<= main_~k~0 (+ (* main_~i~0 2) 1)))} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {1600#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-07 17:03:26,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {1600#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {1600#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-07 17:03:26,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {1600#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {1600#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-07 17:03:26,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {1600#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {1610#(and (<= (+ (div (+ (* (- 1) main_~n~0) 1) (- 2)) 1) main_~i~0) (<= (div (+ (* (- 1) main_~n~0) 1) (- 2)) 0))} is VALID [2022-04-07 17:03:26,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {1610#(and (<= (+ (div (+ (* (- 1) main_~n~0) 1) (- 2)) 1) main_~i~0) (<= (div (+ (* (- 1) main_~n~0) 1) (- 2)) 0))} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1517#false} is VALID [2022-04-07 17:03:26,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {1517#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1517#false} is VALID [2022-04-07 17:03:26,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {1517#false} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {1517#false} is VALID [2022-04-07 17:03:26,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {1517#false} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {1517#false} is VALID [2022-04-07 17:03:26,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {1517#false} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {1517#false} is VALID [2022-04-07 17:03:26,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {1517#false} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {1517#false} is VALID [2022-04-07 17:03:26,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {1517#false} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {1517#false} is VALID [2022-04-07 17:03:26,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {1517#false} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1517#false} is VALID [2022-04-07 17:03:26,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {1517#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1517#false} is VALID [2022-04-07 17:03:26,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {1517#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {1517#false} is VALID [2022-04-07 17:03:26,050 INFO L272 TraceCheckUtils]: 33: Hoare triple {1517#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1517#false} is VALID [2022-04-07 17:03:26,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {1517#false} [130] __VERIFIER_assertENTRY-->L18: 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] {1517#false} is VALID [2022-04-07 17:03:26,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {1517#false} [133] L18-->L18-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[] {1517#false} is VALID [2022-04-07 17:03:26,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {1517#false} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1517#false} is VALID [2022-04-07 17:03:26,051 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1517#false} {1517#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1517#false} is VALID [2022-04-07 17:03:26,051 INFO L272 TraceCheckUtils]: 38: Hoare triple {1517#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1517#false} is VALID [2022-04-07 17:03:26,051 INFO L290 TraceCheckUtils]: 39: Hoare triple {1517#false} [130] __VERIFIER_assertENTRY-->L18: 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] {1517#false} is VALID [2022-04-07 17:03:26,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {1517#false} [132] L18-->L19: 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[] {1517#false} is VALID [2022-04-07 17:03:26,051 INFO L290 TraceCheckUtils]: 41: Hoare triple {1517#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1517#false} is VALID [2022-04-07 17:03:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 17:03:26,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:03:26,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {1517#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1517#false} is VALID [2022-04-07 17:03:26,239 INFO L290 TraceCheckUtils]: 40: Hoare triple {1517#false} [132] L18-->L19: 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[] {1517#false} is VALID [2022-04-07 17:03:26,239 INFO L290 TraceCheckUtils]: 39: Hoare triple {1517#false} [130] __VERIFIER_assertENTRY-->L18: 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] {1517#false} is VALID [2022-04-07 17:03:26,239 INFO L272 TraceCheckUtils]: 38: Hoare triple {1517#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1517#false} is VALID [2022-04-07 17:03:26,239 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1516#true} {1517#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1517#false} is VALID [2022-04-07 17:03:26,239 INFO L290 TraceCheckUtils]: 36: Hoare triple {1516#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:26,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {1516#true} [133] L18-->L18-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[] {1516#true} is VALID [2022-04-07 17:03:26,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {1516#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1516#true} is VALID [2022-04-07 17:03:26,239 INFO L272 TraceCheckUtils]: 33: Hoare triple {1517#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1516#true} is VALID [2022-04-07 17:03:26,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {1517#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {1517#false} is VALID [2022-04-07 17:03:26,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {1517#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1517#false} is VALID [2022-04-07 17:03:26,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {1517#false} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1517#false} is VALID [2022-04-07 17:03:26,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {1517#false} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {1517#false} is VALID [2022-04-07 17:03:26,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {1517#false} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {1517#false} is VALID [2022-04-07 17:03:26,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {1517#false} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {1517#false} is VALID [2022-04-07 17:03:26,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {1517#false} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {1517#false} is VALID [2022-04-07 17:03:26,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {1517#false} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {1517#false} is VALID [2022-04-07 17:03:26,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {1517#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1517#false} is VALID [2022-04-07 17:03:26,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {1530#(<= main_~n~0 main_~i~0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1517#false} is VALID [2022-04-07 17:03:26,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {1725#(<= main_~n~0 (+ main_~i~0 1))} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {1530#(<= main_~n~0 main_~i~0)} is VALID [2022-04-07 17:03:26,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {1725#(<= main_~n~0 (+ main_~i~0 1))} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {1725#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2022-04-07 17:03:26,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {1725#(<= main_~n~0 (+ main_~i~0 1))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {1725#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2022-04-07 17:03:26,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {1735#(<= main_~k~0 (+ main_~i~0 1))} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {1725#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2022-04-07 17:03:26,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {1739#(<= main_~k~0 main_~i~0)} [131] L37-1-->L36-2: Formula: (= v_main_~k~0_10 (+ v_main_~k~0_11 1)) InVars {main_~k~0=v_main_~k~0_11} OutVars{main_~k~0=v_main_~k~0_10, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1735#(<= main_~k~0 (+ main_~i~0 1))} is VALID [2022-04-07 17:03:26,244 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1516#true} {1739#(<= main_~k~0 main_~i~0)} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1739#(<= main_~k~0 main_~i~0)} is VALID [2022-04-07 17:03:26,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {1516#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:26,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {1516#true} [133] L18-->L18-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[] {1516#true} is VALID [2022-04-07 17:03:26,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {1516#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1516#true} is VALID [2022-04-07 17:03:26,244 INFO L272 TraceCheckUtils]: 13: Hoare triple {1739#(<= main_~k~0 main_~i~0)} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1516#true} is VALID [2022-04-07 17:03:26,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {1739#(<= main_~k~0 main_~i~0)} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {1739#(<= main_~k~0 main_~i~0)} is VALID [2022-04-07 17:03:26,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {1761#(<= main_~j~0 main_~i~0)} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {1739#(<= main_~k~0 main_~i~0)} is VALID [2022-04-07 17:03:26,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {1761#(<= main_~j~0 main_~i~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1761#(<= main_~j~0 main_~i~0)} is VALID [2022-04-07 17:03:26,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {1563#(<= main_~i~0 0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1761#(<= main_~j~0 main_~i~0)} is VALID [2022-04-07 17:03:26,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {1516#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {1563#(<= main_~i~0 0)} is VALID [2022-04-07 17:03:26,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {1516#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:26,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {1516#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:26,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {1516#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {1516#true} is VALID [2022-04-07 17:03:26,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {1516#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:26,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1516#true} {1516#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:26,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {1516#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:26,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {1516#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1516#true} is VALID [2022-04-07 17:03:26,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {1516#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-07 17:03:26,251 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-07 17:03:26,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083452316] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:03:26,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:03:26,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-04-07 17:03:26,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115714007] [2022-04-07 17:03:26,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:03:26,252 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2022-04-07 17:03:26,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:26,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 17:03:26,298 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-07 17:03:26,299 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-07 17:03:26,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:26,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-07 17:03:26,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-04-07 17:03:26,302 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 17:03:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:26,910 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2022-04-07 17:03:26,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 17:03:26,910 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2022-04-07 17:03:26,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 17:03:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2022-04-07 17:03:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 17:03:26,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2022-04-07 17:03:26,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 72 transitions. [2022-04-07 17:03:26,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:26,982 INFO L225 Difference]: With dead ends: 86 [2022-04-07 17:03:26,982 INFO L226 Difference]: Without dead ends: 82 [2022-04-07 17:03:26,982 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2022-04-07 17:03:26,983 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 98 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:26,983 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 45 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 17:03:26,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-07 17:03:26,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2022-04-07 17:03:26,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:26,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 71 states, 52 states have (on average 1.25) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 17:03:26,993 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 71 states, 52 states have (on average 1.25) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 17:03:26,994 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 71 states, 52 states have (on average 1.25) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 17:03:26,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:26,996 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2022-04-07 17:03:26,997 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-04-07 17:03:26,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:26,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:26,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 52 states have (on average 1.25) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 82 states. [2022-04-07 17:03:26,998 INFO L87 Difference]: Start difference. First operand has 71 states, 52 states have (on average 1.25) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 82 states. [2022-04-07 17:03:27,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:27,000 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2022-04-07 17:03:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-04-07 17:03:27,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:27,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:27,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:27,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.25) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 17:03:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2022-04-07 17:03:27,003 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 42 [2022-04-07 17:03:27,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:27,003 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2022-04-07 17:03:27,003 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 17:03:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-07 17:03:27,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-07 17:03:27,004 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:27,004 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:27,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 17:03:27,205 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:27,205 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:27,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:27,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1192666941, now seen corresponding path program 1 times [2022-04-07 17:03:27,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:27,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489514770] [2022-04-07 17:03:27,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:27,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:27,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:27,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {2154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2132#true} is VALID [2022-04-07 17:03:27,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {2132#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2132#true} {2132#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 17:03:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:27,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {2132#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2132#true} is VALID [2022-04-07 17:03:27,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {2132#true} [133] L18-->L18-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[] {2132#true} is VALID [2022-04-07 17:03:27,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {2132#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2132#true} {2138#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2138#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-07 17:03:27,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 17:03:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:27,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {2132#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2132#true} is VALID [2022-04-07 17:03:27,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {2132#true} [133] L18-->L18-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[] {2132#true} is VALID [2022-04-07 17:03:27,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {2132#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2132#true} {2138#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [141] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2138#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-07 17:03:27,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-07 17:03:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:27,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {2132#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2132#true} is VALID [2022-04-07 17:03:27,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {2132#true} [133] L18-->L18-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[] {2132#true} is VALID [2022-04-07 17:03:27,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {2132#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2132#true} {2133#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2133#false} is VALID [2022-04-07 17:03:27,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {2132#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:03:27,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {2154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2132#true} is VALID [2022-04-07 17:03:27,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {2132#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2132#true} {2132#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {2132#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {2132#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {2132#true} is VALID [2022-04-07 17:03:27,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {2132#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {2132#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {2132#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {2137#(= main_~i~0 0)} is VALID [2022-04-07 17:03:27,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {2137#(= main_~i~0 0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2138#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-07 17:03:27,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {2138#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2138#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-07 17:03:27,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {2138#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {2138#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-07 17:03:27,307 INFO L272 TraceCheckUtils]: 12: Hoare triple {2138#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2132#true} is VALID [2022-04-07 17:03:27,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {2132#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2132#true} is VALID [2022-04-07 17:03:27,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {2132#true} [133] L18-->L18-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[] {2132#true} is VALID [2022-04-07 17:03:27,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {2132#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,308 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2132#true} {2138#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2138#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-07 17:03:27,308 INFO L272 TraceCheckUtils]: 17: Hoare triple {2138#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2132#true} is VALID [2022-04-07 17:03:27,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {2132#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2132#true} is VALID [2022-04-07 17:03:27,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {2132#true} [133] L18-->L18-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[] {2132#true} is VALID [2022-04-07 17:03:27,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {2132#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,309 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2132#true} {2138#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [141] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2138#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-07 17:03:27,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {2138#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2147#(and (<= main_~j~0 (+ (* main_~i~0 2) 1)) (= main_~i~0 0))} is VALID [2022-04-07 17:03:27,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {2147#(and (<= main_~j~0 (+ (* main_~i~0 2) 1)) (= main_~i~0 0))} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {2148#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-07 17:03:27,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {2148#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {2149#(<= main_~n~0 main_~i~0)} is VALID [2022-04-07 17:03:27,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {2149#(<= main_~n~0 main_~i~0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2133#false} is VALID [2022-04-07 17:03:27,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {2133#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2133#false} is VALID [2022-04-07 17:03:27,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {2133#false} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {2133#false} is VALID [2022-04-07 17:03:27,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {2133#false} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {2133#false} is VALID [2022-04-07 17:03:27,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {2133#false} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2133#false} is VALID [2022-04-07 17:03:27,311 INFO L290 TraceCheckUtils]: 30: Hoare triple {2133#false} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {2133#false} is VALID [2022-04-07 17:03:27,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {2133#false} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {2133#false} is VALID [2022-04-07 17:03:27,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {2133#false} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2133#false} is VALID [2022-04-07 17:03:27,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {2133#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2133#false} is VALID [2022-04-07 17:03:27,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {2133#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {2133#false} is VALID [2022-04-07 17:03:27,311 INFO L272 TraceCheckUtils]: 35: Hoare triple {2133#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2132#true} is VALID [2022-04-07 17:03:27,311 INFO L290 TraceCheckUtils]: 36: Hoare triple {2132#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2132#true} is VALID [2022-04-07 17:03:27,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {2132#true} [133] L18-->L18-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[] {2132#true} is VALID [2022-04-07 17:03:27,311 INFO L290 TraceCheckUtils]: 38: Hoare triple {2132#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,311 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2132#true} {2133#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2133#false} is VALID [2022-04-07 17:03:27,311 INFO L272 TraceCheckUtils]: 40: Hoare triple {2133#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2133#false} is VALID [2022-04-07 17:03:27,312 INFO L290 TraceCheckUtils]: 41: Hoare triple {2133#false} [130] __VERIFIER_assertENTRY-->L18: 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] {2133#false} is VALID [2022-04-07 17:03:27,312 INFO L290 TraceCheckUtils]: 42: Hoare triple {2133#false} [132] L18-->L19: 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[] {2133#false} is VALID [2022-04-07 17:03:27,312 INFO L290 TraceCheckUtils]: 43: Hoare triple {2133#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2133#false} is VALID [2022-04-07 17:03:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-07 17:03:27,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:27,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489514770] [2022-04-07 17:03:27,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489514770] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:03:27,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709779563] [2022-04-07 17:03:27,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:27,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:27,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:27,313 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:03:27,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 17:03:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:27,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 17:03:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:27,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:03:27,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {2132#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {2132#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2132#true} is VALID [2022-04-07 17:03:27,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {2132#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2132#true} {2132#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {2132#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {2132#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {2132#true} is VALID [2022-04-07 17:03:27,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {2132#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {2132#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {2132#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {2182#(<= main_~i~0 0)} is VALID [2022-04-07 17:03:27,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {2182#(<= main_~i~0 0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2186#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:27,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {2186#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2186#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:27,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {2186#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {2186#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:27,822 INFO L272 TraceCheckUtils]: 12: Hoare triple {2186#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2132#true} is VALID [2022-04-07 17:03:27,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {2132#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2132#true} is VALID [2022-04-07 17:03:27,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {2132#true} [133] L18-->L18-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[] {2132#true} is VALID [2022-04-07 17:03:27,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {2132#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,823 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2132#true} {2186#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2186#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:27,823 INFO L272 TraceCheckUtils]: 17: Hoare triple {2186#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2132#true} is VALID [2022-04-07 17:03:27,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {2132#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2132#true} is VALID [2022-04-07 17:03:27,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {2132#true} [133] L18-->L18-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[] {2132#true} is VALID [2022-04-07 17:03:27,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {2132#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:27,824 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2132#true} {2186#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} [141] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2186#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:27,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {2186#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2226#(and (<= main_~j~0 (+ (* main_~i~0 2) 1)) (<= main_~i~0 0))} is VALID [2022-04-07 17:03:27,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {2226#(and (<= main_~j~0 (+ (* main_~i~0 2) 1)) (<= main_~i~0 0))} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {2230#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-07 17:03:27,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {2230#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {2234#(and (<= (+ (div (+ (* (- 1) main_~n~0) 1) (- 2)) 1) main_~i~0) (<= (div (+ (* (- 1) main_~n~0) 1) (- 2)) 0))} is VALID [2022-04-07 17:03:27,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {2234#(and (<= (+ (div (+ (* (- 1) main_~n~0) 1) (- 2)) 1) main_~i~0) (<= (div (+ (* (- 1) main_~n~0) 1) (- 2)) 0))} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2133#false} is VALID [2022-04-07 17:03:27,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {2133#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2133#false} is VALID [2022-04-07 17:03:27,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {2133#false} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {2133#false} is VALID [2022-04-07 17:03:27,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {2133#false} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {2133#false} is VALID [2022-04-07 17:03:27,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {2133#false} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2133#false} is VALID [2022-04-07 17:03:27,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {2133#false} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {2133#false} is VALID [2022-04-07 17:03:27,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {2133#false} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {2133#false} is VALID [2022-04-07 17:03:27,827 INFO L290 TraceCheckUtils]: 32: Hoare triple {2133#false} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2133#false} is VALID [2022-04-07 17:03:27,827 INFO L290 TraceCheckUtils]: 33: Hoare triple {2133#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2133#false} is VALID [2022-04-07 17:03:27,827 INFO L290 TraceCheckUtils]: 34: Hoare triple {2133#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {2133#false} is VALID [2022-04-07 17:03:27,827 INFO L272 TraceCheckUtils]: 35: Hoare triple {2133#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2133#false} is VALID [2022-04-07 17:03:27,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {2133#false} [130] __VERIFIER_assertENTRY-->L18: 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] {2133#false} is VALID [2022-04-07 17:03:27,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {2133#false} [133] L18-->L18-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[] {2133#false} is VALID [2022-04-07 17:03:27,827 INFO L290 TraceCheckUtils]: 38: Hoare triple {2133#false} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2133#false} is VALID [2022-04-07 17:03:27,827 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2133#false} {2133#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2133#false} is VALID [2022-04-07 17:03:27,827 INFO L272 TraceCheckUtils]: 40: Hoare triple {2133#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2133#false} is VALID [2022-04-07 17:03:27,827 INFO L290 TraceCheckUtils]: 41: Hoare triple {2133#false} [130] __VERIFIER_assertENTRY-->L18: 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] {2133#false} is VALID [2022-04-07 17:03:27,827 INFO L290 TraceCheckUtils]: 42: Hoare triple {2133#false} [132] L18-->L19: 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[] {2133#false} is VALID [2022-04-07 17:03:27,828 INFO L290 TraceCheckUtils]: 43: Hoare triple {2133#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2133#false} is VALID [2022-04-07 17:03:27,828 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-07 17:03:27,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:03:28,003 INFO L290 TraceCheckUtils]: 43: Hoare triple {2133#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2133#false} is VALID [2022-04-07 17:03:28,003 INFO L290 TraceCheckUtils]: 42: Hoare triple {2133#false} [132] L18-->L19: 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[] {2133#false} is VALID [2022-04-07 17:03:28,003 INFO L290 TraceCheckUtils]: 41: Hoare triple {2133#false} [130] __VERIFIER_assertENTRY-->L18: 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] {2133#false} is VALID [2022-04-07 17:03:28,003 INFO L272 TraceCheckUtils]: 40: Hoare triple {2133#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2133#false} is VALID [2022-04-07 17:03:28,003 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2132#true} {2133#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2133#false} is VALID [2022-04-07 17:03:28,003 INFO L290 TraceCheckUtils]: 38: Hoare triple {2132#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:28,003 INFO L290 TraceCheckUtils]: 37: Hoare triple {2132#true} [133] L18-->L18-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[] {2132#true} is VALID [2022-04-07 17:03:28,004 INFO L290 TraceCheckUtils]: 36: Hoare triple {2132#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2132#true} is VALID [2022-04-07 17:03:28,004 INFO L272 TraceCheckUtils]: 35: Hoare triple {2133#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2132#true} is VALID [2022-04-07 17:03:28,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {2133#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {2133#false} is VALID [2022-04-07 17:03:28,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {2133#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2133#false} is VALID [2022-04-07 17:03:28,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {2133#false} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2133#false} is VALID [2022-04-07 17:03:28,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {2133#false} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {2133#false} is VALID [2022-04-07 17:03:28,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {2133#false} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {2133#false} is VALID [2022-04-07 17:03:28,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {2133#false} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2133#false} is VALID [2022-04-07 17:03:28,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {2133#false} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {2133#false} is VALID [2022-04-07 17:03:28,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {2133#false} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {2133#false} is VALID [2022-04-07 17:03:28,004 INFO L290 TraceCheckUtils]: 26: Hoare triple {2133#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2133#false} is VALID [2022-04-07 17:03:28,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {2149#(<= main_~n~0 main_~i~0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2133#false} is VALID [2022-04-07 17:03:28,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {2349#(<= main_~n~0 (+ main_~i~0 1))} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {2149#(<= main_~n~0 main_~i~0)} is VALID [2022-04-07 17:03:28,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {2353#(<= main_~j~0 (+ main_~i~0 1))} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {2349#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2022-04-07 17:03:28,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {2357#(<= main_~j~0 main_~i~0)} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2353#(<= main_~j~0 (+ main_~i~0 1))} is VALID [2022-04-07 17:03:28,012 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2132#true} {2357#(<= main_~j~0 main_~i~0)} [141] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2357#(<= main_~j~0 main_~i~0)} is VALID [2022-04-07 17:03:28,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {2132#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:28,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {2132#true} [133] L18-->L18-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[] {2132#true} is VALID [2022-04-07 17:03:28,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {2132#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2132#true} is VALID [2022-04-07 17:03:28,012 INFO L272 TraceCheckUtils]: 17: Hoare triple {2357#(<= main_~j~0 main_~i~0)} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2132#true} is VALID [2022-04-07 17:03:28,013 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2132#true} {2357#(<= main_~j~0 main_~i~0)} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2357#(<= main_~j~0 main_~i~0)} is VALID [2022-04-07 17:03:28,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {2132#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:28,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {2132#true} [133] L18-->L18-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[] {2132#true} is VALID [2022-04-07 17:03:28,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {2132#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2132#true} is VALID [2022-04-07 17:03:28,013 INFO L272 TraceCheckUtils]: 12: Hoare triple {2357#(<= main_~j~0 main_~i~0)} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2132#true} is VALID [2022-04-07 17:03:28,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {2357#(<= main_~j~0 main_~i~0)} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {2357#(<= main_~j~0 main_~i~0)} is VALID [2022-04-07 17:03:28,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {2357#(<= main_~j~0 main_~i~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2357#(<= main_~j~0 main_~i~0)} is VALID [2022-04-07 17:03:28,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {2182#(<= main_~i~0 0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2357#(<= main_~j~0 main_~i~0)} is VALID [2022-04-07 17:03:28,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {2132#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {2182#(<= main_~i~0 0)} is VALID [2022-04-07 17:03:28,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {2132#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:28,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {2132#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:28,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {2132#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {2132#true} is VALID [2022-04-07 17:03:28,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {2132#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:28,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2132#true} {2132#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:28,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {2132#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:28,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {2132#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2132#true} is VALID [2022-04-07 17:03:28,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {2132#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-07 17:03:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-07 17:03:28,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709779563] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:03:28,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:03:28,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-04-07 17:03:28,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372129501] [2022-04-07 17:03:28,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:03:28,018 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 44 [2022-04-07 17:03:28,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:28,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 17:03:28,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:28,060 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-07 17:03:28,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:28,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-07 17:03:28,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-07 17:03:28,061 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 17:03:28,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:28,703 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2022-04-07 17:03:28,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 17:03:28,703 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 44 [2022-04-07 17:03:28,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 17:03:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-04-07 17:03:28,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 17:03:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-04-07 17:03:28,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 75 transitions. [2022-04-07 17:03:28,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:28,777 INFO L225 Difference]: With dead ends: 95 [2022-04-07 17:03:28,777 INFO L226 Difference]: Without dead ends: 93 [2022-04-07 17:03:28,777 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-04-07 17:03:28,778 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 59 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:28,778 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 63 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 17:03:28,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-07 17:03:28,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2022-04-07 17:03:28,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:28,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-07 17:03:28,782 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-07 17:03:28,782 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-07 17:03:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:28,785 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-07 17:03:28,785 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-07 17:03:28,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:28,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:28,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 93 states. [2022-04-07 17:03:28,786 INFO L87 Difference]: Start difference. First operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 93 states. [2022-04-07 17:03:28,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:28,788 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-07 17:03:28,788 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-07 17:03:28,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:28,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:28,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:28,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-07 17:03:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2022-04-07 17:03:28,791 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 44 [2022-04-07 17:03:28,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:28,791 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2022-04-07 17:03:28,791 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 17:03:28,791 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2022-04-07 17:03:28,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-07 17:03:28,792 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:28,792 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:28,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 17:03:29,007 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:29,007 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:29,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:29,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1839163900, now seen corresponding path program 1 times [2022-04-07 17:03:29,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:29,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627129817] [2022-04-07 17:03:29,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:29,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:29,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:29,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {2820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2795#true} is VALID [2022-04-07 17:03:29,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {2795#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,069 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2795#true} {2795#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 17:03:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:29,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {2795#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2795#true} is VALID [2022-04-07 17:03:29,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {2795#true} [133] L18-->L18-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[] {2795#true} is VALID [2022-04-07 17:03:29,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {2795#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2795#true} {2795#true} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2795#true} is VALID [2022-04-07 17:03:29,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 17:03:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:29,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {2795#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2795#true} is VALID [2022-04-07 17:03:29,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {2795#true} [133] L18-->L18-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[] {2795#true} is VALID [2022-04-07 17:03:29,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {2795#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2795#true} {2795#true} [141] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2795#true} is VALID [2022-04-07 17:03:29,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-07 17:03:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:29,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {2795#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2795#true} is VALID [2022-04-07 17:03:29,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {2795#true} [133] L18-->L18-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[] {2795#true} is VALID [2022-04-07 17:03:29,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {2795#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2795#true} {2795#true} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {2795#true} is VALID [2022-04-07 17:03:29,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-07 17:03:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:29,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {2795#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2795#true} is VALID [2022-04-07 17:03:29,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {2795#true} [133] L18-->L18-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[] {2795#true} is VALID [2022-04-07 17:03:29,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {2795#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2795#true} {2813#(<= (+ main_~k~0 1) main_~n~0)} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2813#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-07 17:03:29,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {2795#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:03:29,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {2820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2795#true} is VALID [2022-04-07 17:03:29,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {2795#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2795#true} {2795#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {2795#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {2795#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {2795#true} is VALID [2022-04-07 17:03:29,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {2795#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {2795#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {2795#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {2795#true} is VALID [2022-04-07 17:03:29,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {2795#true} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2795#true} is VALID [2022-04-07 17:03:29,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {2795#true} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {2795#true} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {2795#true} is VALID [2022-04-07 17:03:29,085 INFO L272 TraceCheckUtils]: 12: Hoare triple {2795#true} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2795#true} is VALID [2022-04-07 17:03:29,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {2795#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2795#true} is VALID [2022-04-07 17:03:29,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {2795#true} [133] L18-->L18-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[] {2795#true} is VALID [2022-04-07 17:03:29,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {2795#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,085 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2795#true} {2795#true} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2795#true} is VALID [2022-04-07 17:03:29,085 INFO L272 TraceCheckUtils]: 17: Hoare triple {2795#true} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2795#true} is VALID [2022-04-07 17:03:29,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {2795#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2795#true} is VALID [2022-04-07 17:03:29,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {2795#true} [133] L18-->L18-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[] {2795#true} is VALID [2022-04-07 17:03:29,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {2795#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,085 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2795#true} {2795#true} [141] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2795#true} is VALID [2022-04-07 17:03:29,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {2795#true} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2795#true} is VALID [2022-04-07 17:03:29,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {2795#true} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {2795#true} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {2795#true} is VALID [2022-04-07 17:03:29,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {2795#true} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,086 INFO L272 TraceCheckUtils]: 26: Hoare triple {2795#true} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {2795#true} is VALID [2022-04-07 17:03:29,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {2795#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2795#true} is VALID [2022-04-07 17:03:29,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {2795#true} [133] L18-->L18-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[] {2795#true} is VALID [2022-04-07 17:03:29,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {2795#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,086 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2795#true} {2795#true} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {2795#true} is VALID [2022-04-07 17:03:29,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {2795#true} [131] L37-1-->L36-2: Formula: (= v_main_~k~0_10 (+ v_main_~k~0_11 1)) InVars {main_~k~0=v_main_~k~0_11} OutVars{main_~k~0=v_main_~k~0_10, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {2795#true} is VALID [2022-04-07 17:03:29,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {2795#true} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {2795#true} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2795#true} is VALID [2022-04-07 17:03:29,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {2795#true} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {2795#true} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {2795#true} is VALID [2022-04-07 17:03:29,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {2795#true} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2795#true} is VALID [2022-04-07 17:03:29,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {2795#true} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2812#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-07 17:03:29,087 INFO L290 TraceCheckUtils]: 38: Hoare triple {2812#(<= (+ main_~j~0 1) main_~n~0)} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {2813#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-07 17:03:29,087 INFO L290 TraceCheckUtils]: 39: Hoare triple {2813#(<= (+ main_~k~0 1) main_~n~0)} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {2813#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-07 17:03:29,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {2813#(<= (+ main_~k~0 1) main_~n~0)} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2813#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-07 17:03:29,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {2813#(<= (+ main_~k~0 1) main_~n~0)} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {2813#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-07 17:03:29,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {2813#(<= (+ main_~k~0 1) main_~n~0)} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {2813#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-07 17:03:29,088 INFO L290 TraceCheckUtils]: 43: Hoare triple {2813#(<= (+ main_~k~0 1) main_~n~0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2813#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-07 17:03:29,089 INFO L290 TraceCheckUtils]: 44: Hoare triple {2813#(<= (+ main_~k~0 1) main_~n~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2813#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-07 17:03:29,089 INFO L290 TraceCheckUtils]: 45: Hoare triple {2813#(<= (+ main_~k~0 1) main_~n~0)} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {2813#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-07 17:03:29,089 INFO L272 TraceCheckUtils]: 46: Hoare triple {2813#(<= (+ main_~k~0 1) main_~n~0)} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2795#true} is VALID [2022-04-07 17:03:29,089 INFO L290 TraceCheckUtils]: 47: Hoare triple {2795#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2795#true} is VALID [2022-04-07 17:03:29,089 INFO L290 TraceCheckUtils]: 48: Hoare triple {2795#true} [133] L18-->L18-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[] {2795#true} is VALID [2022-04-07 17:03:29,089 INFO L290 TraceCheckUtils]: 49: Hoare triple {2795#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,090 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2795#true} {2813#(<= (+ main_~k~0 1) main_~n~0)} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2813#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-07 17:03:29,090 INFO L272 TraceCheckUtils]: 51: Hoare triple {2813#(<= (+ main_~k~0 1) main_~n~0)} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2818#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:03:29,091 INFO L290 TraceCheckUtils]: 52: Hoare triple {2818#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L18: 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] {2819#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:03:29,091 INFO L290 TraceCheckUtils]: 53: Hoare triple {2819#(not (= __VERIFIER_assert_~cond 0))} [132] L18-->L19: 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[] {2796#false} is VALID [2022-04-07 17:03:29,091 INFO L290 TraceCheckUtils]: 54: Hoare triple {2796#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2796#false} is VALID [2022-04-07 17:03:29,091 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-07 17:03:29,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:29,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627129817] [2022-04-07 17:03:29,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627129817] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:03:29,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355030728] [2022-04-07 17:03:29,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:29,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:29,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:29,093 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:03:29,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 17:03:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:29,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-07 17:03:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:29,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:03:29,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {2795#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {2795#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2795#true} is VALID [2022-04-07 17:03:29,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {2795#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2795#true} {2795#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {2795#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {2795#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {2795#true} is VALID [2022-04-07 17:03:29,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {2795#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {2795#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {2795#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {2795#true} is VALID [2022-04-07 17:03:29,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {2795#true} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2851#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-07 17:03:29,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {2851#(<= main_~j~0 (* main_~i~0 2))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2851#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-07 17:03:29,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {2851#(<= main_~j~0 (* main_~i~0 2))} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {2851#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-07 17:03:29,658 INFO L272 TraceCheckUtils]: 12: Hoare triple {2851#(<= main_~j~0 (* main_~i~0 2))} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2795#true} is VALID [2022-04-07 17:03:29,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {2795#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2795#true} is VALID [2022-04-07 17:03:29,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {2795#true} [133] L18-->L18-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[] {2795#true} is VALID [2022-04-07 17:03:29,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {2795#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,659 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2795#true} {2851#(<= main_~j~0 (* main_~i~0 2))} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2851#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-07 17:03:29,659 INFO L272 TraceCheckUtils]: 17: Hoare triple {2851#(<= main_~j~0 (* main_~i~0 2))} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2795#true} is VALID [2022-04-07 17:03:29,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {2795#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2795#true} is VALID [2022-04-07 17:03:29,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {2795#true} [133] L18-->L18-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[] {2795#true} is VALID [2022-04-07 17:03:29,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {2795#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,660 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2795#true} {2851#(<= main_~j~0 (* main_~i~0 2))} [141] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2851#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-07 17:03:29,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {2851#(<= main_~j~0 (* main_~i~0 2))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2891#(<= main_~j~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-07 17:03:29,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {2891#(<= main_~j~0 (+ (* main_~i~0 2) 1))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2891#(<= main_~j~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-07 17:03:29,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {2891#(<= main_~j~0 (+ (* main_~i~0 2) 1))} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {2898#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-07 17:03:29,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {2898#(<= main_~k~0 (+ (* main_~i~0 2) 1))} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {2898#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-07 17:03:29,661 INFO L272 TraceCheckUtils]: 26: Hoare triple {2898#(<= main_~k~0 (+ (* main_~i~0 2) 1))} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {2795#true} is VALID [2022-04-07 17:03:29,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {2795#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2795#true} is VALID [2022-04-07 17:03:29,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {2795#true} [133] L18-->L18-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[] {2795#true} is VALID [2022-04-07 17:03:29,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {2795#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,662 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2795#true} {2898#(<= main_~k~0 (+ (* main_~i~0 2) 1))} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {2898#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-07 17:03:29,662 INFO L290 TraceCheckUtils]: 31: Hoare triple {2898#(<= main_~k~0 (+ (* main_~i~0 2) 1))} [131] L37-1-->L36-2: Formula: (= v_main_~k~0_10 (+ v_main_~k~0_11 1)) InVars {main_~k~0=v_main_~k~0_11} OutVars{main_~k~0=v_main_~k~0_10, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {2920#(<= main_~k~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:29,662 INFO L290 TraceCheckUtils]: 32: Hoare triple {2920#(<= main_~k~0 (+ 2 (* main_~i~0 2)))} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {2924#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:29,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {2924#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2924#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:29,663 INFO L290 TraceCheckUtils]: 34: Hoare triple {2924#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {2924#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:29,664 INFO L290 TraceCheckUtils]: 35: Hoare triple {2924#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {2934#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) main_~i~0)} is VALID [2022-04-07 17:03:29,664 INFO L290 TraceCheckUtils]: 36: Hoare triple {2934#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) main_~i~0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2938#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) (div main_~j~0 2))} is VALID [2022-04-07 17:03:29,665 INFO L290 TraceCheckUtils]: 37: Hoare triple {2938#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) (div main_~j~0 2))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2796#false} is VALID [2022-04-07 17:03:29,665 INFO L290 TraceCheckUtils]: 38: Hoare triple {2796#false} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {2796#false} is VALID [2022-04-07 17:03:29,665 INFO L290 TraceCheckUtils]: 39: Hoare triple {2796#false} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {2796#false} is VALID [2022-04-07 17:03:29,665 INFO L290 TraceCheckUtils]: 40: Hoare triple {2796#false} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2796#false} is VALID [2022-04-07 17:03:29,665 INFO L290 TraceCheckUtils]: 41: Hoare triple {2796#false} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {2796#false} is VALID [2022-04-07 17:03:29,665 INFO L290 TraceCheckUtils]: 42: Hoare triple {2796#false} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {2796#false} is VALID [2022-04-07 17:03:29,665 INFO L290 TraceCheckUtils]: 43: Hoare triple {2796#false} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2796#false} is VALID [2022-04-07 17:03:29,665 INFO L290 TraceCheckUtils]: 44: Hoare triple {2796#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2796#false} is VALID [2022-04-07 17:03:29,665 INFO L290 TraceCheckUtils]: 45: Hoare triple {2796#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {2796#false} is VALID [2022-04-07 17:03:29,665 INFO L272 TraceCheckUtils]: 46: Hoare triple {2796#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2796#false} is VALID [2022-04-07 17:03:29,665 INFO L290 TraceCheckUtils]: 47: Hoare triple {2796#false} [130] __VERIFIER_assertENTRY-->L18: 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] {2796#false} is VALID [2022-04-07 17:03:29,666 INFO L290 TraceCheckUtils]: 48: Hoare triple {2796#false} [133] L18-->L18-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[] {2796#false} is VALID [2022-04-07 17:03:29,666 INFO L290 TraceCheckUtils]: 49: Hoare triple {2796#false} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2796#false} is VALID [2022-04-07 17:03:29,666 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2796#false} {2796#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2796#false} is VALID [2022-04-07 17:03:29,666 INFO L272 TraceCheckUtils]: 51: Hoare triple {2796#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2796#false} is VALID [2022-04-07 17:03:29,666 INFO L290 TraceCheckUtils]: 52: Hoare triple {2796#false} [130] __VERIFIER_assertENTRY-->L18: 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] {2796#false} is VALID [2022-04-07 17:03:29,666 INFO L290 TraceCheckUtils]: 53: Hoare triple {2796#false} [132] L18-->L19: 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[] {2796#false} is VALID [2022-04-07 17:03:29,666 INFO L290 TraceCheckUtils]: 54: Hoare triple {2796#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2796#false} is VALID [2022-04-07 17:03:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-07 17:03:29,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:03:29,914 INFO L290 TraceCheckUtils]: 54: Hoare triple {2796#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2796#false} is VALID [2022-04-07 17:03:29,914 INFO L290 TraceCheckUtils]: 53: Hoare triple {2796#false} [132] L18-->L19: 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[] {2796#false} is VALID [2022-04-07 17:03:29,915 INFO L290 TraceCheckUtils]: 52: Hoare triple {2796#false} [130] __VERIFIER_assertENTRY-->L18: 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] {2796#false} is VALID [2022-04-07 17:03:29,915 INFO L272 TraceCheckUtils]: 51: Hoare triple {2796#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2796#false} is VALID [2022-04-07 17:03:29,915 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2795#true} {2796#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2796#false} is VALID [2022-04-07 17:03:29,915 INFO L290 TraceCheckUtils]: 49: Hoare triple {2795#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,915 INFO L290 TraceCheckUtils]: 48: Hoare triple {2795#true} [133] L18-->L18-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[] {2795#true} is VALID [2022-04-07 17:03:29,915 INFO L290 TraceCheckUtils]: 47: Hoare triple {2795#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2795#true} is VALID [2022-04-07 17:03:29,915 INFO L272 TraceCheckUtils]: 46: Hoare triple {2796#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2795#true} is VALID [2022-04-07 17:03:29,915 INFO L290 TraceCheckUtils]: 45: Hoare triple {2796#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {2796#false} is VALID [2022-04-07 17:03:29,915 INFO L290 TraceCheckUtils]: 44: Hoare triple {2796#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2796#false} is VALID [2022-04-07 17:03:29,915 INFO L290 TraceCheckUtils]: 43: Hoare triple {2796#false} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2796#false} is VALID [2022-04-07 17:03:29,915 INFO L290 TraceCheckUtils]: 42: Hoare triple {2796#false} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {2796#false} is VALID [2022-04-07 17:03:29,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {2796#false} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {2796#false} is VALID [2022-04-07 17:03:29,916 INFO L290 TraceCheckUtils]: 40: Hoare triple {2796#false} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2796#false} is VALID [2022-04-07 17:03:29,916 INFO L290 TraceCheckUtils]: 39: Hoare triple {2796#false} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {2796#false} is VALID [2022-04-07 17:03:29,916 INFO L290 TraceCheckUtils]: 38: Hoare triple {2796#false} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {2796#false} is VALID [2022-04-07 17:03:29,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {3044#(not (< main_~j~0 main_~n~0))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2796#false} is VALID [2022-04-07 17:03:29,917 INFO L290 TraceCheckUtils]: 36: Hoare triple {2934#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) main_~i~0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {3044#(not (< main_~j~0 main_~n~0))} is VALID [2022-04-07 17:03:29,917 INFO L290 TraceCheckUtils]: 35: Hoare triple {2924#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {2934#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) main_~i~0)} is VALID [2022-04-07 17:03:29,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {2924#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {2924#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:29,918 INFO L290 TraceCheckUtils]: 33: Hoare triple {2924#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2924#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:29,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {2920#(<= main_~k~0 (+ 2 (* main_~i~0 2)))} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {2924#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:29,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {2898#(<= main_~k~0 (+ (* main_~i~0 2) 1))} [131] L37-1-->L36-2: Formula: (= v_main_~k~0_10 (+ v_main_~k~0_11 1)) InVars {main_~k~0=v_main_~k~0_11} OutVars{main_~k~0=v_main_~k~0_10, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {2920#(<= main_~k~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-07 17:03:29,919 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2795#true} {2898#(<= main_~k~0 (+ (* main_~i~0 2) 1))} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {2898#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-07 17:03:29,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {2795#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {2795#true} [133] L18-->L18-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[] {2795#true} is VALID [2022-04-07 17:03:29,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {2795#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2795#true} is VALID [2022-04-07 17:03:29,919 INFO L272 TraceCheckUtils]: 26: Hoare triple {2898#(<= main_~k~0 (+ (* main_~i~0 2) 1))} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {2795#true} is VALID [2022-04-07 17:03:29,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {2898#(<= main_~k~0 (+ (* main_~i~0 2) 1))} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {2898#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-07 17:03:29,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {2891#(<= main_~j~0 (+ (* main_~i~0 2) 1))} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {2898#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-07 17:03:29,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {2891#(<= main_~j~0 (+ (* main_~i~0 2) 1))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2891#(<= main_~j~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-07 17:03:29,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {2851#(<= main_~j~0 (* main_~i~0 2))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2891#(<= main_~j~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-07 17:03:29,921 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2795#true} {2851#(<= main_~j~0 (* main_~i~0 2))} [141] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2851#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-07 17:03:29,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {2795#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {2795#true} [133] L18-->L18-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[] {2795#true} is VALID [2022-04-07 17:03:29,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {2795#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2795#true} is VALID [2022-04-07 17:03:29,921 INFO L272 TraceCheckUtils]: 17: Hoare triple {2851#(<= main_~j~0 (* main_~i~0 2))} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2795#true} is VALID [2022-04-07 17:03:29,922 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2795#true} {2851#(<= main_~j~0 (* main_~i~0 2))} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2851#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-07 17:03:29,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {2795#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {2795#true} [133] L18-->L18-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[] {2795#true} is VALID [2022-04-07 17:03:29,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {2795#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2795#true} is VALID [2022-04-07 17:03:29,922 INFO L272 TraceCheckUtils]: 12: Hoare triple {2851#(<= main_~j~0 (* main_~i~0 2))} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2795#true} is VALID [2022-04-07 17:03:29,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {2851#(<= main_~j~0 (* main_~i~0 2))} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {2851#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-07 17:03:29,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {2851#(<= main_~j~0 (* main_~i~0 2))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2851#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-07 17:03:29,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {2795#true} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2851#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-07 17:03:29,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {2795#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {2795#true} is VALID [2022-04-07 17:03:29,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {2795#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {2795#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {2795#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {2795#true} is VALID [2022-04-07 17:03:29,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {2795#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2795#true} {2795#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {2795#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {2795#true} [103] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2795#true} is VALID [2022-04-07 17:03:29,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {2795#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-07 17:03:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-07 17:03:29,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355030728] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:03:29,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:03:29,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2022-04-07 17:03:29,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144579568] [2022-04-07 17:03:29,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:03:29,925 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 55 [2022-04-07 17:03:29,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:29,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-07 17:03:29,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:29,981 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 17:03:29,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:29,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 17:03:29,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-04-07 17:03:29,982 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-07 17:03:31,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:31,237 INFO L93 Difference]: Finished difference Result 123 states and 169 transitions. [2022-04-07 17:03:31,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-07 17:03:31,237 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 55 [2022-04-07 17:03:31,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-07 17:03:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 98 transitions. [2022-04-07 17:03:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-07 17:03:31,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 98 transitions. [2022-04-07 17:03:31,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 98 transitions. [2022-04-07 17:03:31,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:31,340 INFO L225 Difference]: With dead ends: 123 [2022-04-07 17:03:31,340 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 17:03:31,341 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=1462, Unknown=0, NotChecked=0, Total=1806 [2022-04-07 17:03:31,341 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 82 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:31,341 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 64 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 17:03:31,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 17:03:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 17:03:31,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:31,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:03:31,342 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:03:31,342 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:03:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:31,342 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:03:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:03:31,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:31,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:31,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 17:03:31,342 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 17:03:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:31,343 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:03:31,343 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:03:31,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:31,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:31,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:31,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:03:31,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 17:03:31,343 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2022-04-07 17:03:31,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:31,343 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 17:03:31,343 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-07 17:03:31,344 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:03:31,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:31,345 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 17:03:31,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 17:03:31,556 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:31,559 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:31,559 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 17:03:31,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:03:31 BasicIcfg [2022-04-07 17:03:31,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 17:03:31,564 INFO L158 Benchmark]: Toolchain (without parser) took 12086.49ms. Allocated memory was 179.3MB in the beginning and 222.3MB in the end (delta: 43.0MB). Free memory was 129.7MB in the beginning and 149.0MB in the end (delta: -19.3MB). Peak memory consumption was 25.0MB. Max. memory is 8.0GB. [2022-04-07 17:03:31,564 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:03:31,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.58ms. Allocated memory is still 179.3MB. Free memory was 129.5MB in the beginning and 154.8MB in the end (delta: -25.3MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2022-04-07 17:03:31,564 INFO L158 Benchmark]: Boogie Preprocessor took 39.40ms. Allocated memory is still 179.3MB. Free memory was 154.8MB in the beginning and 153.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 17:03:31,564 INFO L158 Benchmark]: RCFGBuilder took 310.92ms. Allocated memory is still 179.3MB. Free memory was 153.2MB in the beginning and 140.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 17:03:31,564 INFO L158 Benchmark]: IcfgTransformer took 24.47ms. Allocated memory is still 179.3MB. Free memory was 140.9MB in the beginning and 139.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 17:03:31,565 INFO L158 Benchmark]: TraceAbstraction took 11491.12ms. Allocated memory was 179.3MB in the beginning and 222.3MB in the end (delta: 43.0MB). Free memory was 138.5MB in the beginning and 149.0MB in the end (delta: -10.5MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-04-07 17:03:31,565 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.58ms. Allocated memory is still 179.3MB. Free memory was 129.5MB in the beginning and 154.8MB in the end (delta: -25.3MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.40ms. Allocated memory is still 179.3MB. Free memory was 154.8MB in the beginning and 153.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 310.92ms. Allocated memory is still 179.3MB. Free memory was 153.2MB in the beginning and 140.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 24.47ms. Allocated memory is still 179.3MB. Free memory was 140.9MB in the beginning and 139.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 11491.12ms. Allocated memory was 179.3MB in the beginning and 222.3MB in the end (delta: 43.0MB). Free memory was 138.5MB in the beginning and 149.0MB in the end (delta: -10.5MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 456 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 442 mSDsluCounter, 467 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 284 mSDsCounter, 401 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1532 IncrementalHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 401 mSolverCounterUnsat, 183 mSDtfsCounter, 1532 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 383 SyntacticMatches, 5 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=7, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 84 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 450 NumberOfCodeBlocks, 450 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 606 ConstructedInterpolants, 0 QuantifiedInterpolants, 1499 SizeOfPredicates, 21 NumberOfNonLiveVariables, 555 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 398/439 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-07 17:03:31,579 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...