/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-fb4f59a-m [2022-04-27 16:16:44,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:16:44,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:16:44,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:16:44,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:16:44,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:16:44,864 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:16:44,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:16:44,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:16:44,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:16:44,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:16:44,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:16:44,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:16:44,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:16:44,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:16:44,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:16:44,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:16:44,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:16:44,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:16:44,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:16:44,878 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:16:44,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:16:44,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:16:44,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:16:44,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:16:44,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:16:44,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:16:44,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:16:44,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:16:44,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:16:44,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:16:44,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:16:44,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:16:44,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:16:44,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:16:44,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:16:44,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:16:44,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:16:44,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:16:44,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:16:44,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:16:44,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:16:44,901 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:16:44,909 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:16:44,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:16:44,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:16:44,910 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:16:44,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:16:44,918 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:16:44,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:16:44,919 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:16:44,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:16:44,920 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:16:44,920 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:16:44,920 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:16:44,920 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:16:44,920 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:16:44,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:16:44,921 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:16:44,921 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:16:44,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:16:44,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:16:44,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:16:44,921 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:16:44,922 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:16:44,922 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 16:16:45,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:16:45,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:16:45,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:16:45,144 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:16:45,146 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:16:45,147 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-27 16:16:45,208 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2780274d2/bbf49deda36c4fd69a56e4c7464d6005/FLAGc07d228a3 [2022-04-27 16:16:45,581 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:16:45,581 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2022-04-27 16:16:45,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2780274d2/bbf49deda36c4fd69a56e4c7464d6005/FLAGc07d228a3 [2022-04-27 16:16:45,981 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2780274d2/bbf49deda36c4fd69a56e4c7464d6005 [2022-04-27 16:16:45,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:16:45,985 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:16:45,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:16:45,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:16:45,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:16:45,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:16:45" (1/1) ... [2022-04-27 16:16:45,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c01143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:45, skipping insertion in model container [2022-04-27 16:16:45,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:16:45" (1/1) ... [2022-04-27 16:16:46,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:16:46,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:16:46,160 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-27 16:16:46,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:16:46,190 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:16:46,220 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-27 16:16:46,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:16:46,238 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:16:46,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:46 WrapperNode [2022-04-27 16:16:46,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:16:46,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:16:46,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:16:46,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:16:46,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:46" (1/1) ... [2022-04-27 16:16:46,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:46" (1/1) ... [2022-04-27 16:16:46,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:46" (1/1) ... [2022-04-27 16:16:46,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:46" (1/1) ... [2022-04-27 16:16:46,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:46" (1/1) ... [2022-04-27 16:16:46,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:46" (1/1) ... [2022-04-27 16:16:46,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:46" (1/1) ... [2022-04-27 16:16:46,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:16:46,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:16:46,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:16:46,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:16:46,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:46" (1/1) ... [2022-04-27 16:16:46,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:16:46,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:16:46,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 16:16:46,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 16:16:46,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:16:46,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:16:46,346 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:16:46,346 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:16:46,346 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:16:46,346 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:16:46,346 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:16:46,346 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:16:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 16:16:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 16:16:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:16:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:16:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:16:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:16:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:16:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:16:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:16:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:16:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:16:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:16:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:16:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:16:46,404 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:16:46,406 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:16:46,544 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:16:46,551 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:16:46,551 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 16:16:46,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:16:46 BoogieIcfgContainer [2022-04-27 16:16:46,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:16:46,553 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:16:46,554 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:16:46,555 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:16:46,557 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:16:46" (1/1) ... [2022-04-27 16:16:46,559 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:16:46,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:16:46 BasicIcfg [2022-04-27 16:16:46,585 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:16:46,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:16:46,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:16:46,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:16:46,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:16:45" (1/4) ... [2022-04-27 16:16:46,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89ed506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:16:46, skipping insertion in model container [2022-04-27 16:16:46,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:16:46" (2/4) ... [2022-04-27 16:16:46,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89ed506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:16:46, skipping insertion in model container [2022-04-27 16:16:46,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:16:46" (3/4) ... [2022-04-27 16:16:46,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89ed506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:16:46, skipping insertion in model container [2022-04-27 16:16:46,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:16:46" (4/4) ... [2022-04-27 16:16:46,593 INFO L111 eAbstractionObserver]: Analyzing ICFG nested6.iJordan [2022-04-27 16:16:46,606 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:16:46,606 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:16:46,641 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:16:46,647 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b553aa0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@231bf408 [2022-04-27 16:16:46,647 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:16:46,654 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-27 16:16:46,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 16:16:46,660 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:46,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:16:46,661 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:46,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:46,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1002152396, now seen corresponding path program 1 times [2022-04-27 16:16:46,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:46,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817458429] [2022-04-27 16:16:46,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:46,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:46,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:46,959 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-27 16:16:46,960 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-27 16:16:46,960 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-27 16:16:46,962 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-27 16:16:46,964 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-27 16:16:46,964 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-27 16:16:46,965 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-27 16:16:46,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 16:16:46,966 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-27 16:16:46,966 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-27 16:16:46,967 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-27 16:16:46,967 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-27 16:16:46,969 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-27 16:16:46,970 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-27 16:16:46,970 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-27 16:16:46,972 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-27 16:16:46,973 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-27 16:16:46,974 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-27 16:16:46,974 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-27 16:16:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:16:46,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:46,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817458429] [2022-04-27 16:16:46,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817458429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:16:46,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:16:46,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:16:46,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661821238] [2022-04-27 16:16:46,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:16:46,985 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-27 16:16:46,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:46,990 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-27 16:16:47,017 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-27 16:16:47,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:16:47,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:47,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:16:47,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:16:47,053 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-27 16:16:47,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:47,440 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 16:16:47,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:16:47,441 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-27 16:16:47,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:47,442 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-27 16:16:47,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-27 16:16:47,448 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-27 16:16:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-27 16:16:47,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2022-04-27 16:16:47,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:47,518 INFO L225 Difference]: With dead ends: 37 [2022-04-27 16:16:47,519 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 16:16:47,521 INFO L412 NwaCegarLoop]: 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-27 16:16:47,524 INFO L413 NwaCegarLoop]: 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-27 16:16:47,525 INFO L414 NwaCegarLoop]: 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-27 16:16:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 16:16:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 16:16:47,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:47,548 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-27 16:16:47,549 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-27 16:16:47,549 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-27 16:16:47,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:47,553 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-27 16:16:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-27 16:16:47,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:47,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:47,554 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-27 16:16:47,554 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-27 16:16:47,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:47,557 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-27 16:16:47,557 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-27 16:16:47,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:47,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:47,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:47,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:47,564 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-27 16:16:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-27 16:16:47,567 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2022-04-27 16:16:47,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:47,568 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-27 16:16:47,568 INFO L496 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-27 16:16:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-27 16:16:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 16:16:47,569 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:47,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:16:47,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:16:47,569 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:47,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:47,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1031567308, now seen corresponding path program 1 times [2022-04-27 16:16:47,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:47,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141132625] [2022-04-27 16:16:47,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:47,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:47,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:47,646 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-27 16:16:47,647 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-27 16:16:47,647 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-27 16:16:47,647 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-27 16:16:47,648 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-27 16:16:47,648 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-27 16:16:47,648 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-27 16:16:47,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {176#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#true} is VALID [2022-04-27 16:16:47,649 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-27 16:16:47,649 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-27 16:16:47,649 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-27 16:16:47,649 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-27 16:16:47,650 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-27 16:16:47,650 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-27 16:16:47,651 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-27 16:16:47,651 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-27 16:16:47,652 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-27 16:16:47,653 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-27 16:16:47,653 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-27 16:16:47,654 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-27 16:16:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:16:47,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:47,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141132625] [2022-04-27 16:16:47,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141132625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:16:47,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:16:47,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 16:16:47,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258607592] [2022-04-27 16:16:47,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:16:47,656 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-27 16:16:47,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:47,657 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-27 16:16:47,670 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-27 16:16:47,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:16:47,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:47,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:16:47,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:16:47,672 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-27 16:16:48,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:48,096 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-27 16:16:48,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:16:48,096 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-27 16:16:48,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:48,096 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-27 16:16:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-27 16:16:48,099 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-27 16:16:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-27 16:16:48,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-04-27 16:16:48,145 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-27 16:16:48,146 INFO L225 Difference]: With dead ends: 39 [2022-04-27 16:16:48,146 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 16:16:48,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 16:16:48,148 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 29 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:16:48,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 45 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:16:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 16:16:48,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-04-27 16:16:48,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:48,153 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-27 16:16:48,153 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-27 16:16:48,153 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-27 16:16:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:48,156 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-27 16:16:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 16:16:48,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:48,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:48,157 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-27 16:16:48,157 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-27 16:16:48,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:48,160 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-27 16:16:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 16:16:48,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:48,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:48,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:48,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:48,161 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-27 16:16:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-27 16:16:48,163 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 17 [2022-04-27 16:16:48,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:48,163 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-27 16:16:48,163 INFO L496 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-27 16:16:48,163 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 16:16:48,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 16:16:48,164 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:48,164 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:16:48,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:16:48,164 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:48,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:48,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1187235258, now seen corresponding path program 1 times [2022-04-27 16:16:48,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:48,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554978758] [2022-04-27 16:16:48,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:48,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:48,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:48,247 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-27 16:16:48,247 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-27 16:16:48,247 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-27 16:16:48,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 16:16:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:48,255 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-27 16:16:48,256 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-27 16:16:48,256 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-27 16:16:48,257 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-27 16:16:48,258 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-27 16:16:48,258 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-27 16:16:48,258 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-27 16:16:48,258 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-27 16:16:48,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {348#true} is VALID [2022-04-27 16:16:48,259 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-27 16:16:48,259 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-27 16:16:48,259 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-27 16:16:48,260 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-27 16:16:48,260 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-27 16:16:48,261 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-27 16:16:48,261 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-27 16:16:48,261 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-27 16:16:48,261 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-27 16:16:48,262 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-27 16:16:48,262 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-27 16:16:48,263 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-27 16:16:48,263 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-27 16:16:48,264 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-27 16:16:48,264 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-27 16:16:48,264 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-27 16:16:48,265 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-27 16:16:48,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:48,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554978758] [2022-04-27 16:16:48,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554978758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:16:48,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:16:48,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:16:48,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281971791] [2022-04-27 16:16:48,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:16:48,266 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-27 16:16:48,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:48,267 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-27 16:16:48,282 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-27 16:16:48,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:16:48,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:48,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:16:48,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:16:48,283 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-27 16:16:48,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:48,527 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-27 16:16:48,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:16:48,527 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-27 16:16:48,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:48,528 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-27 16:16:48,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-27 16:16:48,535 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-27 16:16:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-27 16:16:48,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2022-04-27 16:16:48,583 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-27 16:16:48,589 INFO L225 Difference]: With dead ends: 44 [2022-04-27 16:16:48,589 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 16:16:48,594 INFO L412 NwaCegarLoop]: 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-27 16:16:48,596 INFO L413 NwaCegarLoop]: 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-27 16:16:48,597 INFO L414 NwaCegarLoop]: 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-27 16:16:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 16:16:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-27 16:16:48,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:48,601 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-27 16:16:48,601 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-27 16:16:48,602 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-27 16:16:48,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:48,608 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-27 16:16:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-27 16:16:48,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:48,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:48,609 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-27 16:16:48,610 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-27 16:16:48,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:48,612 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-27 16:16:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-27 16:16:48,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:48,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:48,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:48,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:48,613 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-27 16:16:48,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-04-27 16:16:48,615 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 21 [2022-04-27 16:16:48,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:48,615 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-04-27 16:16:48,615 INFO L496 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-27 16:16:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-27 16:16:48,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 16:16:48,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:48,616 INFO L195 NwaCegarLoop]: 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-27 16:16:48,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 16:16:48,617 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:48,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:48,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1420692427, now seen corresponding path program 1 times [2022-04-27 16:16:48,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:48,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798667224] [2022-04-27 16:16:48,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:48,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:48,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:48,749 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-27 16:16:48,750 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-27 16:16:48,750 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-27 16:16:48,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 16:16:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:48,756 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-27 16:16:48,756 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-27 16:16:48,757 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-27 16:16:48,757 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-27 16:16:48,758 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-27 16:16:48,758 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-27 16:16:48,759 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-27 16:16:48,759 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-27 16:16:48,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {547#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-27 16:16:48,759 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-27 16:16:48,759 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-27 16:16:48,760 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-27 16:16:48,765 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-27 16:16:48,765 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-27 16:16:48,766 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-27 16:16:48,768 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-27 16:16:48,768 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-27 16:16:48,770 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-27 16:16:48,771 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-27 16:16:48,772 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-27 16:16:48,772 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-27 16:16:48,772 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-27 16:16:48,773 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-27 16:16:48,773 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-27 16:16:48,776 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-27 16:16:48,777 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-27 16:16:48,778 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-27 16:16:48,778 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-27 16:16:48,779 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-27 16:16:48,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:16:48,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:48,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798667224] [2022-04-27 16:16:48,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798667224] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:16:48,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310653371] [2022-04-27 16:16:48,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:48,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:16:48,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:16:48,788 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:16:48,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 16:16:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:48,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 16:16:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:48,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:16:49,838 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-27 16:16:49,839 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-27 16:16:49,839 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-27 16:16:49,839 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-27 16:16:49,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {547#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-27 16:16:49,840 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-27 16:16:49,840 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-27 16:16:49,840 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-27 16:16:49,841 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-27 16:16:49,842 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-27 16:16:49,842 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-27 16:16:49,843 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-27 16:16:49,844 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-27 16:16:49,844 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-27 16:16:49,844 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-27 16:16:49,844 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-27 16:16:49,845 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-27 16:16:49,845 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-27 16:16:49,845 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-27 16:16:49,845 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-27 16:16:49,845 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-27 16:16:49,852 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-27 16:16:49,853 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-27 16:16:49,866 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-27 16:16:49,866 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-27 16:16:49,867 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-27 16:16:49,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 16:16:49,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310653371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:16:49,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 16:16:49,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-04-27 16:16:49,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908542410] [2022-04-27 16:16:49,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:16:49,868 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-27 16:16:49,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:49,868 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-27 16:16:49,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:49,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 16:16:49,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:49,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 16:16:49,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:16:49,888 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-27 16:16:50,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:50,066 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-27 16:16:50,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 16:16:50,067 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-27 16:16:50,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:50,067 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-27 16:16:50,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 16:16:50,070 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-27 16:16:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 16:16:50,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 16:16:50,134 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-27 16:16:50,140 INFO L225 Difference]: With dead ends: 72 [2022-04-27 16:16:50,141 INFO L226 Difference]: Without dead ends: 72 [2022-04-27 16:16:50,141 INFO L412 NwaCegarLoop]: 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-27 16:16:50,147 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-27 16:16:50,149 INFO L414 NwaCegarLoop]: 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-27 16:16:50,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-27 16:16:50,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 48. [2022-04-27 16:16:50,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:50,159 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-27 16:16:50,160 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-27 16:16:50,160 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-27 16:16:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:50,163 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-27 16:16:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2022-04-27 16:16:50,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:50,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:50,165 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-27 16:16:50,165 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-27 16:16:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:50,173 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-27 16:16:50,173 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2022-04-27 16:16:50,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:50,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:50,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:50,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:50,174 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-27 16:16:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-27 16:16:50,175 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 25 [2022-04-27 16:16:50,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:50,175 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-27 16:16:50,175 INFO L496 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-27 16:16:50,176 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 16:16:50,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 16:16:50,176 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:50,177 INFO L195 NwaCegarLoop]: 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-27 16:16:50,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 16:16:50,383 WARN L477 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-27 16:16:50,384 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:50,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:50,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1754984885, now seen corresponding path program 1 times [2022-04-27 16:16:50,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:50,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799091991] [2022-04-27 16:16:50,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:50,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:50,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:50,511 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-27 16:16:50,512 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-27 16:16:50,512 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-27 16:16:50,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 16:16:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:50,518 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-27 16:16:50,519 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-27 16:16:50,519 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-27 16:16:50,520 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-27 16:16:50,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-27 16:16:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:50,525 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-27 16:16:50,525 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-27 16:16:50,525 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-27 16:16:50,526 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-27 16:16:50,526 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-27 16:16:50,527 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-27 16:16:50,527 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-27 16:16:50,527 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-27 16:16:50,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {907#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-27 16:16:50,527 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-27 16:16:50,527 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-27 16:16:50,528 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-27 16:16:50,528 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-27 16:16:50,529 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-27 16:16:50,529 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-27 16:16:50,530 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-27 16:16:50,530 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-27 16:16:50,530 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-27 16:16:50,530 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-27 16:16:50,531 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-27 16:16:50,531 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-27 16:16:50,532 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-27 16:16:50,532 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-27 16:16:50,532 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-27 16:16:50,533 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-27 16:16:50,533 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-27 16:16:50,534 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-27 16:16:50,534 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-27 16:16:50,534 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-27 16:16:50,534 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-27 16:16:50,534 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-27 16:16:50,535 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-27 16:16:50,535 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-27 16:16:50,536 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-27 16:16:50,536 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-27 16:16:50,536 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-27 16:16:50,537 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-27 16:16:50,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:50,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799091991] [2022-04-27 16:16:50,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799091991] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:16:50,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048627357] [2022-04-27 16:16:50,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:50,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:16:50,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:16:50,538 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:16:50,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 16:16:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:50,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 16:16:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:50,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:16:50,751 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-27 16:16:50,751 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-27 16:16:50,751 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-27 16:16:50,752 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-27 16:16:50,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {907#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-27 16:16:50,752 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-27 16:16:50,752 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-27 16:16:50,752 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-27 16:16:50,752 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-27 16:16:50,752 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-27 16:16:50,753 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-27 16:16:50,754 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-27 16:16:50,754 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-27 16:16:50,754 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-27 16:16:50,754 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-27 16:16:50,755 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-27 16:16:50,755 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-27 16:16:50,755 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-27 16:16:50,756 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-27 16:16:50,756 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-27 16:16:50,757 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-27 16:16:50,758 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-27 16:16:50,758 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-27 16:16:50,758 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-27 16:16:50,758 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-27 16:16:50,759 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-27 16:16:50,759 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-27 16:16:50,759 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-27 16:16:50,759 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-27 16:16:50,759 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-27 16:16:50,759 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-27 16:16:50,760 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-27 16:16:50,760 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-27 16:16:50,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:16:50,912 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-27 16:16:50,912 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-27 16:16:50,912 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-27 16:16:50,912 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-27 16:16:50,912 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-27 16:16:50,913 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-27 16:16:50,913 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-27 16:16:50,913 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-27 16:16:50,913 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-27 16:16:50,913 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-27 16:16:50,916 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-27 16:16:50,917 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-27 16:16:50,917 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-27 16:16:50,918 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-27 16:16:50,919 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-27 16:16:50,919 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-27 16:16:50,919 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-27 16:16:50,919 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-27 16:16:50,919 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-27 16:16:50,920 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-27 16:16:50,921 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-27 16:16:50,921 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-27 16:16:50,921 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-27 16:16:50,921 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-27 16:16:50,921 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-27 16:16:50,921 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-27 16:16:50,921 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-27 16:16:50,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {907#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {907#true} is VALID [2022-04-27 16:16:50,922 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-27 16:16:50,922 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-27 16:16:50,922 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-27 16:16:50,922 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-27 16:16:50,922 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-27 16:16:50,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048627357] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:16:50,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:16:50,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 14 [2022-04-27 16:16:50,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521138969] [2022-04-27 16:16:50,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:16:50,924 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-27 16:16:50,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:50,925 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-27 16:16:50,963 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-27 16:16:50,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 16:16:50,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:50,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 16:16:50,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-27 16:16:50,965 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-27 16:16:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:52,267 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2022-04-27 16:16:52,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 16:16:52,268 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-27 16:16:52,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:52,268 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-27 16:16:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 93 transitions. [2022-04-27 16:16:52,272 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-27 16:16:52,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 93 transitions. [2022-04-27 16:16:52,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 93 transitions. [2022-04-27 16:16:52,364 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-27 16:16:52,367 INFO L225 Difference]: With dead ends: 94 [2022-04-27 16:16:52,367 INFO L226 Difference]: Without dead ends: 94 [2022-04-27 16:16:52,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 16:16:52,368 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 82 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-27 16:16:52,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 66 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 16:16:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-27 16:16:52,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 66. [2022-04-27 16:16:52,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:52,374 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-27 16:16:52,374 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-27 16:16:52,374 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-27 16:16:52,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:52,378 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2022-04-27 16:16:52,378 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2022-04-27 16:16:52,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:52,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:52,380 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-27 16:16:52,380 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-27 16:16:52,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:52,384 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2022-04-27 16:16:52,384 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2022-04-27 16:16:52,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:52,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:52,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:52,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:52,385 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-27 16:16:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2022-04-27 16:16:52,388 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 32 [2022-04-27 16:16:52,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:52,388 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2022-04-27 16:16:52,388 INFO L496 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-27 16:16:52,389 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2022-04-27 16:16:52,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 16:16:52,389 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:52,390 INFO L195 NwaCegarLoop]: 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-27 16:16:52,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 16:16:52,612 WARN L477 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-27 16:16:52,613 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:52,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:52,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1763990758, now seen corresponding path program 1 times [2022-04-27 16:16:52,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:52,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511099585] [2022-04-27 16:16:52,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:52,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:52,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:52,717 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-27 16:16:52,718 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-27 16:16:52,718 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-27 16:16:52,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 16:16:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:52,723 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-27 16:16:52,723 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-27 16:16:52,724 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-27 16:16:52,724 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-27 16:16:52,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-27 16:16:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:52,728 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-27 16:16:52,728 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-27 16:16:52,729 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-27 16:16:52,729 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-27 16:16:52,729 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-27 16:16:52,730 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-27 16:16:52,730 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-27 16:16:52,730 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-27 16:16:52,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {1516#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-27 16:16:52,730 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-27 16:16:52,730 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-27 16:16:52,730 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-27 16:16:52,731 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-27 16:16:52,731 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-27 16:16:52,732 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-27 16:16:52,732 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-27 16:16:52,732 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-27 16:16:52,733 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-27 16:16:52,733 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-27 16:16:52,733 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-27 16:16:52,733 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-27 16:16:52,734 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-27 16:16:52,734 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-27 16:16:52,735 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-27 16:16:52,735 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-27 16:16:52,736 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-27 16:16:52,736 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-27 16:16:52,736 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-27 16:16:52,737 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-27 16:16:52,737 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-27 16:16:52,737 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-27 16:16:52,737 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-27 16:16:52,737 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-27 16:16:52,737 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-27 16:16:52,737 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-27 16:16:52,737 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-27 16:16:52,737 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-27 16:16:52,738 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-27 16:16:52,738 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-27 16:16:52,738 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-27 16:16:52,738 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-27 16:16:52,738 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-27 16:16:52,738 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-27 16:16:52,738 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-27 16:16:52,738 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-27 16:16:52,739 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-27 16:16:52,739 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-27 16:16:52,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:52,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511099585] [2022-04-27 16:16:52,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511099585] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:16:52,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500614459] [2022-04-27 16:16:52,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:52,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:16:52,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:16:52,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:16:52,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 16:16:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:52,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 16:16:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:52,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:16:53,395 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-27 16:16:53,395 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-27 16:16:53,395 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-27 16:16:53,395 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-27 16:16:53,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {1516#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-27 16:16:53,396 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-27 16:16:53,396 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-27 16:16:53,396 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-27 16:16:53,398 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-27 16:16:53,399 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-27 16:16:53,399 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-27 16:16:53,400 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-27 16:16:53,400 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-27 16:16:53,400 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-27 16:16:53,401 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-27 16:16:53,401 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-27 16:16:53,401 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-27 16:16:53,401 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-27 16:16:53,402 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-27 16:16:53,403 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-27 16:16:53,403 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-27 16:16:53,404 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-27 16:16:53,404 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-27 16:16:53,405 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-27 16:16:53,405 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-27 16:16:53,405 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-27 16:16:53,406 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-27 16:16:53,406 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-27 16:16:53,406 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-27 16:16:53,406 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-27 16:16:53,406 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-27 16:16:53,406 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-27 16:16:53,407 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-27 16:16:53,407 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-27 16:16:53,407 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-27 16:16:53,407 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-27 16:16:53,407 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-27 16:16:53,407 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-27 16:16:53,407 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-27 16:16:53,408 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-27 16:16:53,408 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-27 16:16:53,408 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-27 16:16:53,408 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-27 16:16:53,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:16:53,628 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-27 16:16:53,628 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-27 16:16:53,628 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-27 16:16:53,629 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-27 16:16:53,629 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-27 16:16:53,629 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-27 16:16:53,629 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-27 16:16:53,631 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-27 16:16:53,631 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-27 16:16:53,631 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-27 16:16:53,632 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-27 16:16:53,632 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-27 16:16:53,632 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-27 16:16:53,632 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-27 16:16:53,633 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-27 16:16:53,633 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-27 16:16:53,633 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-27 16:16:53,633 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-27 16:16:53,635 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-27 16:16:53,636 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-27 16:16:53,637 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-27 16:16:53,637 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-27 16:16:53,639 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-27 16:16:53,640 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-27 16:16:53,641 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-27 16:16:53,641 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-27 16:16:53,641 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-27 16:16:53,641 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-27 16:16:53,642 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-27 16:16:53,642 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-27 16:16:53,644 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-27 16:16:53,644 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-27 16:16:53,645 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-27 16:16:53,645 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-27 16:16:53,646 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-27 16:16:53,646 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-27 16:16:53,646 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-27 16:16:53,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {1516#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1516#true} is VALID [2022-04-27 16:16:53,646 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-27 16:16:53,646 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-27 16:16:53,647 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-27 16:16:53,647 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-27 16:16:53,647 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-27 16:16:53,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500614459] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:16:53,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:16:53,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-04-27 16:16:53,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357708578] [2022-04-27 16:16:53,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:16:53,648 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-27 16:16:53,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:53,649 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-27 16:16:53,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:53,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 16:16:53,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:53,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 16:16:53,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-04-27 16:16:53,704 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-27 16:16:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:54,345 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2022-04-27 16:16:54,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 16:16:54,345 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-27 16:16:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:54,345 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-27 16:16:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2022-04-27 16:16:54,348 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-27 16:16:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2022-04-27 16:16:54,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 72 transitions. [2022-04-27 16:16:54,428 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-27 16:16:54,430 INFO L225 Difference]: With dead ends: 86 [2022-04-27 16:16:54,430 INFO L226 Difference]: Without dead ends: 82 [2022-04-27 16:16:54,430 INFO L412 NwaCegarLoop]: 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-27 16:16:54,431 INFO L413 NwaCegarLoop]: 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-27 16:16:54,431 INFO L414 NwaCegarLoop]: 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-27 16:16:54,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-27 16:16:54,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2022-04-27 16:16:54,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:54,436 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-27 16:16:54,436 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-27 16:16:54,437 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-27 16:16:54,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:54,440 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2022-04-27 16:16:54,440 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-04-27 16:16:54,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:54,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:54,441 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-27 16:16:54,441 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-27 16:16:54,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:54,445 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2022-04-27 16:16:54,445 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-04-27 16:16:54,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:54,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:54,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:54,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:54,446 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-27 16:16:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2022-04-27 16:16:54,449 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 42 [2022-04-27 16:16:54,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:54,449 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2022-04-27 16:16:54,449 INFO L496 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-27 16:16:54,449 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-27 16:16:54,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 16:16:54,450 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:54,450 INFO L195 NwaCegarLoop]: 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-27 16:16:54,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 16:16:54,663 WARN L477 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-27 16:16:54,663 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:54,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:54,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1192666941, now seen corresponding path program 1 times [2022-04-27 16:16:54,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:54,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507284050] [2022-04-27 16:16:54,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:54,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:54,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:54,767 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-27 16:16:54,768 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-27 16:16:54,768 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-27 16:16:54,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 16:16:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:54,776 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-27 16:16:54,776 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-27 16:16:54,776 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-27 16:16:54,777 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-27 16:16:54,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 16:16:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:54,786 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-27 16:16:54,787 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-27 16:16:54,790 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-27 16:16:54,794 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-27 16:16:54,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-27 16:16:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:54,804 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-27 16:16:54,805 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-27 16:16:54,805 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-27 16:16:54,805 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-27 16:16:54,809 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-27 16:16:54,809 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-27 16:16:54,809 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-27 16:16:54,809 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-27 16:16:54,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {2132#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-27 16:16:54,810 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-27 16:16:54,810 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-27 16:16:54,810 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-27 16:16:54,810 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-27 16:16:54,811 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-27 16:16:54,811 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-27 16:16:54,811 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-27 16:16:54,812 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-27 16:16:54,812 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-27 16:16:54,812 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-27 16:16:54,812 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-27 16:16:54,813 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-27 16:16:54,813 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-27 16:16:54,813 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-27 16:16:54,813 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-27 16:16:54,813 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-27 16:16:54,814 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-27 16:16:54,814 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-27 16:16:54,815 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-27 16:16:54,815 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-27 16:16:54,816 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-27 16:16:54,816 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-27 16:16:54,816 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-27 16:16:54,816 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-27 16:16:54,816 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-27 16:16:54,816 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-27 16:16:54,816 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-27 16:16:54,816 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-27 16:16:54,816 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-27 16:16:54,816 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-27 16:16:54,816 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-27 16:16:54,817 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-27 16:16:54,817 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-27 16:16:54,817 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-27 16:16:54,817 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-27 16:16:54,817 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-27 16:16:54,817 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-27 16:16:54,817 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-27 16:16:54,817 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-27 16:16:54,818 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-27 16:16:54,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:54,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507284050] [2022-04-27 16:16:54,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507284050] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:16:54,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483072699] [2022-04-27 16:16:54,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:54,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:16:54,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:16:54,824 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:16:54,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 16:16:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:54,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 16:16:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:54,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:16:55,379 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-27 16:16:55,380 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-27 16:16:55,380 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-27 16:16:55,380 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-27 16:16:55,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {2132#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-27 16:16:55,380 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-27 16:16:55,380 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-27 16:16:55,380 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-27 16:16:55,380 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-27 16:16:55,381 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-27 16:16:55,381 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-27 16:16:55,383 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-27 16:16:55,383 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-27 16:16:55,383 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-27 16:16:55,383 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-27 16:16:55,383 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-27 16:16:55,384 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-27 16:16:55,384 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-27 16:16:55,384 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-27 16:16:55,384 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-27 16:16:55,384 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-27 16:16:55,384 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-27 16:16:55,385 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-27 16:16:55,385 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-27 16:16:55,386 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-27 16:16:55,387 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-27 16:16:55,387 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-27 16:16:55,387 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-27 16:16:55,387 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-27 16:16:55,387 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-27 16:16:55,387 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-27 16:16:55,387 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-27 16:16:55,387 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-27 16:16:55,387 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-27 16:16:55,387 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-27 16:16:55,388 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-27 16:16:55,388 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-27 16:16:55,388 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-27 16:16:55,388 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-27 16:16:55,388 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-27 16:16:55,388 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-27 16:16:55,388 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-27 16:16:55,388 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-27 16:16:55,388 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-27 16:16:55,389 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-27 16:16:55,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:16:55,588 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-27 16:16:55,588 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-27 16:16:55,589 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-27 16:16:55,589 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-27 16:16:55,589 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-27 16:16:55,589 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-27 16:16:55,589 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-27 16:16:55,589 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-27 16:16:55,589 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-27 16:16:55,589 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-27 16:16:55,589 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-27 16:16:55,589 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-27 16:16:55,589 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-27 16:16:55,590 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-27 16:16:55,590 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-27 16:16:55,590 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-27 16:16:55,590 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-27 16:16:55,590 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-27 16:16:55,604 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-27 16:16:55,605 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-27 16:16:55,605 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-27 16:16:55,606 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-27 16:16:55,607 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-27 16:16:55,607 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-27 16:16:55,607 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-27 16:16:55,607 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-27 16:16:55,607 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-27 16:16:55,608 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-27 16:16:55,608 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-27 16:16:55,608 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-27 16:16:55,609 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-27 16:16:55,609 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-27 16:16:55,609 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-27 16:16:55,610 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-27 16:16:55,613 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-27 16:16:55,614 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-27 16:16:55,614 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-27 16:16:55,614 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-27 16:16:55,615 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-27 16:16:55,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {2132#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2132#true} is VALID [2022-04-27 16:16:55,615 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-27 16:16:55,615 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-27 16:16:55,615 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-27 16:16:55,615 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-27 16:16:55,615 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-27 16:16:55,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483072699] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:16:55,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:16:55,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-04-27 16:16:55,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104875373] [2022-04-27 16:16:55,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:16:55,617 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-27 16:16:55,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:55,617 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-27 16:16:55,664 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-27 16:16:55,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 16:16:55,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:55,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 16:16:55,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-27 16:16:55,665 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-27 16:16:56,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:56,337 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2022-04-27 16:16:56,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:16:56,338 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-27 16:16:56,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:56,338 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-27 16:16:56,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-04-27 16:16:56,340 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-27 16:16:56,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-04-27 16:16:56,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 75 transitions. [2022-04-27 16:16:56,411 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-27 16:16:56,412 INFO L225 Difference]: With dead ends: 95 [2022-04-27 16:16:56,413 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 16:16:56,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-04-27 16:16:56,413 INFO L413 NwaCegarLoop]: 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-27 16:16:56,414 INFO L414 NwaCegarLoop]: 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-27 16:16:56,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 16:16:56,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2022-04-27 16:16:56,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:56,419 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-27 16:16:56,419 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-27 16:16:56,420 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-27 16:16:56,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:56,423 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-27 16:16:56,423 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-27 16:16:56,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:56,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:56,424 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-27 16:16:56,425 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-27 16:16:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:56,428 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-27 16:16:56,428 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-27 16:16:56,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:56,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:56,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:56,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:56,429 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-27 16:16:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2022-04-27 16:16:56,432 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 44 [2022-04-27 16:16:56,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:56,432 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2022-04-27 16:16:56,432 INFO L496 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-27 16:16:56,433 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2022-04-27 16:16:56,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 16:16:56,433 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:56,433 INFO L195 NwaCegarLoop]: 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-27 16:16:56,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 16:16:56,651 WARN L477 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-27 16:16:56,651 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:56,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:56,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1839163900, now seen corresponding path program 1 times [2022-04-27 16:16:56,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:56,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131705395] [2022-04-27 16:16:56,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:56,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:56,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:56,728 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-27 16:16:56,728 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-27 16:16:56,728 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-27 16:16:56,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 16:16:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:56,732 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-27 16:16:56,732 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-27 16:16:56,732 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-27 16:16:56,732 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-27 16:16:56,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 16:16:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:56,738 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-27 16:16:56,739 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-27 16:16:56,739 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-27 16:16:56,739 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-27 16:16:56,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 16:16:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:56,742 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-27 16:16:56,742 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-27 16:16:56,742 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-27 16:16:56,743 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-27 16:16:56,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-27 16:16:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:56,746 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-27 16:16:56,747 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-27 16:16:56,747 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-27 16:16:56,747 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-27 16:16:56,748 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-27 16:16:56,748 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-27 16:16:56,748 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-27 16:16:56,748 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-27 16:16:56,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {2795#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-27 16:16:56,748 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-27 16:16:56,749 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-27 16:16:56,749 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-27 16:16:56,749 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-27 16:16:56,749 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-27 16:16:56,749 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-27 16:16:56,749 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-27 16:16:56,749 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-27 16:16:56,749 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-27 16:16:56,749 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-27 16:16:56,749 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-27 16:16:56,749 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-27 16:16:56,750 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-27 16:16:56,750 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-27 16:16:56,750 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-27 16:16:56,750 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-27 16:16:56,750 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-27 16:16:56,750 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-27 16:16:56,750 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-27 16:16:56,750 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-27 16:16:56,750 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-27 16:16:56,750 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-27 16:16:56,750 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-27 16:16:56,751 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-27 16:16:56,751 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-27 16:16:56,751 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-27 16:16:56,751 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-27 16:16:56,751 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-27 16:16:56,751 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-27 16:16:56,751 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-27 16:16:56,751 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-27 16:16:56,751 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-27 16:16:56,752 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-27 16:16:56,752 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-27 16:16:56,753 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-27 16:16:56,753 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-27 16:16:56,753 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-27 16:16:56,753 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-27 16:16:56,754 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-27 16:16:56,754 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-27 16:16:56,754 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-27 16:16:56,754 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-27 16:16:56,755 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-27 16:16:56,755 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-27 16:16:56,755 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-27 16:16:56,755 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-27 16:16:56,756 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-27 16:16:56,756 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-27 16:16:56,757 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-27 16:16:56,757 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-27 16:16:56,757 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-27 16:16:56,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:56,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131705395] [2022-04-27 16:16:56,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131705395] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:16:56,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568797076] [2022-04-27 16:16:56,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:56,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:16:56,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:16:56,759 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:16:56,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 16:16:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:56,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 16:16:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:56,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:16:57,377 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-27 16:16:57,378 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-27 16:16:57,378 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-27 16:16:57,378 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-27 16:16:57,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {2795#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-27 16:16:57,378 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-27 16:16:57,378 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-27 16:16:57,378 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-27 16:16:57,378 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-27 16:16:57,378 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-27 16:16:57,379 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-27 16:16:57,379 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-27 16:16:57,379 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-27 16:16:57,379 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-27 16:16:57,379 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-27 16:16:57,379 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-27 16:16:57,380 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-27 16:16:57,380 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-27 16:16:57,380 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-27 16:16:57,380 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-27 16:16:57,380 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-27 16:16:57,381 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-27 16:16:57,381 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-27 16:16:57,381 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-27 16:16:57,382 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-27 16:16:57,382 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-27 16:16:57,382 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-27 16:16:57,382 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-27 16:16:57,382 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-27 16:16:57,382 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-27 16:16:57,383 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-27 16:16:57,383 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-27 16:16:57,383 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-27 16:16:57,384 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-27 16:16:57,384 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-27 16:16:57,384 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-27 16:16:57,385 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-27 16:16:57,385 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-27 16:16:57,386 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-27 16:16:57,386 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-27 16:16:57,386 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-27 16:16:57,386 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-27 16:16:57,386 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-27 16:16:57,386 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-27 16:16:57,386 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-27 16:16:57,386 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-27 16:16:57,386 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-27 16:16:57,386 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-27 16:16:57,386 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-27 16:16:57,386 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-27 16:16:57,386 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-27 16:16:57,386 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-27 16:16:57,387 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-27 16:16:57,387 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-27 16:16:57,387 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-27 16:16:57,387 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-27 16:16:57,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:16:57,605 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-27 16:16:57,605 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-27 16:16:57,605 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-27 16:16:57,605 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-27 16:16:57,606 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-27 16:16:57,606 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-27 16:16:57,606 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-27 16:16:57,606 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-27 16:16:57,606 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-27 16:16:57,606 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-27 16:16:57,606 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-27 16:16:57,606 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-27 16:16:57,606 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-27 16:16:57,606 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-27 16:16:57,606 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-27 16:16:57,606 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-27 16:16:57,606 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-27 16:16:57,607 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-27 16:16:57,607 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-27 16:16:57,608 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-27 16:16:57,608 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-27 16:16:57,608 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-27 16:16:57,609 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-27 16:16:57,609 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-27 16:16:57,609 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-27 16:16:57,610 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-27 16:16:57,610 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-27 16:16:57,610 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-27 16:16:57,610 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-27 16:16:57,610 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-27 16:16:57,610 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-27 16:16:57,611 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-27 16:16:57,611 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-27 16:16:57,612 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-27 16:16:57,612 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-27 16:16:57,612 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-27 16:16:57,612 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-27 16:16:57,612 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-27 16:16:57,612 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-27 16:16:57,612 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-27 16:16:57,612 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-27 16:16:57,613 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-27 16:16:57,613 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-27 16:16:57,613 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-27 16:16:57,613 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-27 16:16:57,614 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-27 16:16:57,614 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-27 16:16:57,614 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-27 16:16:57,614 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-27 16:16:57,614 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-27 16:16:57,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {2795#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2795#true} is VALID [2022-04-27 16:16:57,614 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-27 16:16:57,614 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-27 16:16:57,614 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-27 16:16:57,614 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-27 16:16:57,615 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-27 16:16:57,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568797076] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:16:57,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:16:57,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2022-04-27 16:16:57,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143994442] [2022-04-27 16:16:57,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:16:57,616 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-27 16:16:57,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:57,617 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-27 16:16:57,674 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-27 16:16:57,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 16:16:57,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:57,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 16:16:57,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-04-27 16:16:57,675 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-27 16:16:59,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:59,041 INFO L93 Difference]: Finished difference Result 123 states and 169 transitions. [2022-04-27 16:16:59,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 16:16:59,041 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-27 16:16:59,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:59,042 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-27 16:16:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 98 transitions. [2022-04-27 16:16:59,045 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-27 16:16:59,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 98 transitions. [2022-04-27 16:16:59,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 98 transitions. [2022-04-27 16:16:59,152 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-27 16:16:59,152 INFO L225 Difference]: With dead ends: 123 [2022-04-27 16:16:59,152 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:16:59,153 INFO L412 NwaCegarLoop]: 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-27 16:16:59,155 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 82 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-27 16:16:59,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 64 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 16:16:59,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:16:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:16:59,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:59,156 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-27 16:16:59,156 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-27 16:16:59,157 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-27 16:16:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:59,157 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:16:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:16:59,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:59,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:59,157 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-27 16:16:59,157 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-27 16:16:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:59,157 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:16:59,158 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:16:59,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:59,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:59,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:59,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:59,158 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-27 16:16:59,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:16:59,158 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2022-04-27 16:16:59,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:59,158 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:16:59,158 INFO L496 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-27 16:16:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:16:59,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:59,161 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:16:59,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 16:16:59,383 WARN L477 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-27 16:16:59,386 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:16:59,388 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:16:59,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:16:59 BasicIcfg [2022-04-27 16:16:59,390 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:16:59,391 INFO L158 Benchmark]: Toolchain (without parser) took 13406.63ms. Allocated memory was 182.5MB in the beginning and 270.5MB in the end (delta: 88.1MB). Free memory was 126.0MB in the beginning and 198.9MB in the end (delta: -72.8MB). Peak memory consumption was 16.1MB. Max. memory is 8.0GB. [2022-04-27 16:16:59,391 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:16:59,392 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.72ms. Allocated memory was 182.5MB in the beginning and 225.4MB in the end (delta: 43.0MB). Free memory was 125.8MB in the beginning and 197.8MB in the end (delta: -71.9MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-04-27 16:16:59,392 INFO L158 Benchmark]: Boogie Preprocessor took 41.46ms. Allocated memory is still 225.4MB. Free memory was 197.8MB in the beginning and 196.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:16:59,392 INFO L158 Benchmark]: RCFGBuilder took 270.66ms. Allocated memory is still 225.4MB. Free memory was 196.2MB in the beginning and 183.1MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 16:16:59,392 INFO L158 Benchmark]: IcfgTransformer took 31.99ms. Allocated memory is still 225.4MB. Free memory was 183.1MB in the beginning and 181.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:16:59,393 INFO L158 Benchmark]: TraceAbstraction took 12803.26ms. Allocated memory was 225.4MB in the beginning and 270.5MB in the end (delta: 45.1MB). Free memory was 180.5MB in the beginning and 198.9MB in the end (delta: -18.4MB). Peak memory consumption was 27.5MB. Max. memory is 8.0GB. [2022-04-27 16:16:59,395 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.72ms. Allocated memory was 182.5MB in the beginning and 225.4MB in the end (delta: 43.0MB). Free memory was 125.8MB in the beginning and 197.8MB in the end (delta: -71.9MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.46ms. Allocated memory is still 225.4MB. Free memory was 197.8MB in the beginning and 196.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 270.66ms. Allocated memory is still 225.4MB. Free memory was 196.2MB in the beginning and 183.1MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 31.99ms. Allocated memory is still 225.4MB. Free memory was 183.1MB in the beginning and 181.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 12803.26ms. Allocated memory was 225.4MB in the beginning and 270.5MB in the end (delta: 45.1MB). Free memory was 180.5MB in the beginning and 198.9MB in the end (delta: -18.4MB). Peak memory consumption was 27.5MB. 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: 12.8s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 456 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 442 mSDsluCounter, 467 SdHoareTripleChecker+Invalid, 2.0s 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.5s 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.7s 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-27 16:16:59,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...