/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/up.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:17:08,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:17:08,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:17:09,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:17:09,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:17:09,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:17:09,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:17:09,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:17:09,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:17:09,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:17:09,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:17:09,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:17:09,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:17:09,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:17:09,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:17:09,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:17:09,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:17:09,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:17:09,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:17:09,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:17:09,042 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:17:09,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:17:09,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:17:09,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:17:09,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:17:09,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:17:09,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:17:09,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:17:09,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:17:09,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:17:09,061 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:17:09,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:17:09,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:17:09,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:17:09,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:17:09,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:17:09,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:17:09,063 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:17:09,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:17:09,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:17:09,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:17:09,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:17:09,065 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:17:09,072 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:17:09,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:17:09,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:17:09,074 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:17:09,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:17:09,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:17:09,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:17:09,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:17:09,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:17:09,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:17:09,075 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:17:09,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:17:09,075 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:17:09,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:17:09,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:17:09,075 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:17:09,075 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:17:09,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:17:09,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:17:09,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:17:09,076 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:17:09,077 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:17:09,077 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 16:17:09,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:17:09,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:17:09,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:17:09,304 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:17:09,307 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:17:09,308 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/up.i [2022-04-27 16:17:09,357 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf7c1703/0442bea140d647c0aa8f95332336c885/FLAG9cc290710 [2022-04-27 16:17:09,704 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:17:09,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/up.i [2022-04-27 16:17:09,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf7c1703/0442bea140d647c0aa8f95332336c885/FLAG9cc290710 [2022-04-27 16:17:09,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf7c1703/0442bea140d647c0aa8f95332336c885 [2022-04-27 16:17:09,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:17:09,727 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:17:09,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:17:09,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:17:09,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:17:09,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:17:09" (1/1) ... [2022-04-27 16:17:09,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@508b4671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:09, skipping insertion in model container [2022-04-27 16:17:09,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:17:09" (1/1) ... [2022-04-27 16:17:09,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:17:09,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:17:09,894 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/up.i[893,906] [2022-04-27 16:17:09,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:17:09,909 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:17:09,917 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/up.i[893,906] [2022-04-27 16:17:09,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:17:09,930 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:17:09,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:09 WrapperNode [2022-04-27 16:17:09,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:17:09,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:17:09,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:17:09,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:17:09,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:09" (1/1) ... [2022-04-27 16:17:09,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:09" (1/1) ... [2022-04-27 16:17:09,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:09" (1/1) ... [2022-04-27 16:17:09,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:09" (1/1) ... [2022-04-27 16:17:09,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:09" (1/1) ... [2022-04-27 16:17:09,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:09" (1/1) ... [2022-04-27 16:17:09,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:09" (1/1) ... [2022-04-27 16:17:09,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:17:09,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:17:09,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:17:09,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:17:09,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:09" (1/1) ... [2022-04-27 16:17:09,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:17:09,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:17:09,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 16:17:09,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 16:17:10,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:17:10,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:17:10,007 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:17:10,007 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:17:10,007 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:17:10,007 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:17:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:17:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:17:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 16:17:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 16:17:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:17:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:17:10,008 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:17:10,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:17:10,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:17:10,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:17:10,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:17:10,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:17:10,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:17:10,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:17:10,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:17:10,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:17:10,059 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:17:10,060 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:17:10,273 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:17:10,277 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:17:10,278 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 16:17:10,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:17:10 BoogieIcfgContainer [2022-04-27 16:17:10,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:17:10,280 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:17:10,280 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:17:10,287 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:17:10,289 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:17:10" (1/1) ... [2022-04-27 16:17:10,291 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:17:12,877 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-27 16:17:13,006 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-27 16:17:13,006 INFO L91 elerationTransformer]: Accelerated Formula: (and (< v_main_~i~0_3 v_main_~n~0_4) (= v_main_~k~0_4 (+ v_main_~k~0_5 1)) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~k~0=v_main_~k~0_5, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2, main_#t~post3] to Formula: (or (and (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~k~0_5 v_main_~k~0_4) (<= v_main_~n~0_4 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~i~0_2)) (and (= (+ v_main_~i~0_3 v_main_~k~0_4) (+ v_main_~i~0_2 v_main_~k~0_5)) (< v_main_~i~0_3 v_main_~i~0_2) (< v_main_~i~0_2 (+ v_main_~n~0_4 1)))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_4, main_#t~post3=|v_main_#t~post3_3|, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2, main_#t~post3] [2022-04-27 16:17:13,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:17:13 BasicIcfg [2022-04-27 16:17:13,012 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:17:13,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:17:13,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:17:13,015 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:17:13,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:17:09" (1/4) ... [2022-04-27 16:17:13,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2227e690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:17:13, skipping insertion in model container [2022-04-27 16:17:13,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:09" (2/4) ... [2022-04-27 16:17:13,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2227e690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:17:13, skipping insertion in model container [2022-04-27 16:17:13,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:17:10" (3/4) ... [2022-04-27 16:17:13,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2227e690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:17:13, skipping insertion in model container [2022-04-27 16:17:13,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:17:13" (4/4) ... [2022-04-27 16:17:13,017 INFO L111 eAbstractionObserver]: Analyzing ICFG up.iJordan [2022-04-27 16:17:13,028 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:17:13,028 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:17:13,054 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:17:13,065 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@238af195, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4927fbdb [2022-04-27 16:17:13,065 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:17:13,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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-27 16:17:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 16:17:13,076 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:17:13,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:17:13,077 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:17:13,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:17:13,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1244271256, now seen corresponding path program 1 times [2022-04-27 16:17:13,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:17:13,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531755701] [2022-04-27 16:17:13,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:17:13,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:17:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:13,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:17:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:13,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] 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] {24#true} is VALID [2022-04-27 16:17:13,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:17:13,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:17:13,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:17:13,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] 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] {24#true} is VALID [2022-04-27 16:17:13,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:17:13,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:17:13,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:17:13,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [70] mainENTRY-->L29-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (= v_main_~k~0_6 0) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {24#true} is VALID [2022-04-27 16:17:13,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [72] L29-2-->L29-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:17:13,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} [75] L29-3-->L34-2: Formula: (= v_main_~j~0_5 0) InVars {} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0] {25#false} is VALID [2022-04-27 16:17:13,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} [78] L34-2-->L35: Formula: (< v_main_~j~0_2 v_main_~n~0_2) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:17:13,229 INFO L272 TraceCheckUtils]: 9: Hoare triple {25#false} [80] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {25#false} is VALID [2022-04-27 16:17:13,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [82] __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] {25#false} is VALID [2022-04-27 16:17:13,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} [83] 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[] {25#false} is VALID [2022-04-27 16:17:13,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} [85] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:17:13,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:17:13,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:17:13,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531755701] [2022-04-27 16:17:13,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531755701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:17:13,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:17:13,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:17:13,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239760542] [2022-04-27 16:17:13,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:17:13,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-27 16:17:13,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:17:13,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:13,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:17:13,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:17:13,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:17:13,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:17:13,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:17:13,291 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:13,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:13,339 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-27 16:17:13,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:17:13,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-27 16:17:13,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:17:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:13,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-04-27 16:17:13,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-04-27 16:17:13,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2022-04-27 16:17:13,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:17:13,386 INFO L225 Difference]: With dead ends: 21 [2022-04-27 16:17:13,386 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 16:17:13,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:17:13,390 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 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-27 16:17:13,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:17:13,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 16:17:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 16:17:13,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:17:13,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-27 16:17:13,412 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-27 16:17:13,412 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-27 16:17:13,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:13,419 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 16:17:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 16:17:13,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:17:13,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:17:13,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 17 states. [2022-04-27 16:17:13,420 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 17 states. [2022-04-27 16:17:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:13,422 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 16:17:13,422 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 16:17:13,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:17:13,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:17:13,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:17:13,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:17:13,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-27 16:17:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-27 16:17:13,425 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2022-04-27 16:17:13,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:17:13,425 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-27 16:17:13,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:13,425 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 16:17:13,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 16:17:13,426 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:17:13,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:17:13,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:17:13,426 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:17:13,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:17:13,427 INFO L85 PathProgramCache]: Analyzing trace with hash 2131774937, now seen corresponding path program 1 times [2022-04-27 16:17:13,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:17:13,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836875760] [2022-04-27 16:17:13,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:17:13,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:17:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:13,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:17:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:13,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {112#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] 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] {104#true} is VALID [2022-04-27 16:17:13,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {104#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {104#true} is VALID [2022-04-27 16:17:13,493 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104#true} {104#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {104#true} is VALID [2022-04-27 16:17:13,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {104#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:17:13,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {112#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] 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] {104#true} is VALID [2022-04-27 16:17:13,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {104#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {104#true} is VALID [2022-04-27 16:17:13,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104#true} {104#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {104#true} is VALID [2022-04-27 16:17:13,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {104#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {104#true} is VALID [2022-04-27 16:17:13,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {104#true} [70] mainENTRY-->L29-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (= v_main_~k~0_6 0) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {109#(= main_~i~0 0)} is VALID [2022-04-27 16:17:13,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {109#(= main_~i~0 0)} [73] L29-2-->L29-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {110#(<= main_~n~0 0)} is VALID [2022-04-27 16:17:13,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {110#(<= main_~n~0 0)} [75] L29-3-->L34-2: Formula: (= v_main_~j~0_5 0) InVars {} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0] {111#(and (= main_~j~0 0) (<= main_~n~0 0))} is VALID [2022-04-27 16:17:13,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {111#(and (= main_~j~0 0) (<= main_~n~0 0))} [78] L34-2-->L35: Formula: (< v_main_~j~0_2 v_main_~n~0_2) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {105#false} is VALID [2022-04-27 16:17:13,496 INFO L272 TraceCheckUtils]: 9: Hoare triple {105#false} [80] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {105#false} is VALID [2022-04-27 16:17:13,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {105#false} [82] __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] {105#false} is VALID [2022-04-27 16:17:13,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {105#false} [83] 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[] {105#false} is VALID [2022-04-27 16:17:13,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {105#false} [85] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#false} is VALID [2022-04-27 16:17:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:17:13,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:17:13,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836875760] [2022-04-27 16:17:13,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836875760] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:17:13,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:17:13,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:17:13,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851474189] [2022-04-27 16:17:13,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:17:13,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 13 [2022-04-27 16:17:13,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:17:13,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:13,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:17:13,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:17:13,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:17:13,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:17:13,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:17:13,509 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:13,662 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-27 16:17:13,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:17:13,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 13 [2022-04-27 16:17:13,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:17:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-04-27 16:17:13,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-04-27 16:17:13,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2022-04-27 16:17:13,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:17:13,690 INFO L225 Difference]: With dead ends: 20 [2022-04-27 16:17:13,690 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 16:17:13,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-27 16:17:13,694 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:17:13,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 32 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:17:13,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 16:17:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 16:17:13,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:17:13,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-27 16:17:13,701 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-27 16:17:13,701 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-27 16:17:13,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:13,703 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-27 16:17:13,703 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 16:17:13,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:17:13,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:17:13,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 18 states. [2022-04-27 16:17:13,705 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 18 states. [2022-04-27 16:17:13,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:13,706 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-27 16:17:13,706 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 16:17:13,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:17:13,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:17:13,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:17:13,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:17:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-27 16:17:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-27 16:17:13,709 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-04-27 16:17:13,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:17:13,709 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-27 16:17:13,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:17:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 16:17:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:17:13,710 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:17:13,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:17:13,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:17:13,710 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:17:13,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:17:13,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1540521565, now seen corresponding path program 1 times [2022-04-27 16:17:13,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:17:13,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848335238] [2022-04-27 16:17:13,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:17:13,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:17:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:13,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:17:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:13,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] 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] {195#true} is VALID [2022-04-27 16:17:13,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {195#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#true} is VALID [2022-04-27 16:17:13,892 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {195#true} {195#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#true} is VALID [2022-04-27 16:17:13,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {195#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:17:13,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] 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] {195#true} is VALID [2022-04-27 16:17:13,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {195#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#true} is VALID [2022-04-27 16:17:13,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {195#true} {195#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#true} is VALID [2022-04-27 16:17:13,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {195#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#true} is VALID [2022-04-27 16:17:13,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {195#true} [70] mainENTRY-->L29-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (= v_main_~k~0_6 0) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {200#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:17:13,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {200#(and (= main_~k~0 0) (= main_~i~0 0))} [74] L29-2-->L29-2: Formula: (or (and (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~k~0_5 v_main_~k~0_4) (<= v_main_~n~0_4 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~i~0_2)) (and (= (+ v_main_~i~0_3 v_main_~k~0_4) (+ v_main_~i~0_2 v_main_~k~0_5)) (< v_main_~i~0_3 v_main_~i~0_2) (< v_main_~i~0_2 (+ v_main_~n~0_4 1)))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_4, main_#t~post3=|v_main_#t~post3_3|, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2, main_#t~post3] {201#(or (<= main_~i~0 main_~k~0) (<= main_~n~0 0))} is VALID [2022-04-27 16:17:13,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {201#(or (<= main_~i~0 main_~k~0) (<= main_~n~0 0))} [73] L29-2-->L29-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {202#(or (<= main_~n~0 0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-27 16:17:13,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#(or (<= main_~n~0 0) (<= main_~n~0 main_~k~0))} [75] L29-3-->L34-2: Formula: (= v_main_~j~0_5 0) InVars {} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0] {203#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2022-04-27 16:17:13,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {203#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} [78] L34-2-->L35: Formula: (< v_main_~j~0_2 v_main_~n~0_2) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {204#(<= 1 main_~k~0)} is VALID [2022-04-27 16:17:13,899 INFO L272 TraceCheckUtils]: 10: Hoare triple {204#(<= 1 main_~k~0)} [80] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {205#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:17:13,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {205#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] __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] {206#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:17:13,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {206#(not (= __VERIFIER_assert_~cond 0))} [83] 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[] {196#false} is VALID [2022-04-27 16:17:13,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {196#false} [85] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#false} is VALID [2022-04-27 16:17:13,901 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-27 16:17:13,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:17:13,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848335238] [2022-04-27 16:17:13,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848335238] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:17:13,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981781801] [2022-04-27 16:17:13,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:17:13,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:17:13,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:17:13,912 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:17:13,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 16:17:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:13,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 16:17:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:13,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:17:14,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {195#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#true} is VALID [2022-04-27 16:17:14,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {195#true} [68] 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] {195#true} is VALID [2022-04-27 16:17:14,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {195#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#true} is VALID [2022-04-27 16:17:14,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {195#true} {195#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#true} is VALID [2022-04-27 16:17:14,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {195#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#true} is VALID [2022-04-27 16:17:14,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {195#true} [70] mainENTRY-->L29-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (= v_main_~k~0_6 0) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {226#(and (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-27 16:17:14,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {226#(and (<= 0 main_~k~0) (<= main_~i~0 0))} [74] L29-2-->L29-2: Formula: (or (and (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~k~0_5 v_main_~k~0_4) (<= v_main_~n~0_4 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~i~0_2)) (and (= (+ v_main_~i~0_3 v_main_~k~0_4) (+ v_main_~i~0_2 v_main_~k~0_5)) (< v_main_~i~0_3 v_main_~i~0_2) (< v_main_~i~0_2 (+ v_main_~n~0_4 1)))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_4, main_#t~post3=|v_main_#t~post3_3|, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2, main_#t~post3] {230#(or (and (<= 0 main_~k~0) (<= main_~i~0 0) (<= main_~n~0 main_~i~0)) (and (<= main_~i~0 main_~k~0) (< 0 main_~k~0) (< main_~i~0 (+ main_~n~0 1))))} is VALID [2022-04-27 16:17:14,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {230#(or (and (<= 0 main_~k~0) (<= main_~i~0 0) (<= main_~n~0 main_~i~0)) (and (<= main_~i~0 main_~k~0) (< 0 main_~k~0) (< main_~i~0 (+ main_~n~0 1))))} [73] L29-2-->L29-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {234#(or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0)))} is VALID [2022-04-27 16:17:14,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {234#(or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0)))} [75] L29-3-->L34-2: Formula: (= v_main_~j~0_5 0) InVars {} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0] {238#(and (<= 0 main_~j~0) (or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0))))} is VALID [2022-04-27 16:17:14,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {238#(and (<= 0 main_~j~0) (or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0))))} [78] L34-2-->L35: Formula: (< v_main_~j~0_2 v_main_~n~0_2) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {204#(<= 1 main_~k~0)} is VALID [2022-04-27 16:17:14,509 INFO L272 TraceCheckUtils]: 10: Hoare triple {204#(<= 1 main_~k~0)} [80] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {245#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:17:14,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {245#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __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] {249#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:17:14,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {249#(<= 1 __VERIFIER_assert_~cond)} [83] 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[] {196#false} is VALID [2022-04-27 16:17:14,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {196#false} [85] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#false} is VALID [2022-04-27 16:17:14,510 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-27 16:17:14,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:17:14,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {196#false} [85] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#false} is VALID [2022-04-27 16:17:14,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {249#(<= 1 __VERIFIER_assert_~cond)} [83] 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[] {196#false} is VALID [2022-04-27 16:17:14,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {245#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __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] {249#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:17:14,958 INFO L272 TraceCheckUtils]: 10: Hoare triple {204#(<= 1 main_~k~0)} [80] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {245#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:17:14,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(or (<= 1 main_~k~0) (not (< main_~j~0 main_~n~0)))} [78] L34-2-->L35: Formula: (< v_main_~j~0_2 v_main_~n~0_2) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {204#(<= 1 main_~k~0)} is VALID [2022-04-27 16:17:14,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {272#(or (<= 1 main_~k~0) (<= main_~n~0 0))} [75] L29-3-->L34-2: Formula: (= v_main_~j~0_5 0) InVars {} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0] {268#(or (<= 1 main_~k~0) (not (< main_~j~0 main_~n~0)))} is VALID [2022-04-27 16:17:14,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#(or (< main_~i~0 main_~n~0) (<= 1 main_~k~0) (<= main_~n~0 0))} [73] L29-2-->L29-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {272#(or (<= 1 main_~k~0) (<= main_~n~0 0))} is VALID [2022-04-27 16:17:14,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {280#(and (or (<= 0 main_~k~0) (<= main_~i~0 main_~k~0)) (or (<= 1 main_~k~0) (<= main_~i~0 0)))} [74] L29-2-->L29-2: Formula: (or (and (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~k~0_5 v_main_~k~0_4) (<= v_main_~n~0_4 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~i~0_2)) (and (= (+ v_main_~i~0_3 v_main_~k~0_4) (+ v_main_~i~0_2 v_main_~k~0_5)) (< v_main_~i~0_3 v_main_~i~0_2) (< v_main_~i~0_2 (+ v_main_~n~0_4 1)))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_4, main_#t~post3=|v_main_#t~post3_3|, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2, main_#t~post3] {276#(or (< main_~i~0 main_~n~0) (<= 1 main_~k~0) (<= main_~n~0 0))} is VALID [2022-04-27 16:17:14,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {195#true} [70] mainENTRY-->L29-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (= v_main_~k~0_6 0) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {280#(and (or (<= 0 main_~k~0) (<= main_~i~0 main_~k~0)) (or (<= 1 main_~k~0) (<= main_~i~0 0)))} is VALID [2022-04-27 16:17:14,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {195#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#true} is VALID [2022-04-27 16:17:14,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {195#true} {195#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#true} is VALID [2022-04-27 16:17:14,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {195#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#true} is VALID [2022-04-27 16:17:14,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {195#true} [68] 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] {195#true} is VALID [2022-04-27 16:17:14,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {195#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#true} is VALID [2022-04-27 16:17:14,962 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-27 16:17:14,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981781801] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:17:14,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:17:14,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-27 16:17:14,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68335408] [2022-04-27 16:17:14,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:17:14,963 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 17 states have internal predecessors, (23), 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 14 [2022-04-27 16:17:14,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:17:14,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 17 states have internal predecessors, (23), 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-27 16:17:14,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:17:14,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 16:17:14,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:17:14,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 16:17:14,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-27 16:17:14,985 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 17 states have internal predecessors, (23), 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-27 16:17:15,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:15,538 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-27 16:17:15,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 16:17:15,539 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 17 states have internal predecessors, (23), 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 14 [2022-04-27 16:17:15,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:17:15,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 17 states have internal predecessors, (23), 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-27 16:17:15,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2022-04-27 16:17:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 17 states have internal predecessors, (23), 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-27 16:17:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2022-04-27 16:17:15,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 31 transitions. [2022-04-27 16:17:15,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:17:15,566 INFO L225 Difference]: With dead ends: 28 [2022-04-27 16:17:15,566 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 16:17:15,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2022-04-27 16:17:15,567 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:17:15,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 38 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:17:15,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 16:17:15,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-27 16:17:15,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:17:15,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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-27 16:17:15,570 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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-27 16:17:15,570 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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-27 16:17:15,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:15,572 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-27 16:17:15,572 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-27 16:17:15,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:17:15,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:17:15,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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 28 states. [2022-04-27 16:17:15,573 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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 28 states. [2022-04-27 16:17:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:15,574 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-27 16:17:15,574 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-27 16:17:15,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:17:15,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:17:15,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:17:15,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:17:15,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 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-27 16:17:15,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-27 16:17:15,576 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 14 [2022-04-27 16:17:15,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:17:15,576 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-27 16:17:15,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 17 states have internal predecessors, (23), 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-27 16:17:15,576 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-27 16:17:15,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 16:17:15,577 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:17:15,577 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:17:15,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 16:17:15,777 WARN L477 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-27 16:17:15,778 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:17:15,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:17:15,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1765964195, now seen corresponding path program 1 times [2022-04-27 16:17:15,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:17:15,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114888722] [2022-04-27 16:17:15,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:17:15,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:17:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:15,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:17:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:15,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {454#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] 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] {432#true} is VALID [2022-04-27 16:17:15,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:15,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {432#true} {432#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:15,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-27 16:17:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:15,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {432#true} [82] __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] {432#true} is VALID [2022-04-27 16:17:15,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#true} [84] 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[] {432#true} is VALID [2022-04-27 16:17:15,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {432#true} [87] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:15,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {432#true} {440#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} [90] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {440#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2022-04-27 16:17:15,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 16:17:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:15,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {432#true} [82] __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] {432#true} is VALID [2022-04-27 16:17:15,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#true} [84] 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[] {432#true} is VALID [2022-04-27 16:17:15,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {432#true} [87] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:15,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {432#true} {445#(or (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= (+ main_~n~0 1) main_~j~0))} [90] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {445#(or (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= (+ main_~n~0 1) main_~j~0))} is VALID [2022-04-27 16:17:15,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {432#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {454#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:17:15,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {454#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] 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] {432#true} is VALID [2022-04-27 16:17:15,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {432#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:15,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {432#true} {432#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:15,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {432#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:15,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#true} [70] mainENTRY-->L29-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (= v_main_~k~0_6 0) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {437#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:17:15,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {437#(and (= main_~k~0 0) (= main_~i~0 0))} [74] L29-2-->L29-2: Formula: (or (and (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~k~0_5 v_main_~k~0_4) (<= v_main_~n~0_4 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~i~0_2)) (and (= (+ v_main_~i~0_3 v_main_~k~0_4) (+ v_main_~i~0_2 v_main_~k~0_5)) (< v_main_~i~0_3 v_main_~i~0_2) (< v_main_~i~0_2 (+ v_main_~n~0_4 1)))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_4, main_#t~post3=|v_main_#t~post3_3|, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2, main_#t~post3] {438#(or (<= main_~i~0 main_~k~0) (<= main_~n~0 0))} is VALID [2022-04-27 16:17:15,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {438#(or (<= main_~i~0 main_~k~0) (<= main_~n~0 0))} [73] L29-2-->L29-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {439#(or (<= main_~n~0 0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-27 16:17:15,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {439#(or (<= main_~n~0 0) (<= main_~n~0 main_~k~0))} [75] L29-3-->L34-2: Formula: (= v_main_~j~0_5 0) InVars {} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0] {440#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2022-04-27 16:17:15,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {440#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} [78] L34-2-->L35: Formula: (< v_main_~j~0_2 v_main_~n~0_2) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {440#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2022-04-27 16:17:15,956 INFO L272 TraceCheckUtils]: 10: Hoare triple {440#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} [80] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {432#true} is VALID [2022-04-27 16:17:15,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {432#true} [82] __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] {432#true} is VALID [2022-04-27 16:17:15,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {432#true} [84] 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[] {432#true} is VALID [2022-04-27 16:17:15,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {432#true} [87] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:15,957 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {432#true} {440#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} [90] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {440#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2022-04-27 16:17:15,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {440#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} [81] L35-1-->L34-2: Formula: (and (= v_main_~k~0_3 (+ v_main_~k~0_2 1)) (= (+ v_main_~j~0_4 1) v_main_~j~0_3)) InVars {main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {445#(or (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= (+ main_~n~0 1) main_~j~0))} is VALID [2022-04-27 16:17:15,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {445#(or (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= (+ main_~n~0 1) main_~j~0))} [78] L34-2-->L35: Formula: (< v_main_~j~0_2 v_main_~n~0_2) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {445#(or (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= (+ main_~n~0 1) main_~j~0))} is VALID [2022-04-27 16:17:15,960 INFO L272 TraceCheckUtils]: 17: Hoare triple {445#(or (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= (+ main_~n~0 1) main_~j~0))} [80] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {432#true} is VALID [2022-04-27 16:17:15,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {432#true} [82] __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] {432#true} is VALID [2022-04-27 16:17:15,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {432#true} [84] 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[] {432#true} is VALID [2022-04-27 16:17:15,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {432#true} [87] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:15,961 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {432#true} {445#(or (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= (+ main_~n~0 1) main_~j~0))} [90] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {445#(or (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= (+ main_~n~0 1) main_~j~0))} is VALID [2022-04-27 16:17:15,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {445#(or (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= (+ main_~n~0 1) main_~j~0))} [81] L35-1-->L34-2: Formula: (and (= v_main_~k~0_3 (+ v_main_~k~0_2 1)) (= (+ v_main_~j~0_4 1) v_main_~j~0_3)) InVars {main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {450#(or (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= (+ main_~n~0 2) main_~j~0))} is VALID [2022-04-27 16:17:15,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {450#(or (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= (+ main_~n~0 2) main_~j~0))} [78] L34-2-->L35: Formula: (< v_main_~j~0_2 v_main_~n~0_2) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {451#(<= 1 main_~k~0)} is VALID [2022-04-27 16:17:15,964 INFO L272 TraceCheckUtils]: 24: Hoare triple {451#(<= 1 main_~k~0)} [80] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {452#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:17:15,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {452#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] __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] {453#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:17:15,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {453#(not (= __VERIFIER_assert_~cond 0))} [83] 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[] {433#false} is VALID [2022-04-27 16:17:15,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {433#false} [85] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#false} is VALID [2022-04-27 16:17:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 16:17:15,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:17:15,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114888722] [2022-04-27 16:17:15,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114888722] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:17:15,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5204771] [2022-04-27 16:17:15,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:17:15,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:17:15,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:17:15,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:17:15,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 16:17:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:16,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 16:17:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:17:16,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:17:16,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {432#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:16,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#true} [68] 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] {432#true} is VALID [2022-04-27 16:17:16,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {432#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:16,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {432#true} {432#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:16,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {432#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:16,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#true} [70] mainENTRY-->L29-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (= v_main_~k~0_6 0) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {473#(and (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-27 16:17:16,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {473#(and (<= 0 main_~k~0) (<= main_~i~0 0))} [74] L29-2-->L29-2: Formula: (or (and (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~k~0_5 v_main_~k~0_4) (<= v_main_~n~0_4 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~i~0_2)) (and (= (+ v_main_~i~0_3 v_main_~k~0_4) (+ v_main_~i~0_2 v_main_~k~0_5)) (< v_main_~i~0_3 v_main_~i~0_2) (< v_main_~i~0_2 (+ v_main_~n~0_4 1)))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_4, main_#t~post3=|v_main_#t~post3_3|, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2, main_#t~post3] {477#(or (and (<= 0 main_~k~0) (<= main_~i~0 0) (<= main_~n~0 main_~i~0)) (and (<= main_~i~0 main_~k~0) (< 0 main_~k~0) (< main_~i~0 (+ main_~n~0 1))))} is VALID [2022-04-27 16:17:16,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {477#(or (and (<= 0 main_~k~0) (<= main_~i~0 0) (<= main_~n~0 main_~i~0)) (and (<= main_~i~0 main_~k~0) (< 0 main_~k~0) (< main_~i~0 (+ main_~n~0 1))))} [73] L29-2-->L29-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {481#(or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0)))} is VALID [2022-04-27 16:17:16,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {481#(or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0)))} [75] L29-3-->L34-2: Formula: (= v_main_~j~0_5 0) InVars {} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0] {485#(and (<= 0 main_~j~0) (or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0))))} is VALID [2022-04-27 16:17:16,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {485#(and (<= 0 main_~j~0) (or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0))))} [78] L34-2-->L35: Formula: (< v_main_~j~0_2 v_main_~n~0_2) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {485#(and (<= 0 main_~j~0) (or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0))))} is VALID [2022-04-27 16:17:16,811 INFO L272 TraceCheckUtils]: 10: Hoare triple {485#(and (<= 0 main_~j~0) (or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0))))} [80] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {432#true} is VALID [2022-04-27 16:17:16,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {432#true} [82] __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] {432#true} is VALID [2022-04-27 16:17:16,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {432#true} [84] 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[] {432#true} is VALID [2022-04-27 16:17:16,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {432#true} [87] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:16,812 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {432#true} {485#(and (<= 0 main_~j~0) (or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0))))} [90] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {485#(and (<= 0 main_~j~0) (or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0))))} is VALID [2022-04-27 16:17:16,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {485#(and (<= 0 main_~j~0) (or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0))))} [81] L35-1-->L34-2: Formula: (and (= v_main_~k~0_3 (+ v_main_~k~0_2 1)) (= (+ v_main_~j~0_4 1) v_main_~j~0_3)) InVars {main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {507#(and (<= 1 main_~j~0) (or (and (< 0 (+ main_~k~0 1)) (<= main_~n~0 (+ main_~k~0 1))) (and (<= 0 (+ main_~k~0 1)) (<= main_~n~0 0))))} is VALID [2022-04-27 16:17:16,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#(and (<= 1 main_~j~0) (or (and (< 0 (+ main_~k~0 1)) (<= main_~n~0 (+ main_~k~0 1))) (and (<= 0 (+ main_~k~0 1)) (<= main_~n~0 0))))} [78] L34-2-->L35: Formula: (< v_main_~j~0_2 v_main_~n~0_2) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {507#(and (<= 1 main_~j~0) (or (and (< 0 (+ main_~k~0 1)) (<= main_~n~0 (+ main_~k~0 1))) (and (<= 0 (+ main_~k~0 1)) (<= main_~n~0 0))))} is VALID [2022-04-27 16:17:16,814 INFO L272 TraceCheckUtils]: 17: Hoare triple {507#(and (<= 1 main_~j~0) (or (and (< 0 (+ main_~k~0 1)) (<= main_~n~0 (+ main_~k~0 1))) (and (<= 0 (+ main_~k~0 1)) (<= main_~n~0 0))))} [80] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {432#true} is VALID [2022-04-27 16:17:16,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {432#true} [82] __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] {432#true} is VALID [2022-04-27 16:17:16,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {432#true} [84] 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[] {432#true} is VALID [2022-04-27 16:17:16,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {432#true} [87] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:16,815 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {432#true} {507#(and (<= 1 main_~j~0) (or (and (< 0 (+ main_~k~0 1)) (<= main_~n~0 (+ main_~k~0 1))) (and (<= 0 (+ main_~k~0 1)) (<= main_~n~0 0))))} [90] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {507#(and (<= 1 main_~j~0) (or (and (< 0 (+ main_~k~0 1)) (<= main_~n~0 (+ main_~k~0 1))) (and (<= 0 (+ main_~k~0 1)) (<= main_~n~0 0))))} is VALID [2022-04-27 16:17:16,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {507#(and (<= 1 main_~j~0) (or (and (< 0 (+ main_~k~0 1)) (<= main_~n~0 (+ main_~k~0 1))) (and (<= 0 (+ main_~k~0 1)) (<= main_~n~0 0))))} [81] L35-1-->L34-2: Formula: (and (= v_main_~k~0_3 (+ v_main_~k~0_2 1)) (= (+ v_main_~j~0_4 1) v_main_~j~0_3)) InVars {main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {529#(and (<= 2 main_~j~0) (or (and (<= 0 (+ main_~k~0 2)) (<= main_~n~0 0)) (and (<= main_~n~0 (+ main_~k~0 2)) (< 0 (+ main_~k~0 2)))))} is VALID [2022-04-27 16:17:16,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {529#(and (<= 2 main_~j~0) (or (and (<= 0 (+ main_~k~0 2)) (<= main_~n~0 0)) (and (<= main_~n~0 (+ main_~k~0 2)) (< 0 (+ main_~k~0 2)))))} [78] L34-2-->L35: Formula: (< v_main_~j~0_2 v_main_~n~0_2) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {451#(<= 1 main_~k~0)} is VALID [2022-04-27 16:17:16,816 INFO L272 TraceCheckUtils]: 24: Hoare triple {451#(<= 1 main_~k~0)} [80] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {536#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:17:16,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {536#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __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] {540#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:17:16,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {540#(<= 1 __VERIFIER_assert_~cond)} [83] 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[] {433#false} is VALID [2022-04-27 16:17:16,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {433#false} [85] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#false} is VALID [2022-04-27 16:17:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 16:17:16,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:17:17,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {433#false} [85] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#false} is VALID [2022-04-27 16:17:17,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {540#(<= 1 __VERIFIER_assert_~cond)} [83] 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[] {433#false} is VALID [2022-04-27 16:17:17,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {536#(<= 1 |__VERIFIER_assert_#in~cond|)} [82] __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] {540#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:17:17,384 INFO L272 TraceCheckUtils]: 24: Hoare triple {451#(<= 1 main_~k~0)} [80] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {536#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:17:17,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {559#(or (<= 1 main_~k~0) (not (< main_~j~0 main_~n~0)))} [78] L34-2-->L35: Formula: (< v_main_~j~0_2 v_main_~n~0_2) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {451#(<= 1 main_~k~0)} is VALID [2022-04-27 16:17:17,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {563#(or (<= 2 main_~k~0) (<= main_~n~0 (+ main_~j~0 1)))} [81] L35-1-->L34-2: Formula: (and (= v_main_~k~0_3 (+ v_main_~k~0_2 1)) (= (+ v_main_~j~0_4 1) v_main_~j~0_3)) InVars {main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {559#(or (<= 1 main_~k~0) (not (< main_~j~0 main_~n~0)))} is VALID [2022-04-27 16:17:17,385 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {432#true} {563#(or (<= 2 main_~k~0) (<= main_~n~0 (+ main_~j~0 1)))} [90] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {563#(or (<= 2 main_~k~0) (<= main_~n~0 (+ main_~j~0 1)))} is VALID [2022-04-27 16:17:17,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {432#true} [87] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:17,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {432#true} [84] 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[] {432#true} is VALID [2022-04-27 16:17:17,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {432#true} [82] __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] {432#true} is VALID [2022-04-27 16:17:17,385 INFO L272 TraceCheckUtils]: 17: Hoare triple {563#(or (<= 2 main_~k~0) (<= main_~n~0 (+ main_~j~0 1)))} [80] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {432#true} is VALID [2022-04-27 16:17:17,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {563#(or (<= 2 main_~k~0) (<= main_~n~0 (+ main_~j~0 1)))} [78] L34-2-->L35: Formula: (< v_main_~j~0_2 v_main_~n~0_2) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {563#(or (<= 2 main_~k~0) (<= main_~n~0 (+ main_~j~0 1)))} is VALID [2022-04-27 16:17:17,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {585#(or (<= main_~n~0 (+ main_~j~0 2)) (<= 3 main_~k~0))} [81] L35-1-->L34-2: Formula: (and (= v_main_~k~0_3 (+ v_main_~k~0_2 1)) (= (+ v_main_~j~0_4 1) v_main_~j~0_3)) InVars {main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {563#(or (<= 2 main_~k~0) (<= main_~n~0 (+ main_~j~0 1)))} is VALID [2022-04-27 16:17:17,387 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {432#true} {585#(or (<= main_~n~0 (+ main_~j~0 2)) (<= 3 main_~k~0))} [90] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {585#(or (<= main_~n~0 (+ main_~j~0 2)) (<= 3 main_~k~0))} is VALID [2022-04-27 16:17:17,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {432#true} [87] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:17,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {432#true} [84] 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[] {432#true} is VALID [2022-04-27 16:17:17,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {432#true} [82] __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] {432#true} is VALID [2022-04-27 16:17:17,388 INFO L272 TraceCheckUtils]: 10: Hoare triple {585#(or (<= main_~n~0 (+ main_~j~0 2)) (<= 3 main_~k~0))} [80] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {432#true} is VALID [2022-04-27 16:17:17,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {585#(or (<= main_~n~0 (+ main_~j~0 2)) (<= 3 main_~k~0))} [78] L34-2-->L35: Formula: (< v_main_~j~0_2 v_main_~n~0_2) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {585#(or (<= main_~n~0 (+ main_~j~0 2)) (<= 3 main_~k~0))} is VALID [2022-04-27 16:17:17,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {607#(or (<= main_~n~0 2) (<= 3 main_~k~0))} [75] L29-3-->L34-2: Formula: (= v_main_~j~0_5 0) InVars {} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0] {585#(or (<= main_~n~0 (+ main_~j~0 2)) (<= 3 main_~k~0))} is VALID [2022-04-27 16:17:17,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {611#(or (<= main_~n~0 2) (<= 3 main_~k~0) (< main_~i~0 main_~n~0))} [73] L29-2-->L29-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {607#(or (<= main_~n~0 2) (<= 3 main_~k~0))} is VALID [2022-04-27 16:17:17,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {615#(and (or (<= 3 main_~k~0) (<= main_~i~0 2)) (or (<= 2 main_~k~0) (<= main_~i~0 main_~k~0)))} [74] L29-2-->L29-2: Formula: (or (and (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~k~0_5 v_main_~k~0_4) (<= v_main_~n~0_4 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~i~0_2)) (and (= (+ v_main_~i~0_3 v_main_~k~0_4) (+ v_main_~i~0_2 v_main_~k~0_5)) (< v_main_~i~0_3 v_main_~i~0_2) (< v_main_~i~0_2 (+ v_main_~n~0_4 1)))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_4, main_#t~post3=|v_main_#t~post3_3|, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2, main_#t~post3] {611#(or (<= main_~n~0 2) (<= 3 main_~k~0) (< main_~i~0 main_~n~0))} is VALID [2022-04-27 16:17:17,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#true} [70] mainENTRY-->L29-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (= v_main_~k~0_6 0) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {615#(and (or (<= 3 main_~k~0) (<= main_~i~0 2)) (or (<= 2 main_~k~0) (<= main_~i~0 main_~k~0)))} is VALID [2022-04-27 16:17:17,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {432#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:17,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {432#true} {432#true} [88] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:17,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {432#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:17,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#true} [68] 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] {432#true} is VALID [2022-04-27 16:17:17,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {432#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#true} is VALID [2022-04-27 16:17:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 16:17:17,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5204771] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:17:17,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:17:17,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2022-04-27 16:17:17,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120846004] [2022-04-27 16:17:17,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:17:17,392 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 23 states have internal predecessors, (38), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 28 [2022-04-27 16:17:17,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:17:17,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 1.52) internal successors, (38), 23 states have internal predecessors, (38), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 16:17:17,434 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-27 16:17:17,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 16:17:17,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:17:17,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 16:17:17,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2022-04-27 16:17:17,436 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 26 states, 25 states have (on average 1.52) internal successors, (38), 23 states have internal predecessors, (38), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 16:17:18,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:18,332 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-27 16:17:18,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 16:17:18,333 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 23 states have internal predecessors, (38), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 28 [2022-04-27 16:17:18,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:17:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.52) internal successors, (38), 23 states have internal predecessors, (38), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 16:17:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-27 16:17:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.52) internal successors, (38), 23 states have internal predecessors, (38), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 16:17:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-27 16:17:18,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 30 transitions. [2022-04-27 16:17:18,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:17:18,358 INFO L225 Difference]: With dead ends: 29 [2022-04-27 16:17:18,358 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:17:18,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=248, Invalid=1234, Unknown=0, NotChecked=0, Total=1482 [2022-04-27 16:17:18,360 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 16:17:18,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 83 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 16:17:18,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:17:18,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:17:18,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:17:18,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:17:18,360 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:17:18,360 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:17:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:18,361 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:17:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:17:18,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:17:18,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:17:18,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:17:18,361 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:17:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:17:18,361 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:17:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:17:18,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:17:18,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:17:18,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:17:18,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:17:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:17:18,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:17:18,361 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-27 16:17:18,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:17:18,361 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:17:18,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 23 states have internal predecessors, (38), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 16:17:18,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:17:18,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:17:18,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:17:18,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 16:17:18,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 16:17:18,566 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 16:17:18,567 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:17:18,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:17:18 BasicIcfg [2022-04-27 16:17:18,569 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:17:18,569 INFO L158 Benchmark]: Toolchain (without parser) took 8842.12ms. Allocated memory was 177.2MB in the beginning and 238.0MB in the end (delta: 60.8MB). Free memory was 121.8MB in the beginning and 171.0MB in the end (delta: -49.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 16:17:18,570 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:17:18,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.12ms. Allocated memory is still 177.2MB. Free memory was 121.5MB in the beginning and 147.2MB in the end (delta: -25.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 16:17:18,570 INFO L158 Benchmark]: Boogie Preprocessor took 19.56ms. Allocated memory is still 177.2MB. Free memory was 147.2MB in the beginning and 146.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 16:17:18,570 INFO L158 Benchmark]: RCFGBuilder took 327.52ms. Allocated memory is still 177.2MB. Free memory was 146.1MB in the beginning and 134.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 16:17:18,570 INFO L158 Benchmark]: IcfgTransformer took 2732.60ms. Allocated memory is still 177.2MB. Free memory was 134.6MB in the beginning and 114.7MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-04-27 16:17:18,570 INFO L158 Benchmark]: TraceAbstraction took 5555.68ms. Allocated memory was 177.2MB in the beginning and 238.0MB in the end (delta: 60.8MB). Free memory was 114.2MB in the beginning and 171.0MB in the end (delta: -56.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-04-27 16:17:18,571 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 * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.12ms. Allocated memory is still 177.2MB. Free memory was 121.5MB in the beginning and 147.2MB in the end (delta: -25.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.56ms. Allocated memory is still 177.2MB. Free memory was 147.2MB in the beginning and 146.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 327.52ms. Allocated memory is still 177.2MB. Free memory was 146.1MB in the beginning and 134.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 2732.60ms. Allocated memory is still 177.2MB. Free memory was 134.6MB in the beginning and 114.7MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 5555.68ms. Allocated memory was 177.2MB in the beginning and 238.0MB in the end (delta: 60.8MB). Free memory was 114.2MB in the beginning and 171.0MB in the end (delta: -56.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 405 IncrementalHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 58 mSDtfsCounter, 405 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=3, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 706 SizeOfPredicates, 18 NumberOfNonLiveVariables, 142 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 25/51 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 16:17:18,600 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...