/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/seq-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 17:03:37,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 17:03:37,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 17:03:37,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 17:03:37,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 17:03:37,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 17:03:37,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 17:03:37,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 17:03:37,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 17:03:37,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 17:03:37,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 17:03:37,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 17:03:37,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 17:03:37,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 17:03:37,333 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 17:03:37,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 17:03:37,334 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 17:03:37,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 17:03:37,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 17:03:37,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 17:03:37,338 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 17:03:37,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 17:03:37,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 17:03:37,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 17:03:37,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 17:03:37,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 17:03:37,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 17:03:37,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 17:03:37,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 17:03:37,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 17:03:37,346 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 17:03:37,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 17:03:37,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 17:03:37,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 17:03:37,348 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 17:03:37,349 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 17:03:37,349 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 17:03:37,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 17:03:37,350 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 17:03:37,350 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 17:03:37,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 17:03:37,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 17:03:37,352 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 17:03:37,362 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 17:03:37,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 17:03:37,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 17:03:37,364 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 17:03:37,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 17:03:37,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 17:03:37,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 17:03:37,364 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 17:03:37,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 17:03:37,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 17:03:37,365 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 17:03:37,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 17:03:37,365 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 17:03:37,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 17:03:37,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 17:03:37,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 17:03:37,365 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 17:03:37,366 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 17:03:37,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:03:37,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 17:03:37,366 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 17:03:37,367 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 17:03:37,367 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 17:03:37,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 17:03:37,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 17:03:37,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 17:03:37,649 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 17:03:37,651 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 17:03:37,652 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/seq-3.i [2022-04-07 17:03:37,711 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc97fc36/0b98ef5186324994aaab9536ce153565/FLAG97f8aa224 [2022-04-07 17:03:38,168 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 17:03:38,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/seq-3.i [2022-04-07 17:03:38,175 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc97fc36/0b98ef5186324994aaab9536ce153565/FLAG97f8aa224 [2022-04-07 17:03:38,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc97fc36/0b98ef5186324994aaab9536ce153565 [2022-04-07 17:03:38,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 17:03:38,565 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 17:03:38,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 17:03:38,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 17:03:38,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 17:03:38,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:03:38" (1/1) ... [2022-04-07 17:03:38,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24ceed55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:38, skipping insertion in model container [2022-04-07 17:03:38,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:03:38" (1/1) ... [2022-04-07 17:03:38,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 17:03:38,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 17:03:38,811 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/seq-3.i[893,906] [2022-04-07 17:03:38,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:03:38,847 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 17:03:38,861 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/seq-3.i[893,906] [2022-04-07 17:03:38,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:03:38,889 INFO L208 MainTranslator]: Completed translation [2022-04-07 17:03:38,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:38 WrapperNode [2022-04-07 17:03:38,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 17:03:38,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 17:03:38,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 17:03:38,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 17:03:38,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:38" (1/1) ... [2022-04-07 17:03:38,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:38" (1/1) ... [2022-04-07 17:03:38,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:38" (1/1) ... [2022-04-07 17:03:38,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:38" (1/1) ... [2022-04-07 17:03:38,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:38" (1/1) ... [2022-04-07 17:03:38,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:38" (1/1) ... [2022-04-07 17:03:38,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:38" (1/1) ... [2022-04-07 17:03:38,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 17:03:38,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 17:03:38,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 17:03:38,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 17:03:38,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:38" (1/1) ... [2022-04-07 17:03:38,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:03:38,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:38,980 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 17:03:39,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 17:03:39,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 17:03:39,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 17:03:39,021 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 17:03:39,021 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 17:03:39,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 17:03:39,022 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 17:03:39,022 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 17:03:39,022 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 17:03:39,022 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 17:03:39,022 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 17:03:39,022 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 17:03:39,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 17:03:39,023 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 17:03:39,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 17:03:39,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 17:03:39,024 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 17:03:39,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 17:03:39,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 17:03:39,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 17:03:39,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 17:03:39,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 17:03:39,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 17:03:39,108 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 17:03:39,110 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 17:03:39,352 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 17:03:39,359 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 17:03:39,359 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-07 17:03:39,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:03:39 BoogieIcfgContainer [2022-04-07 17:03:39,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 17:03:39,362 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 17:03:39,362 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 17:03:39,363 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 17:03:39,366 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:03:39" (1/1) ... [2022-04-07 17:03:39,368 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 17:03:39,766 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-07 17:03:39,766 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) (< v_main_~i0~0_2 v_main_~n0~0_1) (= v_main_~i0~0_1 (+ v_main_~i0~0_2 1))) InVars {main_~k~0=v_main_~k~0_2, main_~i0~0=v_main_~i0~0_2, main_~n0~0=v_main_~n0~0_1} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post4=|v_main_#t~post4_1|, main_~i0~0=v_main_~i0~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~n0~0=v_main_~n0~0_1} AuxVars[] AssignedVars[main_~k~0, main_#t~post4, main_~i0~0, main_#t~post3] to Formula: (or (and (< v_main_~i0~0_1 (+ v_main_~n0~0_1 1)) (< v_main_~i0~0_2 v_main_~i0~0_1) (= (+ v_main_~i0~0_2 v_main_~k~0_1) (+ v_main_~i0~0_1 v_main_~k~0_2))) (and (= v_main_~k~0_2 v_main_~k~0_1) (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (<= v_main_~n0~0_1 v_main_~i0~0_2) (= v_main_~i0~0_2 v_main_~i0~0_1) (= |v_main_#t~post4_3| |v_main_#t~post4_1|))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~i0~0=v_main_~i0~0_2, main_#t~post3=|v_main_#t~post3_3|, main_~n0~0=v_main_~n0~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i0~0=v_main_~i0~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~n0~0=v_main_~n0~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_#t~post4, main_~i0~0, main_#t~post3] [2022-04-07 17:03:40,087 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-07 17:03:40,088 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~i1~0_3 (+ v_main_~i1~0_4 1)) (< v_main_~i1~0_4 v_main_~n1~0_2) (= v_main_~k~0_3 (+ v_main_~k~0_4 1))) InVars {main_~n1~0=v_main_~n1~0_2, main_~i1~0=v_main_~i1~0_4, main_~k~0=v_main_~k~0_4} OutVars{main_~n1~0=v_main_~n1~0_2, main_~i1~0=v_main_~i1~0_3, main_~k~0=v_main_~k~0_3, main_#t~post5=|v_main_#t~post5_1|, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~i1~0, main_~k~0, main_#t~post5, main_#t~post6] to Formula: (or (and (= v_main_~k~0_4 v_main_~k~0_3) (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (= v_main_~i1~0_3 v_main_~i1~0_4) (not (< v_main_~i1~0_4 v_main_~n1~0_2))) (and (< v_main_~i1~0_4 v_main_~i1~0_3) (= (+ v_main_~i1~0_4 v_main_~k~0_3) (+ v_main_~i1~0_3 v_main_~k~0_4)) (< v_main_~i1~0_3 (+ v_main_~n1~0_2 1)))) InVars {main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_3|, main_~i1~0=v_main_~i1~0_4, main_~k~0=v_main_~k~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~i1~0=v_main_~i1~0_3, main_~k~0=v_main_~k~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~i1~0, main_~k~0, main_#t~post5, main_#t~post6] [2022-04-07 17:03:40,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:03:40 BasicIcfg [2022-04-07 17:03:40,103 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 17:03:40,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 17:03:40,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 17:03:40,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 17:03:40,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 05:03:38" (1/4) ... [2022-04-07 17:03:40,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2962e193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:03:40, skipping insertion in model container [2022-04-07 17:03:40,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:38" (2/4) ... [2022-04-07 17:03:40,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2962e193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:03:40, skipping insertion in model container [2022-04-07 17:03:40,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:03:39" (3/4) ... [2022-04-07 17:03:40,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2962e193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:03:40, skipping insertion in model container [2022-04-07 17:03:40,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:03:40" (4/4) ... [2022-04-07 17:03:40,116 INFO L111 eAbstractionObserver]: Analyzing ICFG seq-3.iJordan [2022-04-07 17:03:40,124 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 17:03:40,124 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 17:03:40,168 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 17:03:40,174 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 17:03:40,175 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 17:03:40,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:03:40,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 17:03:40,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:40,196 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:40,196 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:40,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:40,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1622270520, now seen corresponding path program 1 times [2022-04-07 17:03:40,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:40,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746300627] [2022-04-07 17:03:40,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:40,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:40,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:40,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [89] 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] {28#true} is VALID [2022-04-07 17:03:40,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-07 17:03:40,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-07 17:03:40,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:03:40,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [89] 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] {28#true} is VALID [2022-04-07 17:03:40,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-07 17:03:40,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-07 17:03:40,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-07 17:03:40,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} [91] mainENTRY-->L30: Formula: (and (= v_main_~i0~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_5 0) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~n1~0_3 |v_main_#t~nondet2_2|) (= v_main_~n0~0_2 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_3, main_~i0~0=v_main_~i0~0_3, main_~n0~0=v_main_~n0~0_2, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~n1~0, main_#t~nondet1, main_~k~0, main_#t~nondet2, main_~i0~0, main_~n0~0] {28#true} is VALID [2022-04-07 17:03:40,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} [94] L30-->L31: Formula: (and (<= 0 (+ v_main_~n0~0_6 1000000)) (< v_main_~n0~0_6 1000000)) InVars {main_~n0~0=v_main_~n0~0_6} OutVars{main_~n0~0=v_main_~n0~0_6} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-07 17:03:40,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#true} [97] L31-->L32-2: Formula: (and (< v_main_~n1~0_7 1000000) (<= 0 (+ v_main_~n1~0_7 1000000))) InVars {main_~n1~0=v_main_~n1~0_7} OutVars{main_~n1~0=v_main_~n1~0_7} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-07 17:03:40,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#true} [98] L32-2-->L32-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-07 17:03:40,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} [101] L32-3-->L37-2: Formula: (= v_main_~i1~0_1 0) InVars {} OutVars{main_~i1~0=v_main_~i1~0_1} AuxVars[] AssignedVars[main_~i1~0] {29#false} is VALID [2022-04-07 17:03:40,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} [102] L37-2-->L37-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-07 17:03:40,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} [105] L37-3-->L42-2: Formula: (= v_main_~j1~0_1 0) InVars {} OutVars{main_~j1~0=v_main_~j1~0_1} AuxVars[] AssignedVars[main_~j1~0] {29#false} is VALID [2022-04-07 17:03:40,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} [108] L42-2-->L43: Formula: (< v_main_~j1~0_3 (+ v_main_~n0~0_8 v_main_~n1~0_9)) InVars {main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} OutVars{main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-07 17:03:40,384 INFO L272 TraceCheckUtils]: 13: Hoare triple {29#false} [109] L43-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {29#false} is VALID [2022-04-07 17:03:40,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} [111] __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] {29#false} is VALID [2022-04-07 17:03:40,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {29#false} [112] 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[] {29#false} is VALID [2022-04-07 17:03:40,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-07 17:03:40,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:40,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:40,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746300627] [2022-04-07 17:03:40,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746300627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:03:40,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:03:40,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 17:03:40,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105824586] [2022-04-07 17:03:40,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:03:40,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 17:03:40,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:40,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:40,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:40,423 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 17:03:40,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:40,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 17:03:40,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 17:03:40,449 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:40,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:40,522 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-07 17:03:40,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 17:03:40,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 17:03:40,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:40,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-04-07 17:03:40,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:40,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-04-07 17:03:40,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2022-04-07 17:03:40,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:40,584 INFO L225 Difference]: With dead ends: 25 [2022-04-07 17:03:40,584 INFO L226 Difference]: Without dead ends: 21 [2022-04-07 17:03:40,586 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 17:03:40,589 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:40,590 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 17:03:40,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-07 17:03:40,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-07 17:03:40,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:40,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:40,619 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:40,620 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:40,625 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-07 17:03:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-07 17:03:40,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:40,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:40,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-04-07 17:03:40,626 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-04-07 17:03:40,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:40,630 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-07 17:03:40,630 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-07 17:03:40,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:40,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:40,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:40,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:40,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-07 17:03:40,635 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-04-07 17:03:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:40,636 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-07 17:03:40,636 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-07 17:03:40,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 17:03:40,637 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:40,637 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:40,637 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 17:03:40,638 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:40,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:40,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1752745994, now seen corresponding path program 1 times [2022-04-07 17:03:40,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:40,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443572199] [2022-04-07 17:03:40,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:40,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:40,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:40,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [89] 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] {124#true} is VALID [2022-04-07 17:03:40,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {124#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-07 17:03:40,817 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {124#true} {124#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-07 17:03:40,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {124#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:03:40,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [89] 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] {124#true} is VALID [2022-04-07 17:03:40,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {124#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-07 17:03:40,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124#true} {124#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-07 17:03:40,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {124#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-07 17:03:40,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {124#true} [91] mainENTRY-->L30: Formula: (and (= v_main_~i0~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_5 0) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~n1~0_3 |v_main_#t~nondet2_2|) (= v_main_~n0~0_2 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_3, main_~i0~0=v_main_~i0~0_3, main_~n0~0=v_main_~n0~0_2, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~n1~0, main_#t~nondet1, main_~k~0, main_#t~nondet2, main_~i0~0, main_~n0~0] {129#(= main_~i0~0 0)} is VALID [2022-04-07 17:03:40,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {129#(= main_~i0~0 0)} [94] L30-->L31: Formula: (and (<= 0 (+ v_main_~n0~0_6 1000000)) (< v_main_~n0~0_6 1000000)) InVars {main_~n0~0=v_main_~n0~0_6} OutVars{main_~n0~0=v_main_~n0~0_6} AuxVars[] AssignedVars[] {129#(= main_~i0~0 0)} is VALID [2022-04-07 17:03:40,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {129#(= main_~i0~0 0)} [97] L31-->L32-2: Formula: (and (< v_main_~n1~0_7 1000000) (<= 0 (+ v_main_~n1~0_7 1000000))) InVars {main_~n1~0=v_main_~n1~0_7} OutVars{main_~n1~0=v_main_~n1~0_7} AuxVars[] AssignedVars[] {129#(= main_~i0~0 0)} is VALID [2022-04-07 17:03:40,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {129#(= main_~i0~0 0)} [99] L32-2-->L32-3: Formula: (not (< v_main_~i0~0_4 v_main_~n0~0_9)) InVars {main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} OutVars{main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} AuxVars[] AssignedVars[] {130#(<= main_~n0~0 0)} is VALID [2022-04-07 17:03:40,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {130#(<= main_~n0~0 0)} [101] L32-3-->L37-2: Formula: (= v_main_~i1~0_1 0) InVars {} OutVars{main_~i1~0=v_main_~i1~0_1} AuxVars[] AssignedVars[main_~i1~0] {131#(and (<= main_~n0~0 0) (= main_~i1~0 0))} is VALID [2022-04-07 17:03:40,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {131#(and (<= main_~n0~0 0) (= main_~i1~0 0))} [103] L37-2-->L37-3: Formula: (not (< v_main_~i1~0_2 v_main_~n1~0_1)) InVars {main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} OutVars{main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} AuxVars[] AssignedVars[] {132#(<= (+ main_~n1~0 main_~n0~0) 0)} is VALID [2022-04-07 17:03:40,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {132#(<= (+ main_~n1~0 main_~n0~0) 0)} [105] L37-3-->L42-2: Formula: (= v_main_~j1~0_1 0) InVars {} OutVars{main_~j1~0=v_main_~j1~0_1} AuxVars[] AssignedVars[main_~j1~0] {133#(and (= main_~j1~0 0) (<= (+ main_~n1~0 main_~n0~0) 0))} is VALID [2022-04-07 17:03:40,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {133#(and (= main_~j1~0 0) (<= (+ main_~n1~0 main_~n0~0) 0))} [108] L42-2-->L43: Formula: (< v_main_~j1~0_3 (+ v_main_~n0~0_8 v_main_~n1~0_9)) InVars {main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} OutVars{main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} AuxVars[] AssignedVars[] {125#false} is VALID [2022-04-07 17:03:40,825 INFO L272 TraceCheckUtils]: 13: Hoare triple {125#false} [109] L43-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {125#false} is VALID [2022-04-07 17:03:40,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {125#false} [111] __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] {125#false} is VALID [2022-04-07 17:03:40,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {125#false} [112] 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[] {125#false} is VALID [2022-04-07 17:03:40,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {125#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#false} is VALID [2022-04-07 17:03:40,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:40,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:40,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443572199] [2022-04-07 17:03:40,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443572199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:03:40,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:03:40,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-07 17:03:40,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357959032] [2022-04-07 17:03:40,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:03:40,829 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 17:03:40,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:40,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:40,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:40,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 17:03:40,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:40,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 17:03:40,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-07 17:03:40,853 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:41,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:41,207 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-07 17:03:41,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 17:03:41,207 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 17:03:41,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-07 17:03:41,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-07 17:03:41,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-04-07 17:03:41,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:41,265 INFO L225 Difference]: With dead ends: 31 [2022-04-07 17:03:41,265 INFO L226 Difference]: Without dead ends: 29 [2022-04-07 17:03:41,265 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-04-07 17:03:41,266 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 45 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:41,267 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 34 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:03:41,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-07 17:03:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-04-07 17:03:41,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:41,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:41,274 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:41,274 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:41,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:41,277 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-07 17:03:41,277 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-07 17:03:41,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:41,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:41,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 29 states. [2022-04-07 17:03:41,279 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 29 states. [2022-04-07 17:03:41,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:41,281 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-07 17:03:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-07 17:03:41,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:41,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:41,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:41,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:41,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-07 17:03:41,287 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-07 17:03:41,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:41,288 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-07 17:03:41,288 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:41,288 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-07 17:03:41,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 17:03:41,289 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:41,289 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:41,289 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 17:03:41,289 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:41,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:41,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1618517526, now seen corresponding path program 1 times [2022-04-07 17:03:41,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:41,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144765182] [2022-04-07 17:03:41,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:41,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:41,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:41,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [89] 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] {260#true} is VALID [2022-04-07 17:03:41,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#true} is VALID [2022-04-07 17:03:41,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {260#true} {260#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#true} is VALID [2022-04-07 17:03:41,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {260#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:03:41,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [89] 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] {260#true} is VALID [2022-04-07 17:03:41,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#true} is VALID [2022-04-07 17:03:41,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {260#true} {260#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#true} is VALID [2022-04-07 17:03:41,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {260#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#true} is VALID [2022-04-07 17:03:41,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#true} [91] mainENTRY-->L30: Formula: (and (= v_main_~i0~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_5 0) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~n1~0_3 |v_main_#t~nondet2_2|) (= v_main_~n0~0_2 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_3, main_~i0~0=v_main_~i0~0_3, main_~n0~0=v_main_~n0~0_2, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~n1~0, main_#t~nondet1, main_~k~0, main_#t~nondet2, main_~i0~0, main_~n0~0] {265#(and (= main_~i0~0 0) (= main_~k~0 0))} is VALID [2022-04-07 17:03:41,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {265#(and (= main_~i0~0 0) (= main_~k~0 0))} [94] L30-->L31: Formula: (and (<= 0 (+ v_main_~n0~0_6 1000000)) (< v_main_~n0~0_6 1000000)) InVars {main_~n0~0=v_main_~n0~0_6} OutVars{main_~n0~0=v_main_~n0~0_6} AuxVars[] AssignedVars[] {265#(and (= main_~i0~0 0) (= main_~k~0 0))} is VALID [2022-04-07 17:03:41,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {265#(and (= main_~i0~0 0) (= main_~k~0 0))} [97] L31-->L32-2: Formula: (and (< v_main_~n1~0_7 1000000) (<= 0 (+ v_main_~n1~0_7 1000000))) InVars {main_~n1~0=v_main_~n1~0_7} OutVars{main_~n1~0=v_main_~n1~0_7} AuxVars[] AssignedVars[] {265#(and (= main_~i0~0 0) (= main_~k~0 0))} is VALID [2022-04-07 17:03:41,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#(and (= main_~i0~0 0) (= main_~k~0 0))} [99] L32-2-->L32-3: Formula: (not (< v_main_~i0~0_4 v_main_~n0~0_9)) InVars {main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} OutVars{main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} AuxVars[] AssignedVars[] {266#(and (<= main_~n0~0 0) (= main_~k~0 0))} is VALID [2022-04-07 17:03:41,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {266#(and (<= main_~n0~0 0) (= main_~k~0 0))} [101] L32-3-->L37-2: Formula: (= v_main_~i1~0_1 0) InVars {} OutVars{main_~i1~0=v_main_~i1~0_1} AuxVars[] AssignedVars[main_~i1~0] {267#(and (<= main_~n0~0 0) (= main_~i1~0 0) (= main_~k~0 0))} is VALID [2022-04-07 17:03:41,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {267#(and (<= main_~n0~0 0) (= main_~i1~0 0) (= main_~k~0 0))} [104] L37-2-->L37-2: Formula: (or (and (= v_main_~k~0_4 v_main_~k~0_3) (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (= v_main_~i1~0_3 v_main_~i1~0_4) (not (< v_main_~i1~0_4 v_main_~n1~0_2))) (and (< v_main_~i1~0_4 v_main_~i1~0_3) (= (+ v_main_~i1~0_4 v_main_~k~0_3) (+ v_main_~i1~0_3 v_main_~k~0_4)) (< v_main_~i1~0_3 (+ v_main_~n1~0_2 1)))) InVars {main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_3|, main_~i1~0=v_main_~i1~0_4, main_~k~0=v_main_~k~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~i1~0=v_main_~i1~0_3, main_~k~0=v_main_~k~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~i1~0, main_~k~0, main_#t~post5, main_#t~post6] {268#(or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~i1~0 main_~n0~0) main_~k~0))} is VALID [2022-04-07 17:03:41,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {268#(or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~i1~0 main_~n0~0) main_~k~0))} [103] L37-2-->L37-3: Formula: (not (< v_main_~i1~0_2 v_main_~n1~0_1)) InVars {main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} OutVars{main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} AuxVars[] AssignedVars[] {269#(or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0))} is VALID [2022-04-07 17:03:41,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {269#(or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0))} [105] L37-3-->L42-2: Formula: (= v_main_~j1~0_1 0) InVars {} OutVars{main_~j1~0=v_main_~j1~0_1} AuxVars[] AssignedVars[main_~j1~0] {270#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} is VALID [2022-04-07 17:03:41,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {270#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} [108] L42-2-->L43: Formula: (< v_main_~j1~0_3 (+ v_main_~n0~0_8 v_main_~n1~0_9)) InVars {main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} OutVars{main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} AuxVars[] AssignedVars[] {271#(<= 1 main_~k~0)} is VALID [2022-04-07 17:03:41,532 INFO L272 TraceCheckUtils]: 14: Hoare triple {271#(<= 1 main_~k~0)} [109] L43-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {272#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:03:41,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {272#(not (= |__VERIFIER_assert_#in~cond| 0))} [111] __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] {273#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:03:41,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {273#(not (= __VERIFIER_assert_~cond 0))} [112] 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[] {261#false} is VALID [2022-04-07 17:03:41,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {261#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {261#false} is VALID [2022-04-07 17:03:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:41,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:41,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144765182] [2022-04-07 17:03:41,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144765182] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:03:41,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118466667] [2022-04-07 17:03:41,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:41,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:41,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:41,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:03:41,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 17:03:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:41,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 17:03:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:41,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:03:42,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {260#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#true} is VALID [2022-04-07 17:03:42,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#true} [89] 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] {260#true} is VALID [2022-04-07 17:03:42,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#true} is VALID [2022-04-07 17:03:42,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {260#true} {260#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#true} is VALID [2022-04-07 17:03:42,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {260#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#true} is VALID [2022-04-07 17:03:42,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#true} [91] mainENTRY-->L30: Formula: (and (= v_main_~i0~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_5 0) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~n1~0_3 |v_main_#t~nondet2_2|) (= v_main_~n0~0_2 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_3, main_~i0~0=v_main_~i0~0_3, main_~n0~0=v_main_~n0~0_2, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~n1~0, main_#t~nondet1, main_~k~0, main_#t~nondet2, main_~i0~0, main_~n0~0] {293#(and (<= 0 main_~k~0) (<= main_~i0~0 0))} is VALID [2022-04-07 17:03:42,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {293#(and (<= 0 main_~k~0) (<= main_~i0~0 0))} [94] L30-->L31: Formula: (and (<= 0 (+ v_main_~n0~0_6 1000000)) (< v_main_~n0~0_6 1000000)) InVars {main_~n0~0=v_main_~n0~0_6} OutVars{main_~n0~0=v_main_~n0~0_6} AuxVars[] AssignedVars[] {293#(and (<= 0 main_~k~0) (<= main_~i0~0 0))} is VALID [2022-04-07 17:03:42,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {293#(and (<= 0 main_~k~0) (<= main_~i0~0 0))} [97] L31-->L32-2: Formula: (and (< v_main_~n1~0_7 1000000) (<= 0 (+ v_main_~n1~0_7 1000000))) InVars {main_~n1~0=v_main_~n1~0_7} OutVars{main_~n1~0=v_main_~n1~0_7} AuxVars[] AssignedVars[] {293#(and (<= 0 main_~k~0) (<= main_~i0~0 0))} is VALID [2022-04-07 17:03:42,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {293#(and (<= 0 main_~k~0) (<= main_~i0~0 0))} [99] L32-2-->L32-3: Formula: (not (< v_main_~i0~0_4 v_main_~n0~0_9)) InVars {main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} OutVars{main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} AuxVars[] AssignedVars[] {303#(and (<= main_~n0~0 0) (<= 0 main_~k~0))} is VALID [2022-04-07 17:03:42,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {303#(and (<= main_~n0~0 0) (<= 0 main_~k~0))} [101] L32-3-->L37-2: Formula: (= v_main_~i1~0_1 0) InVars {} OutVars{main_~i1~0=v_main_~i1~0_1} AuxVars[] AssignedVars[main_~i1~0] {307#(and (<= main_~n0~0 0) (<= 0 main_~k~0) (<= main_~i1~0 0))} is VALID [2022-04-07 17:03:42,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {307#(and (<= main_~n0~0 0) (<= 0 main_~k~0) (<= main_~i1~0 0))} [104] L37-2-->L37-2: Formula: (or (and (= v_main_~k~0_4 v_main_~k~0_3) (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (= v_main_~i1~0_3 v_main_~i1~0_4) (not (< v_main_~i1~0_4 v_main_~n1~0_2))) (and (< v_main_~i1~0_4 v_main_~i1~0_3) (= (+ v_main_~i1~0_4 v_main_~k~0_3) (+ v_main_~i1~0_3 v_main_~k~0_4)) (< v_main_~i1~0_3 (+ v_main_~n1~0_2 1)))) InVars {main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_3|, main_~i1~0=v_main_~i1~0_4, main_~k~0=v_main_~k~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~i1~0=v_main_~i1~0_3, main_~k~0=v_main_~k~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~i1~0, main_~k~0, main_#t~post5, main_#t~post6] {311#(and (<= main_~n0~0 0) (or (and (<= 0 main_~k~0) (<= main_~i1~0 0) (<= main_~n1~0 main_~i1~0)) (and (<= main_~i1~0 main_~k~0) (< main_~i1~0 (+ main_~n1~0 1)) (< 0 main_~k~0))))} is VALID [2022-04-07 17:03:42,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {311#(and (<= main_~n0~0 0) (or (and (<= 0 main_~k~0) (<= main_~i1~0 0) (<= main_~n1~0 main_~i1~0)) (and (<= main_~i1~0 main_~k~0) (< main_~i1~0 (+ main_~n1~0 1)) (< 0 main_~k~0))))} [103] L37-2-->L37-3: Formula: (not (< v_main_~i1~0_2 v_main_~n1~0_1)) InVars {main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} OutVars{main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} AuxVars[] AssignedVars[] {315#(and (or (and (<= main_~n1~0 0) (<= 0 main_~k~0)) (and (<= main_~n1~0 main_~k~0) (< 0 main_~k~0))) (<= main_~n0~0 0))} is VALID [2022-04-07 17:03:42,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#(and (or (and (<= main_~n1~0 0) (<= 0 main_~k~0)) (and (<= main_~n1~0 main_~k~0) (< 0 main_~k~0))) (<= main_~n0~0 0))} [105] L37-3-->L42-2: Formula: (= v_main_~j1~0_1 0) InVars {} OutVars{main_~j1~0=v_main_~j1~0_1} AuxVars[] AssignedVars[main_~j1~0] {319#(and (or (and (<= main_~n1~0 0) (<= 0 main_~k~0)) (and (<= main_~n1~0 main_~k~0) (< 0 main_~k~0))) (<= main_~n0~0 0) (<= 0 main_~j1~0))} is VALID [2022-04-07 17:03:42,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {319#(and (or (and (<= main_~n1~0 0) (<= 0 main_~k~0)) (and (<= main_~n1~0 main_~k~0) (< 0 main_~k~0))) (<= main_~n0~0 0) (<= 0 main_~j1~0))} [108] L42-2-->L43: Formula: (< v_main_~j1~0_3 (+ v_main_~n0~0_8 v_main_~n1~0_9)) InVars {main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} OutVars{main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} AuxVars[] AssignedVars[] {271#(<= 1 main_~k~0)} is VALID [2022-04-07 17:03:42,450 INFO L272 TraceCheckUtils]: 14: Hoare triple {271#(<= 1 main_~k~0)} [109] L43-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {326#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:03:42,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {326#(<= 1 |__VERIFIER_assert_#in~cond|)} [111] __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] {330#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:03:42,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {330#(<= 1 __VERIFIER_assert_~cond)} [112] 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[] {261#false} is VALID [2022-04-07 17:03:42,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {261#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {261#false} is VALID [2022-04-07 17:03:42,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:42,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:03:43,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {261#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {261#false} is VALID [2022-04-07 17:03:43,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {330#(<= 1 __VERIFIER_assert_~cond)} [112] 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[] {261#false} is VALID [2022-04-07 17:03:43,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {326#(<= 1 |__VERIFIER_assert_#in~cond|)} [111] __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] {330#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:03:43,234 INFO L272 TraceCheckUtils]: 14: Hoare triple {271#(<= 1 main_~k~0)} [109] L43-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {326#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:03:43,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {349#(or (not (< main_~j1~0 (+ main_~n1~0 main_~n0~0))) (<= 1 main_~k~0))} [108] L42-2-->L43: Formula: (< v_main_~j1~0_3 (+ v_main_~n0~0_8 v_main_~n1~0_9)) InVars {main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} OutVars{main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} AuxVars[] AssignedVars[] {271#(<= 1 main_~k~0)} is VALID [2022-04-07 17:03:43,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {353#(or (<= 1 main_~k~0) (<= (+ main_~n1~0 main_~n0~0) 0))} [105] L37-3-->L42-2: Formula: (= v_main_~j1~0_1 0) InVars {} OutVars{main_~j1~0=v_main_~j1~0_1} AuxVars[] AssignedVars[main_~j1~0] {349#(or (not (< main_~j1~0 (+ main_~n1~0 main_~n0~0))) (<= 1 main_~k~0))} is VALID [2022-04-07 17:03:43,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {357#(or (<= 1 main_~k~0) (<= (+ main_~n1~0 main_~n0~0) 0) (< main_~i1~0 main_~n1~0))} [103] L37-2-->L37-3: Formula: (not (< v_main_~i1~0_2 v_main_~n1~0_1)) InVars {main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} OutVars{main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} AuxVars[] AssignedVars[] {353#(or (<= 1 main_~k~0) (<= (+ main_~n1~0 main_~n0~0) 0))} is VALID [2022-04-07 17:03:43,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {361#(and (or (<= 1 main_~k~0) (<= (+ main_~i1~0 main_~n0~0) 0)) (or (<= 0 main_~k~0) (<= (+ main_~i1~0 main_~n0~0) main_~k~0)))} [104] L37-2-->L37-2: Formula: (or (and (= v_main_~k~0_4 v_main_~k~0_3) (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (= v_main_~i1~0_3 v_main_~i1~0_4) (not (< v_main_~i1~0_4 v_main_~n1~0_2))) (and (< v_main_~i1~0_4 v_main_~i1~0_3) (= (+ v_main_~i1~0_4 v_main_~k~0_3) (+ v_main_~i1~0_3 v_main_~k~0_4)) (< v_main_~i1~0_3 (+ v_main_~n1~0_2 1)))) InVars {main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_3|, main_~i1~0=v_main_~i1~0_4, main_~k~0=v_main_~k~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~i1~0=v_main_~i1~0_3, main_~k~0=v_main_~k~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~i1~0, main_~k~0, main_#t~post5, main_#t~post6] {357#(or (<= 1 main_~k~0) (<= (+ main_~n1~0 main_~n0~0) 0) (< main_~i1~0 main_~n1~0))} is VALID [2022-04-07 17:03:43,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {365#(and (or (<= 0 main_~k~0) (<= main_~n0~0 main_~k~0)) (or (<= main_~n0~0 0) (<= 1 main_~k~0)))} [101] L32-3-->L37-2: Formula: (= v_main_~i1~0_1 0) InVars {} OutVars{main_~i1~0=v_main_~i1~0_1} AuxVars[] AssignedVars[main_~i1~0] {361#(and (or (<= 1 main_~k~0) (<= (+ main_~i1~0 main_~n0~0) 0)) (or (<= 0 main_~k~0) (<= (+ main_~i1~0 main_~n0~0) main_~k~0)))} is VALID [2022-04-07 17:03:43,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {369#(and (or (<= 0 main_~k~0) (<= main_~i0~0 main_~k~0)) (or (<= 1 main_~k~0) (<= main_~i0~0 0)))} [99] L32-2-->L32-3: Formula: (not (< v_main_~i0~0_4 v_main_~n0~0_9)) InVars {main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} OutVars{main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} AuxVars[] AssignedVars[] {365#(and (or (<= 0 main_~k~0) (<= main_~n0~0 main_~k~0)) (or (<= main_~n0~0 0) (<= 1 main_~k~0)))} is VALID [2022-04-07 17:03:43,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {369#(and (or (<= 0 main_~k~0) (<= main_~i0~0 main_~k~0)) (or (<= 1 main_~k~0) (<= main_~i0~0 0)))} [97] L31-->L32-2: Formula: (and (< v_main_~n1~0_7 1000000) (<= 0 (+ v_main_~n1~0_7 1000000))) InVars {main_~n1~0=v_main_~n1~0_7} OutVars{main_~n1~0=v_main_~n1~0_7} AuxVars[] AssignedVars[] {369#(and (or (<= 0 main_~k~0) (<= main_~i0~0 main_~k~0)) (or (<= 1 main_~k~0) (<= main_~i0~0 0)))} is VALID [2022-04-07 17:03:43,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {369#(and (or (<= 0 main_~k~0) (<= main_~i0~0 main_~k~0)) (or (<= 1 main_~k~0) (<= main_~i0~0 0)))} [94] L30-->L31: Formula: (and (<= 0 (+ v_main_~n0~0_6 1000000)) (< v_main_~n0~0_6 1000000)) InVars {main_~n0~0=v_main_~n0~0_6} OutVars{main_~n0~0=v_main_~n0~0_6} AuxVars[] AssignedVars[] {369#(and (or (<= 0 main_~k~0) (<= main_~i0~0 main_~k~0)) (or (<= 1 main_~k~0) (<= main_~i0~0 0)))} is VALID [2022-04-07 17:03:43,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#true} [91] mainENTRY-->L30: Formula: (and (= v_main_~i0~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_5 0) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~n1~0_3 |v_main_#t~nondet2_2|) (= v_main_~n0~0_2 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_3, main_~i0~0=v_main_~i0~0_3, main_~n0~0=v_main_~n0~0_2, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~n1~0, main_#t~nondet1, main_~k~0, main_#t~nondet2, main_~i0~0, main_~n0~0] {369#(and (or (<= 0 main_~k~0) (<= main_~i0~0 main_~k~0)) (or (<= 1 main_~k~0) (<= main_~i0~0 0)))} is VALID [2022-04-07 17:03:43,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {260#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#true} is VALID [2022-04-07 17:03:43,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {260#true} {260#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#true} is VALID [2022-04-07 17:03:43,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#true} is VALID [2022-04-07 17:03:43,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#true} [89] 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] {260#true} is VALID [2022-04-07 17:03:43,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {260#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#true} is VALID [2022-04-07 17:03:43,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:43,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118466667] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:03:43,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:03:43,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2022-04-07 17:03:43,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555259585] [2022-04-07 17:03:43,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:03:43,245 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.4) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-07 17:03:43,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:43,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 1.4) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:43,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:43,277 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-07 17:03:43,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:43,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-07 17:03:43,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2022-04-07 17:03:43,279 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:44,984 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-07 17:03:44,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-07 17:03:44,985 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.4) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-07 17:03:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:44,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 50 transitions. [2022-04-07 17:03:44,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 50 transitions. [2022-04-07 17:03:44,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 50 transitions. [2022-04-07 17:03:45,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:45,059 INFO L225 Difference]: With dead ends: 42 [2022-04-07 17:03:45,059 INFO L226 Difference]: Without dead ends: 42 [2022-04-07 17:03:45,061 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=332, Invalid=1560, Unknown=0, NotChecked=0, Total=1892 [2022-04-07 17:03:45,064 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 76 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:45,065 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 81 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-07 17:03:45,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-07 17:03:45,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2022-04-07 17:03:45,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:45,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 35 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:45,074 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 35 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:45,074 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 35 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:45,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:45,077 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-07 17:03:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-07 17:03:45,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:45,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:45,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 42 states. [2022-04-07 17:03:45,079 INFO L87 Difference]: Start difference. First operand has 35 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 42 states. [2022-04-07 17:03:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:45,081 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-07 17:03:45,082 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-07 17:03:45,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:45,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:45,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:45,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:45,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-04-07 17:03:45,085 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 18 [2022-04-07 17:03:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:45,085 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-04-07 17:03:45,085 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.4) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-07 17:03:45,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 17:03:45,086 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:45,086 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:45,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 17:03:45,310 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:45,310 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:45,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:45,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1387858898, now seen corresponding path program 1 times [2022-04-07 17:03:45,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:45,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54524082] [2022-04-07 17:03:45,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:45,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:45,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:45,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {612#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [89] 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] {593#true} is VALID [2022-04-07 17:03:45,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 17:03:45,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {593#true} {593#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 17:03:45,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-07 17:03:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:45,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {593#true} [111] __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] {593#true} is VALID [2022-04-07 17:03:45,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#true} [113] 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[] {593#true} is VALID [2022-04-07 17:03:45,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 17:03:45,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {603#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} [119] __VERIFIER_assertEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {603#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} is VALID [2022-04-07 17:03:45,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {612#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:03:45,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {612#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [89] 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] {593#true} is VALID [2022-04-07 17:03:45,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 17:03:45,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 17:03:45,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 17:03:45,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {593#true} [91] mainENTRY-->L30: Formula: (and (= v_main_~i0~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_5 0) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~n1~0_3 |v_main_#t~nondet2_2|) (= v_main_~n0~0_2 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_3, main_~i0~0=v_main_~i0~0_3, main_~n0~0=v_main_~n0~0_2, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~n1~0, main_#t~nondet1, main_~k~0, main_#t~nondet2, main_~i0~0, main_~n0~0] {598#(and (= main_~i0~0 0) (= main_~k~0 0))} is VALID [2022-04-07 17:03:45,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {598#(and (= main_~i0~0 0) (= main_~k~0 0))} [94] L30-->L31: Formula: (and (<= 0 (+ v_main_~n0~0_6 1000000)) (< v_main_~n0~0_6 1000000)) InVars {main_~n0~0=v_main_~n0~0_6} OutVars{main_~n0~0=v_main_~n0~0_6} AuxVars[] AssignedVars[] {598#(and (= main_~i0~0 0) (= main_~k~0 0))} is VALID [2022-04-07 17:03:45,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {598#(and (= main_~i0~0 0) (= main_~k~0 0))} [97] L31-->L32-2: Formula: (and (< v_main_~n1~0_7 1000000) (<= 0 (+ v_main_~n1~0_7 1000000))) InVars {main_~n1~0=v_main_~n1~0_7} OutVars{main_~n1~0=v_main_~n1~0_7} AuxVars[] AssignedVars[] {598#(and (= main_~i0~0 0) (= main_~k~0 0))} is VALID [2022-04-07 17:03:45,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {598#(and (= main_~i0~0 0) (= main_~k~0 0))} [100] L32-2-->L32-2: Formula: (or (and (< v_main_~i0~0_1 (+ v_main_~n0~0_1 1)) (< v_main_~i0~0_2 v_main_~i0~0_1) (= (+ v_main_~i0~0_2 v_main_~k~0_1) (+ v_main_~i0~0_1 v_main_~k~0_2))) (and (= v_main_~k~0_2 v_main_~k~0_1) (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (<= v_main_~n0~0_1 v_main_~i0~0_2) (= v_main_~i0~0_2 v_main_~i0~0_1) (= |v_main_#t~post4_3| |v_main_#t~post4_1|))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~i0~0=v_main_~i0~0_2, main_#t~post3=|v_main_#t~post3_3|, main_~n0~0=v_main_~n0~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i0~0=v_main_~i0~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~n0~0=v_main_~n0~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_#t~post4, main_~i0~0, main_#t~post3] {599#(or (<= main_~i0~0 main_~k~0) (<= main_~i0~0 0))} is VALID [2022-04-07 17:03:45,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {599#(or (<= main_~i0~0 main_~k~0) (<= main_~i0~0 0))} [99] L32-2-->L32-3: Formula: (not (< v_main_~i0~0_4 v_main_~n0~0_9)) InVars {main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} OutVars{main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} AuxVars[] AssignedVars[] {600#(or (<= main_~n0~0 0) (<= main_~n0~0 main_~k~0))} is VALID [2022-04-07 17:03:45,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {600#(or (<= main_~n0~0 0) (<= main_~n0~0 main_~k~0))} [101] L32-3-->L37-2: Formula: (= v_main_~i1~0_1 0) InVars {} OutVars{main_~i1~0=v_main_~i1~0_1} AuxVars[] AssignedVars[main_~i1~0] {601#(and (= main_~i1~0 0) (or (<= main_~n0~0 0) (<= main_~n0~0 main_~k~0)))} is VALID [2022-04-07 17:03:45,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {601#(and (= main_~i1~0 0) (or (<= main_~n0~0 0) (<= main_~n0~0 main_~k~0)))} [103] L37-2-->L37-3: Formula: (not (< v_main_~i1~0_2 v_main_~n1~0_1)) InVars {main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} OutVars{main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} AuxVars[] AssignedVars[] {602#(or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0))} is VALID [2022-04-07 17:03:45,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {602#(or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0))} [105] L37-3-->L42-2: Formula: (= v_main_~j1~0_1 0) InVars {} OutVars{main_~j1~0=v_main_~j1~0_1} AuxVars[] AssignedVars[main_~j1~0] {603#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} is VALID [2022-04-07 17:03:45,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {603#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} [108] L42-2-->L43: Formula: (< v_main_~j1~0_3 (+ v_main_~n0~0_8 v_main_~n1~0_9)) InVars {main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} OutVars{main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} AuxVars[] AssignedVars[] {603#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} is VALID [2022-04-07 17:03:45,557 INFO L272 TraceCheckUtils]: 14: Hoare triple {603#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} [109] L43-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {593#true} is VALID [2022-04-07 17:03:45,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {593#true} [111] __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] {593#true} is VALID [2022-04-07 17:03:45,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {593#true} [113] 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[] {593#true} is VALID [2022-04-07 17:03:45,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {593#true} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 17:03:45,561 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {593#true} {603#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} [119] __VERIFIER_assertEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {603#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} is VALID [2022-04-07 17:03:45,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {603#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} [110] L43-1-->L42-2: Formula: (and (= v_main_~j1~0_4 (+ v_main_~j1~0_5 1)) (= v_main_~k~0_8 (+ v_main_~k~0_7 1))) InVars {main_~j1~0=v_main_~j1~0_5, main_~k~0=v_main_~k~0_8} OutVars{main_~j1~0=v_main_~j1~0_4, main_#t~post8=|v_main_#t~post8_1|, main_~k~0=v_main_~k~0_7, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~k~0, main_~j1~0, main_#t~post8, main_#t~post7] {608#(or (<= (+ main_~n1~0 main_~n0~0) (+ main_~k~0 main_~j1~0)) (<= (+ main_~n1~0 main_~n0~0 1) main_~j1~0))} is VALID [2022-04-07 17:03:45,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {608#(or (<= (+ main_~n1~0 main_~n0~0) (+ main_~k~0 main_~j1~0)) (<= (+ main_~n1~0 main_~n0~0 1) main_~j1~0))} [108] L42-2-->L43: Formula: (< v_main_~j1~0_3 (+ v_main_~n0~0_8 v_main_~n1~0_9)) InVars {main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} OutVars{main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} AuxVars[] AssignedVars[] {609#(<= 1 main_~k~0)} is VALID [2022-04-07 17:03:45,565 INFO L272 TraceCheckUtils]: 21: Hoare triple {609#(<= 1 main_~k~0)} [109] L43-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {610#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:03:45,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {610#(not (= |__VERIFIER_assert_#in~cond| 0))} [111] __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] {611#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:03:45,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {611#(not (= __VERIFIER_assert_~cond 0))} [112] 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[] {594#false} is VALID [2022-04-07 17:03:45,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {594#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {594#false} is VALID [2022-04-07 17:03:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:45,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:45,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54524082] [2022-04-07 17:03:45,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54524082] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:03:45,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161387528] [2022-04-07 17:03:45,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:45,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:45,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:45,569 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:03:45,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 17:03:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:45,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 17:03:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:45,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:03:46,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 17:03:46,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#true} [89] 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] {593#true} is VALID [2022-04-07 17:03:46,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 17:03:46,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 17:03:46,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 17:03:46,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {593#true} [91] mainENTRY-->L30: Formula: (and (= v_main_~i0~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_5 0) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~n1~0_3 |v_main_#t~nondet2_2|) (= v_main_~n0~0_2 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_3, main_~i0~0=v_main_~i0~0_3, main_~n0~0=v_main_~n0~0_2, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~n1~0, main_#t~nondet1, main_~k~0, main_#t~nondet2, main_~i0~0, main_~n0~0] {631#(and (<= 0 main_~k~0) (<= main_~i0~0 0))} is VALID [2022-04-07 17:03:46,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {631#(and (<= 0 main_~k~0) (<= main_~i0~0 0))} [94] L30-->L31: Formula: (and (<= 0 (+ v_main_~n0~0_6 1000000)) (< v_main_~n0~0_6 1000000)) InVars {main_~n0~0=v_main_~n0~0_6} OutVars{main_~n0~0=v_main_~n0~0_6} AuxVars[] AssignedVars[] {631#(and (<= 0 main_~k~0) (<= main_~i0~0 0))} is VALID [2022-04-07 17:03:46,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {631#(and (<= 0 main_~k~0) (<= main_~i0~0 0))} [97] L31-->L32-2: Formula: (and (< v_main_~n1~0_7 1000000) (<= 0 (+ v_main_~n1~0_7 1000000))) InVars {main_~n1~0=v_main_~n1~0_7} OutVars{main_~n1~0=v_main_~n1~0_7} AuxVars[] AssignedVars[] {631#(and (<= 0 main_~k~0) (<= main_~i0~0 0))} is VALID [2022-04-07 17:03:46,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {631#(and (<= 0 main_~k~0) (<= main_~i0~0 0))} [100] L32-2-->L32-2: Formula: (or (and (< v_main_~i0~0_1 (+ v_main_~n0~0_1 1)) (< v_main_~i0~0_2 v_main_~i0~0_1) (= (+ v_main_~i0~0_2 v_main_~k~0_1) (+ v_main_~i0~0_1 v_main_~k~0_2))) (and (= v_main_~k~0_2 v_main_~k~0_1) (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (<= v_main_~n0~0_1 v_main_~i0~0_2) (= v_main_~i0~0_2 v_main_~i0~0_1) (= |v_main_#t~post4_3| |v_main_#t~post4_1|))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~i0~0=v_main_~i0~0_2, main_#t~post3=|v_main_#t~post3_3|, main_~n0~0=v_main_~n0~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i0~0=v_main_~i0~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~n0~0=v_main_~n0~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_#t~post4, main_~i0~0, main_#t~post3] {641#(or (and (< main_~i0~0 (+ main_~n0~0 1)) (<= main_~i0~0 main_~k~0) (< 0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~i0~0 0) (<= main_~n0~0 main_~i0~0)))} is VALID [2022-04-07 17:03:46,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {641#(or (and (< main_~i0~0 (+ main_~n0~0 1)) (<= main_~i0~0 main_~k~0) (< 0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~i0~0 0) (<= main_~n0~0 main_~i0~0)))} [99] L32-2-->L32-3: Formula: (not (< v_main_~i0~0_4 v_main_~n0~0_9)) InVars {main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} OutVars{main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} AuxVars[] AssignedVars[] {645#(or (and (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (<= main_~n0~0 0) (<= 0 main_~k~0)))} is VALID [2022-04-07 17:03:46,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {645#(or (and (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (<= main_~n0~0 0) (<= 0 main_~k~0)))} [101] L32-3-->L37-2: Formula: (= v_main_~i1~0_1 0) InVars {} OutVars{main_~i1~0=v_main_~i1~0_1} AuxVars[] AssignedVars[main_~i1~0] {649#(and (<= main_~i1~0 0) (or (and (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (<= main_~n0~0 0) (<= 0 main_~k~0))))} is VALID [2022-04-07 17:03:46,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {649#(and (<= main_~i1~0 0) (or (and (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (<= main_~n0~0 0) (<= 0 main_~k~0))))} [103] L37-2-->L37-3: Formula: (not (< v_main_~i1~0_2 v_main_~n1~0_1)) InVars {main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} OutVars{main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} AuxVars[] AssignedVars[] {653#(and (<= main_~n1~0 0) (or (and (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (<= main_~n0~0 0) (<= 0 main_~k~0))))} is VALID [2022-04-07 17:03:46,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {653#(and (<= main_~n1~0 0) (or (and (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (<= main_~n0~0 0) (<= 0 main_~k~0))))} [105] L37-3-->L42-2: Formula: (= v_main_~j1~0_1 0) InVars {} OutVars{main_~j1~0=v_main_~j1~0_1} AuxVars[] AssignedVars[main_~j1~0] {657#(and (<= main_~n1~0 0) (or (and (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (<= main_~n0~0 0) (<= 0 main_~k~0))) (<= 0 main_~j1~0))} is VALID [2022-04-07 17:03:46,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {657#(and (<= main_~n1~0 0) (or (and (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (<= main_~n0~0 0) (<= 0 main_~k~0))) (<= 0 main_~j1~0))} [108] L42-2-->L43: Formula: (< v_main_~j1~0_3 (+ v_main_~n0~0_8 v_main_~n1~0_9)) InVars {main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} OutVars{main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} AuxVars[] AssignedVars[] {657#(and (<= main_~n1~0 0) (or (and (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (<= main_~n0~0 0) (<= 0 main_~k~0))) (<= 0 main_~j1~0))} is VALID [2022-04-07 17:03:46,560 INFO L272 TraceCheckUtils]: 14: Hoare triple {657#(and (<= main_~n1~0 0) (or (and (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (<= main_~n0~0 0) (<= 0 main_~k~0))) (<= 0 main_~j1~0))} [109] L43-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {593#true} is VALID [2022-04-07 17:03:46,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {593#true} [111] __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] {593#true} is VALID [2022-04-07 17:03:46,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {593#true} [113] 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[] {593#true} is VALID [2022-04-07 17:03:46,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {593#true} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 17:03:46,561 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {593#true} {657#(and (<= main_~n1~0 0) (or (and (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (<= main_~n0~0 0) (<= 0 main_~k~0))) (<= 0 main_~j1~0))} [119] __VERIFIER_assertEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {657#(and (<= main_~n1~0 0) (or (and (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (<= main_~n0~0 0) (<= 0 main_~k~0))) (<= 0 main_~j1~0))} is VALID [2022-04-07 17:03:46,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {657#(and (<= main_~n1~0 0) (or (and (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (<= main_~n0~0 0) (<= 0 main_~k~0))) (<= 0 main_~j1~0))} [110] L43-1-->L42-2: Formula: (and (= v_main_~j1~0_4 (+ v_main_~j1~0_5 1)) (= v_main_~k~0_8 (+ v_main_~k~0_7 1))) InVars {main_~j1~0=v_main_~j1~0_5, main_~k~0=v_main_~k~0_8} OutVars{main_~j1~0=v_main_~j1~0_4, main_#t~post8=|v_main_#t~post8_1|, main_~k~0=v_main_~k~0_7, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~k~0, main_~j1~0, main_#t~post8, main_#t~post7] {679#(and (<= main_~n1~0 0) (or (and (<= 0 (+ main_~k~0 1)) (<= main_~n0~0 0)) (and (< 0 (+ main_~k~0 1)) (<= main_~n0~0 (+ main_~k~0 1)))) (<= 1 main_~j1~0))} is VALID [2022-04-07 17:03:46,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {679#(and (<= main_~n1~0 0) (or (and (<= 0 (+ main_~k~0 1)) (<= main_~n0~0 0)) (and (< 0 (+ main_~k~0 1)) (<= main_~n0~0 (+ main_~k~0 1)))) (<= 1 main_~j1~0))} [108] L42-2-->L43: Formula: (< v_main_~j1~0_3 (+ v_main_~n0~0_8 v_main_~n1~0_9)) InVars {main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} OutVars{main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} AuxVars[] AssignedVars[] {609#(<= 1 main_~k~0)} is VALID [2022-04-07 17:03:46,563 INFO L272 TraceCheckUtils]: 21: Hoare triple {609#(<= 1 main_~k~0)} [109] L43-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {686#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:03:46,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {686#(<= 1 |__VERIFIER_assert_#in~cond|)} [111] __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] {690#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:03:46,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {690#(<= 1 __VERIFIER_assert_~cond)} [112] 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[] {594#false} is VALID [2022-04-07 17:03:46,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {594#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {594#false} is VALID [2022-04-07 17:03:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:46,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:03:47,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {594#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {594#false} is VALID [2022-04-07 17:03:47,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {690#(<= 1 __VERIFIER_assert_~cond)} [112] 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[] {594#false} is VALID [2022-04-07 17:03:47,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {686#(<= 1 |__VERIFIER_assert_#in~cond|)} [111] __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] {690#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:03:47,300 INFO L272 TraceCheckUtils]: 21: Hoare triple {609#(<= 1 main_~k~0)} [109] L43-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {686#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:03:47,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {709#(or (not (< main_~j1~0 (+ main_~n1~0 main_~n0~0))) (<= 1 main_~k~0))} [108] L42-2-->L43: Formula: (< v_main_~j1~0_3 (+ v_main_~n0~0_8 v_main_~n1~0_9)) InVars {main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} OutVars{main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} AuxVars[] AssignedVars[] {609#(<= 1 main_~k~0)} is VALID [2022-04-07 17:03:47,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {713#(or (<= (+ main_~n1~0 main_~n0~0) (+ main_~j1~0 1)) (<= 2 main_~k~0))} [110] L43-1-->L42-2: Formula: (and (= v_main_~j1~0_4 (+ v_main_~j1~0_5 1)) (= v_main_~k~0_8 (+ v_main_~k~0_7 1))) InVars {main_~j1~0=v_main_~j1~0_5, main_~k~0=v_main_~k~0_8} OutVars{main_~j1~0=v_main_~j1~0_4, main_#t~post8=|v_main_#t~post8_1|, main_~k~0=v_main_~k~0_7, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~k~0, main_~j1~0, main_#t~post8, main_#t~post7] {709#(or (not (< main_~j1~0 (+ main_~n1~0 main_~n0~0))) (<= 1 main_~k~0))} is VALID [2022-04-07 17:03:47,301 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {593#true} {713#(or (<= (+ main_~n1~0 main_~n0~0) (+ main_~j1~0 1)) (<= 2 main_~k~0))} [119] __VERIFIER_assertEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {713#(or (<= (+ main_~n1~0 main_~n0~0) (+ main_~j1~0 1)) (<= 2 main_~k~0))} is VALID [2022-04-07 17:03:47,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {593#true} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 17:03:47,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {593#true} [113] 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[] {593#true} is VALID [2022-04-07 17:03:47,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {593#true} [111] __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] {593#true} is VALID [2022-04-07 17:03:47,302 INFO L272 TraceCheckUtils]: 14: Hoare triple {713#(or (<= (+ main_~n1~0 main_~n0~0) (+ main_~j1~0 1)) (<= 2 main_~k~0))} [109] L43-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {593#true} is VALID [2022-04-07 17:03:47,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {713#(or (<= (+ main_~n1~0 main_~n0~0) (+ main_~j1~0 1)) (<= 2 main_~k~0))} [108] L42-2-->L43: Formula: (< v_main_~j1~0_3 (+ v_main_~n0~0_8 v_main_~n1~0_9)) InVars {main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} OutVars{main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} AuxVars[] AssignedVars[] {713#(or (<= (+ main_~n1~0 main_~n0~0) (+ main_~j1~0 1)) (<= 2 main_~k~0))} is VALID [2022-04-07 17:03:47,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {735#(or (<= 2 main_~k~0) (<= (+ main_~n1~0 main_~n0~0) 1))} [105] L37-3-->L42-2: Formula: (= v_main_~j1~0_1 0) InVars {} OutVars{main_~j1~0=v_main_~j1~0_1} AuxVars[] AssignedVars[main_~j1~0] {713#(or (<= (+ main_~n1~0 main_~n0~0) (+ main_~j1~0 1)) (<= 2 main_~k~0))} is VALID [2022-04-07 17:03:47,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {739#(or (<= (+ main_~i1~0 main_~n0~0) 1) (<= 2 main_~k~0))} [103] L37-2-->L37-3: Formula: (not (< v_main_~i1~0_2 v_main_~n1~0_1)) InVars {main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} OutVars{main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} AuxVars[] AssignedVars[] {735#(or (<= 2 main_~k~0) (<= (+ main_~n1~0 main_~n0~0) 1))} is VALID [2022-04-07 17:03:47,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {743#(or (<= main_~n0~0 1) (<= 2 main_~k~0))} [101] L32-3-->L37-2: Formula: (= v_main_~i1~0_1 0) InVars {} OutVars{main_~i1~0=v_main_~i1~0_1} AuxVars[] AssignedVars[main_~i1~0] {739#(or (<= (+ main_~i1~0 main_~n0~0) 1) (<= 2 main_~k~0))} is VALID [2022-04-07 17:03:47,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {747#(or (<= main_~n0~0 1) (< main_~i0~0 main_~n0~0) (<= 2 main_~k~0))} [99] L32-2-->L32-3: Formula: (not (< v_main_~i0~0_4 v_main_~n0~0_9)) InVars {main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} OutVars{main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} AuxVars[] AssignedVars[] {743#(or (<= main_~n0~0 1) (<= 2 main_~k~0))} is VALID [2022-04-07 17:03:47,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {751#(and (or (<= 1 main_~k~0) (<= main_~i0~0 main_~k~0)) (or (<= main_~i0~0 1) (<= 2 main_~k~0)))} [100] L32-2-->L32-2: Formula: (or (and (< v_main_~i0~0_1 (+ v_main_~n0~0_1 1)) (< v_main_~i0~0_2 v_main_~i0~0_1) (= (+ v_main_~i0~0_2 v_main_~k~0_1) (+ v_main_~i0~0_1 v_main_~k~0_2))) (and (= v_main_~k~0_2 v_main_~k~0_1) (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (<= v_main_~n0~0_1 v_main_~i0~0_2) (= v_main_~i0~0_2 v_main_~i0~0_1) (= |v_main_#t~post4_3| |v_main_#t~post4_1|))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~i0~0=v_main_~i0~0_2, main_#t~post3=|v_main_#t~post3_3|, main_~n0~0=v_main_~n0~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i0~0=v_main_~i0~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~n0~0=v_main_~n0~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_#t~post4, main_~i0~0, main_#t~post3] {747#(or (<= main_~n0~0 1) (< main_~i0~0 main_~n0~0) (<= 2 main_~k~0))} is VALID [2022-04-07 17:03:47,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {751#(and (or (<= 1 main_~k~0) (<= main_~i0~0 main_~k~0)) (or (<= main_~i0~0 1) (<= 2 main_~k~0)))} [97] L31-->L32-2: Formula: (and (< v_main_~n1~0_7 1000000) (<= 0 (+ v_main_~n1~0_7 1000000))) InVars {main_~n1~0=v_main_~n1~0_7} OutVars{main_~n1~0=v_main_~n1~0_7} AuxVars[] AssignedVars[] {751#(and (or (<= 1 main_~k~0) (<= main_~i0~0 main_~k~0)) (or (<= main_~i0~0 1) (<= 2 main_~k~0)))} is VALID [2022-04-07 17:03:47,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {751#(and (or (<= 1 main_~k~0) (<= main_~i0~0 main_~k~0)) (or (<= main_~i0~0 1) (<= 2 main_~k~0)))} [94] L30-->L31: Formula: (and (<= 0 (+ v_main_~n0~0_6 1000000)) (< v_main_~n0~0_6 1000000)) InVars {main_~n0~0=v_main_~n0~0_6} OutVars{main_~n0~0=v_main_~n0~0_6} AuxVars[] AssignedVars[] {751#(and (or (<= 1 main_~k~0) (<= main_~i0~0 main_~k~0)) (or (<= main_~i0~0 1) (<= 2 main_~k~0)))} is VALID [2022-04-07 17:03:47,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {593#true} [91] mainENTRY-->L30: Formula: (and (= v_main_~i0~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_5 0) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~n1~0_3 |v_main_#t~nondet2_2|) (= v_main_~n0~0_2 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_3, main_~i0~0=v_main_~i0~0_3, main_~n0~0=v_main_~n0~0_2, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~n1~0, main_#t~nondet1, main_~k~0, main_#t~nondet2, main_~i0~0, main_~n0~0] {751#(and (or (<= 1 main_~k~0) (<= main_~i0~0 main_~k~0)) (or (<= main_~i0~0 1) (<= 2 main_~k~0)))} is VALID [2022-04-07 17:03:47,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 17:03:47,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 17:03:47,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 17:03:47,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#true} [89] 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] {593#true} is VALID [2022-04-07 17:03:47,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#true} is VALID [2022-04-07 17:03:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:47,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161387528] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:03:47,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:03:47,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 29 [2022-04-07 17:03:47,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110681639] [2022-04-07 17:03:47,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:03:47,311 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 26 states have internal predecessors, (44), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2022-04-07 17:03:47,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:47,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 26 states have internal predecessors, (44), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:47,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:47,357 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-07 17:03:47,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:47,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-07 17:03:47,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2022-04-07 17:03:47,359 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 29 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 26 states have internal predecessors, (44), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:50,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:50,213 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-04-07 17:03:50,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-07 17:03:50,213 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 26 states have internal predecessors, (44), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2022-04-07 17:03:50,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 26 states have internal predecessors, (44), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 85 transitions. [2022-04-07 17:03:50,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 26 states have internal predecessors, (44), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:50,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 85 transitions. [2022-04-07 17:03:50,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 85 transitions. [2022-04-07 17:03:50,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:50,322 INFO L225 Difference]: With dead ends: 75 [2022-04-07 17:03:50,322 INFO L226 Difference]: Without dead ends: 65 [2022-04-07 17:03:50,323 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=527, Invalid=2779, Unknown=0, NotChecked=0, Total=3306 [2022-04-07 17:03:50,324 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 131 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:50,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 92 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-07 17:03:50,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-07 17:03:50,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2022-04-07 17:03:50,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:50,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 48 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 38 states have internal predecessors, (43), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 17:03:50,331 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 48 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 38 states have internal predecessors, (43), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 17:03:50,331 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 48 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 38 states have internal predecessors, (43), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 17:03:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:50,334 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-07 17:03:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-07 17:03:50,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:50,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:50,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 38 states have internal predecessors, (43), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 65 states. [2022-04-07 17:03:50,336 INFO L87 Difference]: Start difference. First operand has 48 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 38 states have internal predecessors, (43), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand 65 states. [2022-04-07 17:03:50,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:50,339 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-07 17:03:50,339 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-07 17:03:50,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:50,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:50,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:50,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 38 states have internal predecessors, (43), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 17:03:50,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2022-04-07 17:03:50,342 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 25 [2022-04-07 17:03:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:50,343 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2022-04-07 17:03:50,343 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 26 states have internal predecessors, (44), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:50,343 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2022-04-07 17:03:50,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 17:03:50,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:50,344 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:50,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-07 17:03:50,555 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-07 17:03:50,556 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:50,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:50,556 INFO L85 PathProgramCache]: Analyzing trace with hash -390901714, now seen corresponding path program 1 times [2022-04-07 17:03:50,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:50,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336781945] [2022-04-07 17:03:50,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:50,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:50,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:50,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {1110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [89] 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] {1090#true} is VALID [2022-04-07 17:03:50,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {1090#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#true} is VALID [2022-04-07 17:03:50,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1090#true} {1090#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#true} is VALID [2022-04-07 17:03:50,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-07 17:03:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:50,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {1090#true} [111] __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] {1090#true} is VALID [2022-04-07 17:03:50,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {1090#true} [113] 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[] {1090#true} is VALID [2022-04-07 17:03:50,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {1090#true} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#true} is VALID [2022-04-07 17:03:50,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1090#true} {1101#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} [119] __VERIFIER_assertEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1101#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} is VALID [2022-04-07 17:03:50,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {1090#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:03:50,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {1110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [89] 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] {1090#true} is VALID [2022-04-07 17:03:50,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {1090#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#true} is VALID [2022-04-07 17:03:50,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1090#true} {1090#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#true} is VALID [2022-04-07 17:03:50,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {1090#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#true} is VALID [2022-04-07 17:03:50,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {1090#true} [91] mainENTRY-->L30: Formula: (and (= v_main_~i0~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_5 0) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~n1~0_3 |v_main_#t~nondet2_2|) (= v_main_~n0~0_2 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_3, main_~i0~0=v_main_~i0~0_3, main_~n0~0=v_main_~n0~0_2, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~n1~0, main_#t~nondet1, main_~k~0, main_#t~nondet2, main_~i0~0, main_~n0~0] {1095#(and (= main_~i0~0 0) (= main_~k~0 0))} is VALID [2022-04-07 17:03:50,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {1095#(and (= main_~i0~0 0) (= main_~k~0 0))} [94] L30-->L31: Formula: (and (<= 0 (+ v_main_~n0~0_6 1000000)) (< v_main_~n0~0_6 1000000)) InVars {main_~n0~0=v_main_~n0~0_6} OutVars{main_~n0~0=v_main_~n0~0_6} AuxVars[] AssignedVars[] {1095#(and (= main_~i0~0 0) (= main_~k~0 0))} is VALID [2022-04-07 17:03:50,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {1095#(and (= main_~i0~0 0) (= main_~k~0 0))} [97] L31-->L32-2: Formula: (and (< v_main_~n1~0_7 1000000) (<= 0 (+ v_main_~n1~0_7 1000000))) InVars {main_~n1~0=v_main_~n1~0_7} OutVars{main_~n1~0=v_main_~n1~0_7} AuxVars[] AssignedVars[] {1095#(and (= main_~i0~0 0) (= main_~k~0 0))} is VALID [2022-04-07 17:03:50,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {1095#(and (= main_~i0~0 0) (= main_~k~0 0))} [100] L32-2-->L32-2: Formula: (or (and (< v_main_~i0~0_1 (+ v_main_~n0~0_1 1)) (< v_main_~i0~0_2 v_main_~i0~0_1) (= (+ v_main_~i0~0_2 v_main_~k~0_1) (+ v_main_~i0~0_1 v_main_~k~0_2))) (and (= v_main_~k~0_2 v_main_~k~0_1) (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (<= v_main_~n0~0_1 v_main_~i0~0_2) (= v_main_~i0~0_2 v_main_~i0~0_1) (= |v_main_#t~post4_3| |v_main_#t~post4_1|))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~i0~0=v_main_~i0~0_2, main_#t~post3=|v_main_#t~post3_3|, main_~n0~0=v_main_~n0~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i0~0=v_main_~i0~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~n0~0=v_main_~n0~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_#t~post4, main_~i0~0, main_#t~post3] {1096#(<= main_~i0~0 main_~k~0)} is VALID [2022-04-07 17:03:50,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {1096#(<= main_~i0~0 main_~k~0)} [99] L32-2-->L32-3: Formula: (not (< v_main_~i0~0_4 v_main_~n0~0_9)) InVars {main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} OutVars{main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} AuxVars[] AssignedVars[] {1097#(<= main_~n0~0 main_~k~0)} is VALID [2022-04-07 17:03:50,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {1097#(<= main_~n0~0 main_~k~0)} [101] L32-3-->L37-2: Formula: (= v_main_~i1~0_1 0) InVars {} OutVars{main_~i1~0=v_main_~i1~0_1} AuxVars[] AssignedVars[main_~i1~0] {1098#(and (= main_~i1~0 0) (<= main_~n0~0 main_~k~0))} is VALID [2022-04-07 17:03:50,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {1098#(and (= main_~i1~0 0) (<= main_~n0~0 main_~k~0))} [104] L37-2-->L37-2: Formula: (or (and (= v_main_~k~0_4 v_main_~k~0_3) (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (= v_main_~i1~0_3 v_main_~i1~0_4) (not (< v_main_~i1~0_4 v_main_~n1~0_2))) (and (< v_main_~i1~0_4 v_main_~i1~0_3) (= (+ v_main_~i1~0_4 v_main_~k~0_3) (+ v_main_~i1~0_3 v_main_~k~0_4)) (< v_main_~i1~0_3 (+ v_main_~n1~0_2 1)))) InVars {main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_3|, main_~i1~0=v_main_~i1~0_4, main_~k~0=v_main_~k~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~i1~0=v_main_~i1~0_3, main_~k~0=v_main_~k~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~i1~0, main_~k~0, main_#t~post5, main_#t~post6] {1099#(or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0) (<= (+ main_~i1~0 main_~n0~0) main_~k~0))} is VALID [2022-04-07 17:03:50,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {1099#(or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0) (<= (+ main_~i1~0 main_~n0~0) main_~k~0))} [104] L37-2-->L37-2: Formula: (or (and (= v_main_~k~0_4 v_main_~k~0_3) (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (= v_main_~i1~0_3 v_main_~i1~0_4) (not (< v_main_~i1~0_4 v_main_~n1~0_2))) (and (< v_main_~i1~0_4 v_main_~i1~0_3) (= (+ v_main_~i1~0_4 v_main_~k~0_3) (+ v_main_~i1~0_3 v_main_~k~0_4)) (< v_main_~i1~0_3 (+ v_main_~n1~0_2 1)))) InVars {main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_3|, main_~i1~0=v_main_~i1~0_4, main_~k~0=v_main_~k~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~i1~0=v_main_~i1~0_3, main_~k~0=v_main_~k~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~i1~0, main_~k~0, main_#t~post5, main_#t~post6] {1099#(or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0) (<= (+ main_~i1~0 main_~n0~0) main_~k~0))} is VALID [2022-04-07 17:03:50,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {1099#(or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0) (<= (+ main_~i1~0 main_~n0~0) main_~k~0))} [103] L37-2-->L37-3: Formula: (not (< v_main_~i1~0_2 v_main_~n1~0_1)) InVars {main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} OutVars{main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} AuxVars[] AssignedVars[] {1100#(or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0))} is VALID [2022-04-07 17:03:50,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {1100#(or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0))} [105] L37-3-->L42-2: Formula: (= v_main_~j1~0_1 0) InVars {} OutVars{main_~j1~0=v_main_~j1~0_1} AuxVars[] AssignedVars[main_~j1~0] {1101#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} is VALID [2022-04-07 17:03:50,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {1101#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} [108] L42-2-->L43: Formula: (< v_main_~j1~0_3 (+ v_main_~n0~0_8 v_main_~n1~0_9)) InVars {main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} OutVars{main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} AuxVars[] AssignedVars[] {1101#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} is VALID [2022-04-07 17:03:50,851 INFO L272 TraceCheckUtils]: 16: Hoare triple {1101#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} [109] L43-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1090#true} is VALID [2022-04-07 17:03:50,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {1090#true} [111] __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] {1090#true} is VALID [2022-04-07 17:03:50,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {1090#true} [113] 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[] {1090#true} is VALID [2022-04-07 17:03:50,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {1090#true} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#true} is VALID [2022-04-07 17:03:50,852 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1090#true} {1101#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} [119] __VERIFIER_assertEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1101#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} is VALID [2022-04-07 17:03:50,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {1101#(and (= main_~j1~0 0) (or (<= (+ main_~n1~0 main_~n0~0) 0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0)))} [110] L43-1-->L42-2: Formula: (and (= v_main_~j1~0_4 (+ v_main_~j1~0_5 1)) (= v_main_~k~0_8 (+ v_main_~k~0_7 1))) InVars {main_~j1~0=v_main_~j1~0_5, main_~k~0=v_main_~k~0_8} OutVars{main_~j1~0=v_main_~j1~0_4, main_#t~post8=|v_main_#t~post8_1|, main_~k~0=v_main_~k~0_7, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~k~0, main_~j1~0, main_#t~post8, main_#t~post7] {1106#(or (<= (+ main_~n1~0 main_~n0~0) (+ main_~k~0 main_~j1~0)) (<= (+ main_~n1~0 main_~n0~0 1) main_~j1~0))} is VALID [2022-04-07 17:03:50,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {1106#(or (<= (+ main_~n1~0 main_~n0~0) (+ main_~k~0 main_~j1~0)) (<= (+ main_~n1~0 main_~n0~0 1) main_~j1~0))} [108] L42-2-->L43: Formula: (< v_main_~j1~0_3 (+ v_main_~n0~0_8 v_main_~n1~0_9)) InVars {main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} OutVars{main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} AuxVars[] AssignedVars[] {1107#(<= 1 main_~k~0)} is VALID [2022-04-07 17:03:50,854 INFO L272 TraceCheckUtils]: 23: Hoare triple {1107#(<= 1 main_~k~0)} [109] L43-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1108#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:03:50,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {1108#(not (= |__VERIFIER_assert_#in~cond| 0))} [111] __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] {1109#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:03:50,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {1109#(not (= __VERIFIER_assert_~cond 0))} [112] 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[] {1091#false} is VALID [2022-04-07 17:03:50,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {1091#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1091#false} is VALID [2022-04-07 17:03:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 17:03:50,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:50,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336781945] [2022-04-07 17:03:50,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336781945] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:03:50,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648356507] [2022-04-07 17:03:50,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:50,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:50,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:50,858 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:03:50,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 17:03:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:50,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 17:03:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:50,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:03:53,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {1090#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#true} is VALID [2022-04-07 17:03:53,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {1090#true} [89] 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] {1090#true} is VALID [2022-04-07 17:03:53,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {1090#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#true} is VALID [2022-04-07 17:03:53,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1090#true} {1090#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#true} is VALID [2022-04-07 17:03:53,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {1090#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#true} is VALID [2022-04-07 17:03:53,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {1090#true} [91] mainENTRY-->L30: Formula: (and (= v_main_~i0~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_5 0) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~n1~0_3 |v_main_#t~nondet2_2|) (= v_main_~n0~0_2 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_3, main_~i0~0=v_main_~i0~0_3, main_~n0~0=v_main_~n0~0_2, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~n1~0, main_#t~nondet1, main_~k~0, main_#t~nondet2, main_~i0~0, main_~n0~0] {1129#(and (<= 0 main_~k~0) (<= main_~i0~0 0))} is VALID [2022-04-07 17:03:53,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {1129#(and (<= 0 main_~k~0) (<= main_~i0~0 0))} [94] L30-->L31: Formula: (and (<= 0 (+ v_main_~n0~0_6 1000000)) (< v_main_~n0~0_6 1000000)) InVars {main_~n0~0=v_main_~n0~0_6} OutVars{main_~n0~0=v_main_~n0~0_6} AuxVars[] AssignedVars[] {1129#(and (<= 0 main_~k~0) (<= main_~i0~0 0))} is VALID [2022-04-07 17:03:53,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {1129#(and (<= 0 main_~k~0) (<= main_~i0~0 0))} [97] L31-->L32-2: Formula: (and (< v_main_~n1~0_7 1000000) (<= 0 (+ v_main_~n1~0_7 1000000))) InVars {main_~n1~0=v_main_~n1~0_7} OutVars{main_~n1~0=v_main_~n1~0_7} AuxVars[] AssignedVars[] {1129#(and (<= 0 main_~k~0) (<= main_~i0~0 0))} is VALID [2022-04-07 17:03:53,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {1129#(and (<= 0 main_~k~0) (<= main_~i0~0 0))} [100] L32-2-->L32-2: Formula: (or (and (< v_main_~i0~0_1 (+ v_main_~n0~0_1 1)) (< v_main_~i0~0_2 v_main_~i0~0_1) (= (+ v_main_~i0~0_2 v_main_~k~0_1) (+ v_main_~i0~0_1 v_main_~k~0_2))) (and (= v_main_~k~0_2 v_main_~k~0_1) (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (<= v_main_~n0~0_1 v_main_~i0~0_2) (= v_main_~i0~0_2 v_main_~i0~0_1) (= |v_main_#t~post4_3| |v_main_#t~post4_1|))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~i0~0=v_main_~i0~0_2, main_#t~post3=|v_main_#t~post3_3|, main_~n0~0=v_main_~n0~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i0~0=v_main_~i0~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~n0~0=v_main_~n0~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_#t~post4, main_~i0~0, main_#t~post3] {1139#(or (and (< main_~i0~0 (+ main_~n0~0 1)) (<= main_~i0~0 main_~k~0) (< 0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~i0~0 0) (<= main_~n0~0 main_~i0~0)))} is VALID [2022-04-07 17:03:53,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {1139#(or (and (< main_~i0~0 (+ main_~n0~0 1)) (<= main_~i0~0 main_~k~0) (< 0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~i0~0 0) (<= main_~n0~0 main_~i0~0)))} [99] L32-2-->L32-3: Formula: (not (< v_main_~i0~0_4 v_main_~n0~0_9)) InVars {main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} OutVars{main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} AuxVars[] AssignedVars[] {1143#(or (and (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (<= main_~n0~0 0) (<= 0 main_~k~0)))} is VALID [2022-04-07 17:03:53,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {1143#(or (and (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (<= main_~n0~0 0) (<= 0 main_~k~0)))} [101] L32-3-->L37-2: Formula: (= v_main_~i1~0_1 0) InVars {} OutVars{main_~i1~0=v_main_~i1~0_1} AuxVars[] AssignedVars[main_~i1~0] {1147#(and (<= main_~i1~0 0) (or (and (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (<= main_~n0~0 0) (<= 0 main_~k~0))))} is VALID [2022-04-07 17:03:53,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {1147#(and (<= main_~i1~0 0) (or (and (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (<= main_~n0~0 0) (<= 0 main_~k~0))))} [104] L37-2-->L37-2: Formula: (or (and (= v_main_~k~0_4 v_main_~k~0_3) (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (= v_main_~i1~0_3 v_main_~i1~0_4) (not (< v_main_~i1~0_4 v_main_~n1~0_2))) (and (< v_main_~i1~0_4 v_main_~i1~0_3) (= (+ v_main_~i1~0_4 v_main_~k~0_3) (+ v_main_~i1~0_3 v_main_~k~0_4)) (< v_main_~i1~0_3 (+ v_main_~n1~0_2 1)))) InVars {main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_3|, main_~i1~0=v_main_~i1~0_4, main_~k~0=v_main_~k~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~i1~0=v_main_~i1~0_3, main_~k~0=v_main_~k~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~i1~0, main_~k~0, main_#t~post5, main_#t~post6] {1151#(or (and (< main_~i1~0 main_~k~0) (< 1 main_~k~0) (<= (+ main_~i1~0 main_~n0~0) main_~k~0) (< main_~n0~0 main_~k~0) (< main_~i1~0 (+ main_~n1~0 1))) (and (<= main_~n0~0 0) (or (and (<= 0 main_~k~0) (<= main_~i1~0 0) (<= main_~n1~0 main_~i1~0)) (and (<= main_~i1~0 main_~k~0) (< main_~i1~0 (+ main_~n1~0 1)) (< 0 main_~k~0)))) (and (<= main_~i1~0 0) (<= main_~n0~0 main_~k~0) (<= main_~n1~0 main_~i1~0) (< 0 main_~k~0)))} is VALID [2022-04-07 17:03:53,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {1151#(or (and (< main_~i1~0 main_~k~0) (< 1 main_~k~0) (<= (+ main_~i1~0 main_~n0~0) main_~k~0) (< main_~n0~0 main_~k~0) (< main_~i1~0 (+ main_~n1~0 1))) (and (<= main_~n0~0 0) (or (and (<= 0 main_~k~0) (<= main_~i1~0 0) (<= main_~n1~0 main_~i1~0)) (and (<= main_~i1~0 main_~k~0) (< main_~i1~0 (+ main_~n1~0 1)) (< 0 main_~k~0)))) (and (<= main_~i1~0 0) (<= main_~n0~0 main_~k~0) (<= main_~n1~0 main_~i1~0) (< 0 main_~k~0)))} [104] L37-2-->L37-2: Formula: (or (and (= v_main_~k~0_4 v_main_~k~0_3) (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (= v_main_~i1~0_3 v_main_~i1~0_4) (not (< v_main_~i1~0_4 v_main_~n1~0_2))) (and (< v_main_~i1~0_4 v_main_~i1~0_3) (= (+ v_main_~i1~0_4 v_main_~k~0_3) (+ v_main_~i1~0_3 v_main_~k~0_4)) (< v_main_~i1~0_3 (+ v_main_~n1~0_2 1)))) InVars {main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_3|, main_~i1~0=v_main_~i1~0_4, main_~k~0=v_main_~k~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~i1~0=v_main_~i1~0_3, main_~k~0=v_main_~k~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~i1~0, main_~k~0, main_#t~post5, main_#t~post6] {1155#(or (and (or (and (<= main_~n0~0 0) (or (and (<= main_~i1~0 main_~k~0) (< main_~i1~0 (+ main_~n1~0 1)) (< 0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~i1~0 0)))) (and (< main_~i1~0 main_~k~0) (< 1 main_~k~0) (<= (+ main_~i1~0 main_~n0~0) main_~k~0) (< main_~n0~0 main_~k~0) (< main_~i1~0 (+ main_~n1~0 1))) (and (<= main_~i1~0 0) (<= main_~n0~0 main_~k~0) (< 0 main_~k~0))) (<= main_~n1~0 main_~i1~0)) (and (or (and (< main_~i1~0 main_~k~0) (< (+ main_~n0~0 1) main_~k~0) (<= (+ main_~i1~0 main_~n0~0) main_~k~0) (< 2 main_~k~0)) (and (<= main_~n0~0 0) (< 1 main_~k~0) (<= main_~i1~0 main_~k~0))) (< main_~i1~0 (+ main_~n1~0 1))))} is VALID [2022-04-07 17:03:53,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {1155#(or (and (or (and (<= main_~n0~0 0) (or (and (<= main_~i1~0 main_~k~0) (< main_~i1~0 (+ main_~n1~0 1)) (< 0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~i1~0 0)))) (and (< main_~i1~0 main_~k~0) (< 1 main_~k~0) (<= (+ main_~i1~0 main_~n0~0) main_~k~0) (< main_~n0~0 main_~k~0) (< main_~i1~0 (+ main_~n1~0 1))) (and (<= main_~i1~0 0) (<= main_~n0~0 main_~k~0) (< 0 main_~k~0))) (<= main_~n1~0 main_~i1~0)) (and (or (and (< main_~i1~0 main_~k~0) (< (+ main_~n0~0 1) main_~k~0) (<= (+ main_~i1~0 main_~n0~0) main_~k~0) (< 2 main_~k~0)) (and (<= main_~n0~0 0) (< 1 main_~k~0) (<= main_~i1~0 main_~k~0))) (< main_~i1~0 (+ main_~n1~0 1))))} [103] L37-2-->L37-3: Formula: (not (< v_main_~i1~0_2 v_main_~n1~0_1)) InVars {main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} OutVars{main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} AuxVars[] AssignedVars[] {1159#(or (and (or (and (<= main_~n1~0 0) (<= 0 main_~k~0)) (and (<= main_~n1~0 main_~k~0) (< 0 main_~k~0))) (<= main_~n0~0 0)) (and (<= main_~n1~0 0) (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (< 1 main_~k~0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0) (< main_~n0~0 main_~k~0) (< main_~n1~0 main_~k~0)))} is VALID [2022-04-07 17:03:53,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {1159#(or (and (or (and (<= main_~n1~0 0) (<= 0 main_~k~0)) (and (<= main_~n1~0 main_~k~0) (< 0 main_~k~0))) (<= main_~n0~0 0)) (and (<= main_~n1~0 0) (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (< 1 main_~k~0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0) (< main_~n0~0 main_~k~0) (< main_~n1~0 main_~k~0)))} [105] L37-3-->L42-2: Formula: (= v_main_~j1~0_1 0) InVars {} OutVars{main_~j1~0=v_main_~j1~0_1} AuxVars[] AssignedVars[main_~j1~0] {1163#(and (or (and (or (and (<= main_~n1~0 0) (<= 0 main_~k~0)) (and (<= main_~n1~0 main_~k~0) (< 0 main_~k~0))) (<= main_~n0~0 0)) (and (<= main_~n1~0 0) (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (< 1 main_~k~0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0) (< main_~n0~0 main_~k~0) (< main_~n1~0 main_~k~0))) (<= 0 main_~j1~0))} is VALID [2022-04-07 17:03:53,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {1163#(and (or (and (or (and (<= main_~n1~0 0) (<= 0 main_~k~0)) (and (<= main_~n1~0 main_~k~0) (< 0 main_~k~0))) (<= main_~n0~0 0)) (and (<= main_~n1~0 0) (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (< 1 main_~k~0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0) (< main_~n0~0 main_~k~0) (< main_~n1~0 main_~k~0))) (<= 0 main_~j1~0))} [108] L42-2-->L43: Formula: (< v_main_~j1~0_3 (+ v_main_~n0~0_8 v_main_~n1~0_9)) InVars {main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} OutVars{main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} AuxVars[] AssignedVars[] {1163#(and (or (and (or (and (<= main_~n1~0 0) (<= 0 main_~k~0)) (and (<= main_~n1~0 main_~k~0) (< 0 main_~k~0))) (<= main_~n0~0 0)) (and (<= main_~n1~0 0) (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (< 1 main_~k~0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0) (< main_~n0~0 main_~k~0) (< main_~n1~0 main_~k~0))) (<= 0 main_~j1~0))} is VALID [2022-04-07 17:03:53,040 INFO L272 TraceCheckUtils]: 16: Hoare triple {1163#(and (or (and (or (and (<= main_~n1~0 0) (<= 0 main_~k~0)) (and (<= main_~n1~0 main_~k~0) (< 0 main_~k~0))) (<= main_~n0~0 0)) (and (<= main_~n1~0 0) (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (< 1 main_~k~0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0) (< main_~n0~0 main_~k~0) (< main_~n1~0 main_~k~0))) (<= 0 main_~j1~0))} [109] L43-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1090#true} is VALID [2022-04-07 17:03:53,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {1090#true} [111] __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] {1090#true} is VALID [2022-04-07 17:03:53,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {1090#true} [113] 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[] {1090#true} is VALID [2022-04-07 17:03:53,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {1090#true} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#true} is VALID [2022-04-07 17:03:53,041 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1090#true} {1163#(and (or (and (or (and (<= main_~n1~0 0) (<= 0 main_~k~0)) (and (<= main_~n1~0 main_~k~0) (< 0 main_~k~0))) (<= main_~n0~0 0)) (and (<= main_~n1~0 0) (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (< 1 main_~k~0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0) (< main_~n0~0 main_~k~0) (< main_~n1~0 main_~k~0))) (<= 0 main_~j1~0))} [119] __VERIFIER_assertEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1163#(and (or (and (or (and (<= main_~n1~0 0) (<= 0 main_~k~0)) (and (<= main_~n1~0 main_~k~0) (< 0 main_~k~0))) (<= main_~n0~0 0)) (and (<= main_~n1~0 0) (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (< 1 main_~k~0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0) (< main_~n0~0 main_~k~0) (< main_~n1~0 main_~k~0))) (<= 0 main_~j1~0))} is VALID [2022-04-07 17:03:53,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {1163#(and (or (and (or (and (<= main_~n1~0 0) (<= 0 main_~k~0)) (and (<= main_~n1~0 main_~k~0) (< 0 main_~k~0))) (<= main_~n0~0 0)) (and (<= main_~n1~0 0) (<= main_~n0~0 main_~k~0) (< 0 main_~k~0)) (and (< 1 main_~k~0) (<= (+ main_~n1~0 main_~n0~0) main_~k~0) (< main_~n0~0 main_~k~0) (< main_~n1~0 main_~k~0))) (<= 0 main_~j1~0))} [110] L43-1-->L42-2: Formula: (and (= v_main_~j1~0_4 (+ v_main_~j1~0_5 1)) (= v_main_~k~0_8 (+ v_main_~k~0_7 1))) InVars {main_~j1~0=v_main_~j1~0_5, main_~k~0=v_main_~k~0_8} OutVars{main_~j1~0=v_main_~j1~0_4, main_#t~post8=|v_main_#t~post8_1|, main_~k~0=v_main_~k~0_7, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~k~0, main_~j1~0, main_#t~post8, main_#t~post7] {1185#(and (or (and (<= main_~n1~0 0) (< 0 (+ main_~k~0 1)) (<= main_~n0~0 (+ main_~k~0 1))) (and (< main_~n1~0 (+ main_~k~0 1)) (<= (+ main_~n1~0 main_~n0~0) (+ main_~k~0 1)) (< main_~n0~0 (+ main_~k~0 1)) (< 0 main_~k~0)) (and (<= main_~n0~0 0) (or (and (<= main_~n1~0 0) (<= 0 (+ main_~k~0 1))) (and (< 0 (+ main_~k~0 1)) (<= main_~n1~0 (+ main_~k~0 1)))))) (<= 1 main_~j1~0))} is VALID [2022-04-07 17:03:53,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {1185#(and (or (and (<= main_~n1~0 0) (< 0 (+ main_~k~0 1)) (<= main_~n0~0 (+ main_~k~0 1))) (and (< main_~n1~0 (+ main_~k~0 1)) (<= (+ main_~n1~0 main_~n0~0) (+ main_~k~0 1)) (< main_~n0~0 (+ main_~k~0 1)) (< 0 main_~k~0)) (and (<= main_~n0~0 0) (or (and (<= main_~n1~0 0) (<= 0 (+ main_~k~0 1))) (and (< 0 (+ main_~k~0 1)) (<= main_~n1~0 (+ main_~k~0 1)))))) (<= 1 main_~j1~0))} [108] L42-2-->L43: Formula: (< v_main_~j1~0_3 (+ v_main_~n0~0_8 v_main_~n1~0_9)) InVars {main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} OutVars{main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} AuxVars[] AssignedVars[] {1107#(<= 1 main_~k~0)} is VALID [2022-04-07 17:03:53,044 INFO L272 TraceCheckUtils]: 23: Hoare triple {1107#(<= 1 main_~k~0)} [109] L43-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1192#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:03:53,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {1192#(<= 1 |__VERIFIER_assert_#in~cond|)} [111] __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] {1196#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:03:53,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {1196#(<= 1 __VERIFIER_assert_~cond)} [112] 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[] {1091#false} is VALID [2022-04-07 17:03:53,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {1091#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1091#false} is VALID [2022-04-07 17:03:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:53,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:03:54,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {1091#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1091#false} is VALID [2022-04-07 17:03:54,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {1196#(<= 1 __VERIFIER_assert_~cond)} [112] 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[] {1091#false} is VALID [2022-04-07 17:03:54,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {1192#(<= 1 |__VERIFIER_assert_#in~cond|)} [111] __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] {1196#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:03:54,294 INFO L272 TraceCheckUtils]: 23: Hoare triple {1107#(<= 1 main_~k~0)} [109] L43-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1192#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:03:54,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {1215#(or (not (< main_~j1~0 (+ main_~n1~0 main_~n0~0))) (<= 1 main_~k~0))} [108] L42-2-->L43: Formula: (< v_main_~j1~0_3 (+ v_main_~n0~0_8 v_main_~n1~0_9)) InVars {main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} OutVars{main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} AuxVars[] AssignedVars[] {1107#(<= 1 main_~k~0)} is VALID [2022-04-07 17:03:54,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {1219#(or (<= (+ main_~n1~0 main_~n0~0) (+ main_~j1~0 1)) (<= 2 main_~k~0))} [110] L43-1-->L42-2: Formula: (and (= v_main_~j1~0_4 (+ v_main_~j1~0_5 1)) (= v_main_~k~0_8 (+ v_main_~k~0_7 1))) InVars {main_~j1~0=v_main_~j1~0_5, main_~k~0=v_main_~k~0_8} OutVars{main_~j1~0=v_main_~j1~0_4, main_#t~post8=|v_main_#t~post8_1|, main_~k~0=v_main_~k~0_7, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~k~0, main_~j1~0, main_#t~post8, main_#t~post7] {1215#(or (not (< main_~j1~0 (+ main_~n1~0 main_~n0~0))) (<= 1 main_~k~0))} is VALID [2022-04-07 17:03:54,296 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1090#true} {1219#(or (<= (+ main_~n1~0 main_~n0~0) (+ main_~j1~0 1)) (<= 2 main_~k~0))} [119] __VERIFIER_assertEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1219#(or (<= (+ main_~n1~0 main_~n0~0) (+ main_~j1~0 1)) (<= 2 main_~k~0))} is VALID [2022-04-07 17:03:54,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {1090#true} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#true} is VALID [2022-04-07 17:03:54,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {1090#true} [113] 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[] {1090#true} is VALID [2022-04-07 17:03:54,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {1090#true} [111] __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] {1090#true} is VALID [2022-04-07 17:03:54,296 INFO L272 TraceCheckUtils]: 16: Hoare triple {1219#(or (<= (+ main_~n1~0 main_~n0~0) (+ main_~j1~0 1)) (<= 2 main_~k~0))} [109] L43-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_9) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1090#true} is VALID [2022-04-07 17:03:54,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {1219#(or (<= (+ main_~n1~0 main_~n0~0) (+ main_~j1~0 1)) (<= 2 main_~k~0))} [108] L42-2-->L43: Formula: (< v_main_~j1~0_3 (+ v_main_~n0~0_8 v_main_~n1~0_9)) InVars {main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} OutVars{main_~n1~0=v_main_~n1~0_9, main_~j1~0=v_main_~j1~0_3, main_~n0~0=v_main_~n0~0_8} AuxVars[] AssignedVars[] {1219#(or (<= (+ main_~n1~0 main_~n0~0) (+ main_~j1~0 1)) (<= 2 main_~k~0))} is VALID [2022-04-07 17:03:54,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {1241#(or (<= 2 main_~k~0) (<= (+ main_~n1~0 main_~n0~0) 1))} [105] L37-3-->L42-2: Formula: (= v_main_~j1~0_1 0) InVars {} OutVars{main_~j1~0=v_main_~j1~0_1} AuxVars[] AssignedVars[main_~j1~0] {1219#(or (<= (+ main_~n1~0 main_~n0~0) (+ main_~j1~0 1)) (<= 2 main_~k~0))} is VALID [2022-04-07 17:03:54,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {1245#(or (<= 2 main_~k~0) (<= (+ main_~n1~0 main_~n0~0) 1) (< main_~i1~0 main_~n1~0))} [103] L37-2-->L37-3: Formula: (not (< v_main_~i1~0_2 v_main_~n1~0_1)) InVars {main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} OutVars{main_~n1~0=v_main_~n1~0_1, main_~i1~0=v_main_~i1~0_2} AuxVars[] AssignedVars[] {1241#(or (<= 2 main_~k~0) (<= (+ main_~n1~0 main_~n0~0) 1))} is VALID [2022-04-07 17:03:54,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {1249#(or (and (or (<= main_~n1~0 main_~i1~0) (<= (+ 2 main_~i1~0) (+ main_~k~0 main_~n1~0))) (or (<= 2 main_~k~0) (< main_~i1~0 main_~n1~0))) (<= (+ main_~n1~0 main_~n0~0) 1))} [104] L37-2-->L37-2: Formula: (or (and (= v_main_~k~0_4 v_main_~k~0_3) (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (= v_main_~i1~0_3 v_main_~i1~0_4) (not (< v_main_~i1~0_4 v_main_~n1~0_2))) (and (< v_main_~i1~0_4 v_main_~i1~0_3) (= (+ v_main_~i1~0_4 v_main_~k~0_3) (+ v_main_~i1~0_3 v_main_~k~0_4)) (< v_main_~i1~0_3 (+ v_main_~n1~0_2 1)))) InVars {main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_3|, main_~i1~0=v_main_~i1~0_4, main_~k~0=v_main_~k~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~i1~0=v_main_~i1~0_3, main_~k~0=v_main_~k~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~i1~0, main_~k~0, main_#t~post5, main_#t~post6] {1245#(or (<= 2 main_~k~0) (<= (+ main_~n1~0 main_~n0~0) 1) (< main_~i1~0 main_~n1~0))} is VALID [2022-04-07 17:03:54,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {1253#(and (or (<= 1 main_~k~0) (<= (+ main_~i1~0 main_~n0~0) main_~k~0)) (or (<= (+ main_~i1~0 main_~n0~0) 1) (<= 2 main_~k~0)))} [104] L37-2-->L37-2: Formula: (or (and (= v_main_~k~0_4 v_main_~k~0_3) (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (= v_main_~i1~0_3 v_main_~i1~0_4) (not (< v_main_~i1~0_4 v_main_~n1~0_2))) (and (< v_main_~i1~0_4 v_main_~i1~0_3) (= (+ v_main_~i1~0_4 v_main_~k~0_3) (+ v_main_~i1~0_3 v_main_~k~0_4)) (< v_main_~i1~0_3 (+ v_main_~n1~0_2 1)))) InVars {main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_3|, main_~i1~0=v_main_~i1~0_4, main_~k~0=v_main_~k~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~n1~0=v_main_~n1~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~i1~0=v_main_~i1~0_3, main_~k~0=v_main_~k~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~i1~0, main_~k~0, main_#t~post5, main_#t~post6] {1249#(or (and (or (<= main_~n1~0 main_~i1~0) (<= (+ 2 main_~i1~0) (+ main_~k~0 main_~n1~0))) (or (<= 2 main_~k~0) (< main_~i1~0 main_~n1~0))) (<= (+ main_~n1~0 main_~n0~0) 1))} is VALID [2022-04-07 17:03:54,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {1257#(and (or (<= 1 main_~k~0) (<= main_~n0~0 main_~k~0)) (or (<= main_~n0~0 1) (<= 2 main_~k~0)))} [101] L32-3-->L37-2: Formula: (= v_main_~i1~0_1 0) InVars {} OutVars{main_~i1~0=v_main_~i1~0_1} AuxVars[] AssignedVars[main_~i1~0] {1253#(and (or (<= 1 main_~k~0) (<= (+ main_~i1~0 main_~n0~0) main_~k~0)) (or (<= (+ main_~i1~0 main_~n0~0) 1) (<= 2 main_~k~0)))} is VALID [2022-04-07 17:03:54,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {1261#(or (< main_~i0~0 main_~n0~0) (and (or (<= 1 main_~k~0) (<= main_~n0~0 main_~k~0)) (or (<= main_~n0~0 1) (<= 2 main_~k~0))))} [99] L32-2-->L32-3: Formula: (not (< v_main_~i0~0_4 v_main_~n0~0_9)) InVars {main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} OutVars{main_~n0~0=v_main_~n0~0_9, main_~i0~0=v_main_~i0~0_4} AuxVars[] AssignedVars[] {1257#(and (or (<= 1 main_~k~0) (<= main_~n0~0 main_~k~0)) (or (<= main_~n0~0 1) (<= 2 main_~k~0)))} is VALID [2022-04-07 17:03:54,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {1265#(and (or (<= 1 main_~k~0) (<= main_~i0~0 main_~k~0)) (or (<= main_~i0~0 1) (<= 2 main_~k~0)))} [100] L32-2-->L32-2: Formula: (or (and (< v_main_~i0~0_1 (+ v_main_~n0~0_1 1)) (< v_main_~i0~0_2 v_main_~i0~0_1) (= (+ v_main_~i0~0_2 v_main_~k~0_1) (+ v_main_~i0~0_1 v_main_~k~0_2))) (and (= v_main_~k~0_2 v_main_~k~0_1) (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (<= v_main_~n0~0_1 v_main_~i0~0_2) (= v_main_~i0~0_2 v_main_~i0~0_1) (= |v_main_#t~post4_3| |v_main_#t~post4_1|))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~i0~0=v_main_~i0~0_2, main_#t~post3=|v_main_#t~post3_3|, main_~n0~0=v_main_~n0~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i0~0=v_main_~i0~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~n0~0=v_main_~n0~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_#t~post4, main_~i0~0, main_#t~post3] {1261#(or (< main_~i0~0 main_~n0~0) (and (or (<= 1 main_~k~0) (<= main_~n0~0 main_~k~0)) (or (<= main_~n0~0 1) (<= 2 main_~k~0))))} is VALID [2022-04-07 17:03:54,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {1265#(and (or (<= 1 main_~k~0) (<= main_~i0~0 main_~k~0)) (or (<= main_~i0~0 1) (<= 2 main_~k~0)))} [97] L31-->L32-2: Formula: (and (< v_main_~n1~0_7 1000000) (<= 0 (+ v_main_~n1~0_7 1000000))) InVars {main_~n1~0=v_main_~n1~0_7} OutVars{main_~n1~0=v_main_~n1~0_7} AuxVars[] AssignedVars[] {1265#(and (or (<= 1 main_~k~0) (<= main_~i0~0 main_~k~0)) (or (<= main_~i0~0 1) (<= 2 main_~k~0)))} is VALID [2022-04-07 17:03:54,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {1265#(and (or (<= 1 main_~k~0) (<= main_~i0~0 main_~k~0)) (or (<= main_~i0~0 1) (<= 2 main_~k~0)))} [94] L30-->L31: Formula: (and (<= 0 (+ v_main_~n0~0_6 1000000)) (< v_main_~n0~0_6 1000000)) InVars {main_~n0~0=v_main_~n0~0_6} OutVars{main_~n0~0=v_main_~n0~0_6} AuxVars[] AssignedVars[] {1265#(and (or (<= 1 main_~k~0) (<= main_~i0~0 main_~k~0)) (or (<= main_~i0~0 1) (<= 2 main_~k~0)))} is VALID [2022-04-07 17:03:54,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {1090#true} [91] mainENTRY-->L30: Formula: (and (= v_main_~i0~0_3 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_5 0) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~n1~0_3 |v_main_#t~nondet2_2|) (= v_main_~n0~0_2 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_3, main_~i0~0=v_main_~i0~0_3, main_~n0~0=v_main_~n0~0_2, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~n1~0, main_#t~nondet1, main_~k~0, main_#t~nondet2, main_~i0~0, main_~n0~0] {1265#(and (or (<= 1 main_~k~0) (<= main_~i0~0 main_~k~0)) (or (<= main_~i0~0 1) (<= 2 main_~k~0)))} is VALID [2022-04-07 17:03:54,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {1090#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#true} is VALID [2022-04-07 17:03:54,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1090#true} {1090#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#true} is VALID [2022-04-07 17:03:54,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {1090#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#true} is VALID [2022-04-07 17:03:54,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {1090#true} [89] 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] {1090#true} is VALID [2022-04-07 17:03:54,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {1090#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1090#true} is VALID [2022-04-07 17:03:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:54,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648356507] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:03:54,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:03:54,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 34 [2022-04-07 17:03:54,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006803396] [2022-04-07 17:03:54,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:03:54,306 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 31 states have internal predecessors, (50), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 27 [2022-04-07 17:03:54,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:54,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 31 states have internal predecessors, (50), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:54,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:54,355 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-07 17:03:54,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:54,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-07 17:03:54,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2022-04-07 17:03:54,356 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 31 states have internal predecessors, (50), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:57,779 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-07 17:03:57,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-07 17:03:57,779 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 31 states have internal predecessors, (50), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 27 [2022-04-07 17:03:57,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 31 states have internal predecessors, (50), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:57,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. [2022-04-07 17:03:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 31 states have internal predecessors, (50), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. [2022-04-07 17:03:57,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 56 transitions. [2022-04-07 17:03:57,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:57,856 INFO L225 Difference]: With dead ends: 63 [2022-04-07 17:03:57,856 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 17:03:57,857 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=647, Invalid=3013, Unknown=0, NotChecked=0, Total=3660 [2022-04-07 17:03:57,858 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 92 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:57,858 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 100 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-07 17:03:57,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 17:03:57,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 17:03:57,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:57,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:03:57,859 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:03:57,859 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:03:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:57,860 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:03:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:03:57,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:57,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:57,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 17:03:57,860 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 17:03:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:57,860 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:03:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:03:57,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:57,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:57,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:57,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:03:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 17:03:57,861 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2022-04-07 17:03:57,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:57,861 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 17:03:57,861 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 31 states have internal predecessors, (50), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:57,862 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:03:57,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:57,864 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 17:03:57,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 17:03:58,087 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:58,089 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-07 17:03:58,090 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 17:03:58,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:03:58 BasicIcfg [2022-04-07 17:03:58,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 17:03:58,094 INFO L158 Benchmark]: Toolchain (without parser) took 19528.69ms. Allocated memory was 203.4MB in the beginning and 325.1MB in the end (delta: 121.6MB). Free memory was 144.7MB in the beginning and 112.5MB in the end (delta: 32.2MB). Peak memory consumption was 154.1MB. Max. memory is 8.0GB. [2022-04-07 17:03:58,094 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 203.4MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:03:58,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.31ms. Allocated memory was 203.4MB in the beginning and 270.5MB in the end (delta: 67.1MB). Free memory was 144.5MB in the beginning and 239.4MB in the end (delta: -94.9MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2022-04-07 17:03:58,095 INFO L158 Benchmark]: Boogie Preprocessor took 55.15ms. Allocated memory is still 270.5MB. Free memory was 239.4MB in the beginning and 238.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 17:03:58,095 INFO L158 Benchmark]: RCFGBuilder took 414.06ms. Allocated memory is still 270.5MB. Free memory was 238.0MB in the beginning and 223.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-07 17:03:58,095 INFO L158 Benchmark]: IcfgTransformer took 740.77ms. Allocated memory is still 270.5MB. Free memory was 223.8MB in the beginning and 189.7MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-04-07 17:03:58,096 INFO L158 Benchmark]: TraceAbstraction took 17987.21ms. Allocated memory was 270.5MB in the beginning and 325.1MB in the end (delta: 54.5MB). Free memory was 189.2MB in the beginning and 112.5MB in the end (delta: 76.7MB). Peak memory consumption was 131.8MB. Max. memory is 8.0GB. [2022-04-07 17:03:58,097 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 203.4MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 323.31ms. Allocated memory was 203.4MB in the beginning and 270.5MB in the end (delta: 67.1MB). Free memory was 144.5MB in the beginning and 239.4MB in the end (delta: -94.9MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.15ms. Allocated memory is still 270.5MB. Free memory was 239.4MB in the beginning and 238.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 414.06ms. Allocated memory is still 270.5MB. Free memory was 238.0MB in the beginning and 223.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * IcfgTransformer took 740.77ms. Allocated memory is still 270.5MB. Free memory was 223.8MB in the beginning and 189.7MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 17987.21ms. Allocated memory was 270.5MB in the beginning and 325.1MB in the end (delta: 54.5MB). Free memory was 189.2MB in the beginning and 112.5MB in the end (delta: 76.7MB). Peak memory consumption was 131.8MB. 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, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.9s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 368 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 338 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 246 mSDsCounter, 300 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1397 IncrementalHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 300 mSolverCounterUnsat, 92 mSDtfsCounter, 1397 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 99 SyntacticMatches, 9 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2289 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=4, InterpolantAutomatonStates: 94, 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, 5 MinimizatonAttempts, 29 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 1787 SizeOfPredicates, 40 NumberOfNonLiveVariables, 234 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 14/42 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-07 17:03:58,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...