/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-zilu/benchmark37_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 20:08:07,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 20:08:07,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 20:08:07,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 20:08:07,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 20:08:07,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 20:08:07,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 20:08:07,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 20:08:07,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 20:08:07,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 20:08:07,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 20:08:07,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 20:08:07,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 20:08:07,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 20:08:07,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 20:08:07,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 20:08:07,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 20:08:07,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 20:08:07,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 20:08:07,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 20:08:07,723 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 20:08:07,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 20:08:07,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 20:08:07,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 20:08:07,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 20:08:07,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 20:08:07,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 20:08:07,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 20:08:07,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 20:08:07,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 20:08:07,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 20:08:07,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 20:08:07,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 20:08:07,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 20:08:07,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 20:08:07,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 20:08:07,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 20:08:07,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 20:08:07,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 20:08:07,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 20:08:07,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 20:08:07,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 20:08:07,742 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 20:08:07,751 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 20:08:07,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 20:08:07,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 20:08:07,752 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 20:08:07,752 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 20:08:07,752 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 20:08:07,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 20:08:07,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 20:08:07,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 20:08:07,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 20:08:07,753 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 20:08:07,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 20:08:07,753 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 20:08:07,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 20:08:07,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 20:08:07,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 20:08:07,754 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 20:08:07,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 20:08:07,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:08:07,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 20:08:07,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 20:08:07,755 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 20:08:07,755 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-14 20:08:07,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 20:08:07,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 20:08:07,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 20:08:07,967 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 20:08:07,971 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 20:08:07,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark37_conjunctive.i [2022-04-14 20:08:08,021 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c816b0e/55a135c7f7a5454682189a8b496abe39/FLAG670e69f1f [2022-04-14 20:08:08,367 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 20:08:08,367 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark37_conjunctive.i [2022-04-14 20:08:08,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c816b0e/55a135c7f7a5454682189a8b496abe39/FLAG670e69f1f [2022-04-14 20:08:08,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c816b0e/55a135c7f7a5454682189a8b496abe39 [2022-04-14 20:08:08,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 20:08:08,387 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 20:08:08,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 20:08:08,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 20:08:08,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 20:08:08,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:08:08" (1/1) ... [2022-04-14 20:08:08,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac08a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:08, skipping insertion in model container [2022-04-14 20:08:08,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:08:08" (1/1) ... [2022-04-14 20:08:08,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 20:08:08,407 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 20:08:08,562 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-zilu/benchmark37_conjunctive.i[873,886] [2022-04-14 20:08:08,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:08:08,585 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 20:08:08,594 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-zilu/benchmark37_conjunctive.i[873,886] [2022-04-14 20:08:08,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:08:08,608 INFO L208 MainTranslator]: Completed translation [2022-04-14 20:08:08,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:08 WrapperNode [2022-04-14 20:08:08,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 20:08:08,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 20:08:08,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 20:08:08,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 20:08:08,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:08" (1/1) ... [2022-04-14 20:08:08,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:08" (1/1) ... [2022-04-14 20:08:08,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:08" (1/1) ... [2022-04-14 20:08:08,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:08" (1/1) ... [2022-04-14 20:08:08,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:08" (1/1) ... [2022-04-14 20:08:08,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:08" (1/1) ... [2022-04-14 20:08:08,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:08" (1/1) ... [2022-04-14 20:08:08,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 20:08:08,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 20:08:08,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 20:08:08,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 20:08:08,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:08" (1/1) ... [2022-04-14 20:08:08,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:08:08,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:08:08,663 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-14 20:08:08,677 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-14 20:08:08,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 20:08:08,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 20:08:08,697 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 20:08:08,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 20:08:08,697 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 20:08:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 20:08:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-14 20:08:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-14 20:08:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 20:08:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 20:08:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 20:08:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-14 20:08:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 20:08:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 20:08:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 20:08:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 20:08:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 20:08:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 20:08:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 20:08:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 20:08:08,749 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 20:08:08,751 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 20:08:08,856 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 20:08:08,860 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 20:08:08,860 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 20:08:08,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:08:08 BoogieIcfgContainer [2022-04-14 20:08:08,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 20:08:08,862 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 20:08:08,862 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 20:08:08,863 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 20:08:08,865 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:08:08" (1/1) ... [2022-04-14 20:08:08,866 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 20:08:09,175 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-14 20:08:09,176 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~x~0_3 (+ v_main_~x~0_2 1)) (< 0 v_main_~x~0_3) (= (+ v_main_~y~0_1 1) v_main_~y~0_2)) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] to Formula: (or (and (= v_main_~y~0_2 v_main_~y~0_1) (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (not (< 0 v_main_~x~0_3)) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (= v_main_~x~0_3 v_main_~x~0_2)) (and (< 0 (+ v_main_~x~0_2 1)) (= (+ v_main_~x~0_2 v_main_~y~0_2) (+ v_main_~x~0_3 v_main_~y~0_1)) (< v_main_~x~0_2 v_main_~x~0_3))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_2, main_#t~post3=|v_main_#t~post3_3|, main_~x~0=v_main_~x~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] [2022-04-14 20:08:09,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:08:09 BasicIcfg [2022-04-14 20:08:09,180 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 20:08:09,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 20:08:09,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 20:08:09,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 20:08:09,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 08:08:08" (1/4) ... [2022-04-14 20:08:09,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9dbc230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:08:09, skipping insertion in model container [2022-04-14 20:08:09,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:08" (2/4) ... [2022-04-14 20:08:09,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9dbc230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:08:09, skipping insertion in model container [2022-04-14 20:08:09,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:08:08" (3/4) ... [2022-04-14 20:08:09,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9dbc230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:08:09, skipping insertion in model container [2022-04-14 20:08:09,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:08:09" (4/4) ... [2022-04-14 20:08:09,189 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark37_conjunctive.iJordan [2022-04-14 20:08:09,193 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 20:08:09,193 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 20:08:09,225 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 20:08:09,231 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 20:08:09,231 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 20:08:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-14 20:08:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 20:08:09,248 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:08:09,248 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:08:09,249 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:08:09,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:08:09,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1809217115, now seen corresponding path program 1 times [2022-04-14 20:08:09,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:08:09,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955392547] [2022-04-14 20:08:09,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:09,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:08:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:09,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:08:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:09,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {23#true} is VALID [2022-04-14 20:08:09,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:08:09,390 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:08:09,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:08:09,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {23#true} is VALID [2022-04-14 20:08:09,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:08:09,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:08:09,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:08:09,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {23#true} is VALID [2022-04-14 20:08:09,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [55] L22-->L23-2: Formula: (and (<= 0 v_main_~x~0_6) (= v_main_~x~0_6 v_main_~y~0_6)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:08:09,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#true} [57] L23-2-->L23-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-14 20:08:09,394 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~y~0_7) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {24#false} is VALID [2022-04-14 20:08:09,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [62] __VERIFIER_assertENTRY-->L15: 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] {24#false} is VALID [2022-04-14 20:08:09,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [63] L15-->L16: 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[] {24#false} is VALID [2022-04-14 20:08:09,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-14 20:08:09,395 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-14 20:08:09,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:08:09,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955392547] [2022-04-14 20:08:09,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955392547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:08:09,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:08:09,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 20:08:09,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918482575] [2022-04-14 20:08:09,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:08:09,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-14 20:08:09,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:08:09,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 20:08:09,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:08:09,419 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 20:08:09,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:08:09,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 20:08:09,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 20:08:09,444 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 20:08:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:09,495 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-14 20:08:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 20:08:09,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-14 20:08:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:08:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 20:08:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-14 20:08:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 20:08:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-14 20:08:09,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-04-14 20:08:09,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:08:09,537 INFO L225 Difference]: With dead ends: 20 [2022-04-14 20:08:09,537 INFO L226 Difference]: Without dead ends: 13 [2022-04-14 20:08:09,538 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 20:08:09,541 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 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-14 20:08:09,542 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:08:09,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-14 20:08:09,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-14 20:08:09,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:08:09,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:08:09,563 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:08:09,563 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:08:09,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:09,566 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-14 20:08:09,567 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-14 20:08:09,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:09,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:09,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-14 20:08:09,568 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-14 20:08:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:09,573 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-14 20:08:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-14 20:08:09,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:09,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:09,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:08:09,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:08:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:08:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-14 20:08:09,575 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 12 [2022-04-14 20:08:09,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:08:09,576 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-14 20:08:09,577 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 20:08:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-14 20:08:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 20:08:09,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:08:09,583 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:08:09,583 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 20:08:09,584 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:08:09,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:08:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1810140636, now seen corresponding path program 1 times [2022-04-14 20:08:09,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:08:09,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568255449] [2022-04-14 20:08:09,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:09,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:08:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:09,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:08:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:09,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {98#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {90#true} is VALID [2022-04-14 20:08:09,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:08:09,679 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:08:09,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {90#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:08:09,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {98#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {90#true} is VALID [2022-04-14 20:08:09,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {90#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:08:09,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:08:09,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {90#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:08:09,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {90#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {90#true} is VALID [2022-04-14 20:08:09,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {90#true} [55] L22-->L23-2: Formula: (and (<= 0 v_main_~x~0_6) (= v_main_~x~0_6 v_main_~y~0_6)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {95#(<= 0 main_~y~0)} is VALID [2022-04-14 20:08:09,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {95#(<= 0 main_~y~0)} [58] L23-2-->L23-3: Formula: (not (< 0 v_main_~x~0_1)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {95#(<= 0 main_~y~0)} is VALID [2022-04-14 20:08:09,684 INFO L272 TraceCheckUtils]: 8: Hoare triple {95#(<= 0 main_~y~0)} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~y~0_7) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {96#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 20:08:09,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {96#(not (= |__VERIFIER_assert_#in~cond| 0))} [62] __VERIFIER_assertENTRY-->L15: 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] {97#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 20:08:09,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {97#(not (= __VERIFIER_assert_~cond 0))} [63] L15-->L16: 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[] {91#false} is VALID [2022-04-14 20:08:09,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {91#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-14 20:08:09,685 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-14 20:08:09,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:08:09,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568255449] [2022-04-14 20:08:09,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568255449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:08:09,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:08:09,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 20:08:09,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171665364] [2022-04-14 20:08:09,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:08:09,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-14 20:08:09,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:08:09,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-14 20:08:09,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:08:09,698 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 20:08:09,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:08:09,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 20:08:09,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 20:08:09,700 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-14 20:08:09,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:09,788 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-14 20:08:09,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 20:08:09,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-14 20:08:09,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:08:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-14 20:08:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-14 20:08:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-14 20:08:09,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-14 20:08:09,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2022-04-14 20:08:09,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:08:09,833 INFO L225 Difference]: With dead ends: 17 [2022-04-14 20:08:09,834 INFO L226 Difference]: Without dead ends: 14 [2022-04-14 20:08:09,834 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-14 20:08:09,835 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:08:09,835 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 28 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:08:09,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-14 20:08:09,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-14 20:08:09,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:08:09,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:08:09,837 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:08:09,837 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:08:09,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:09,838 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-14 20:08:09,838 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-14 20:08:09,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:09,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:09,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-14 20:08:09,839 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-14 20:08:09,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:09,839 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-14 20:08:09,839 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-14 20:08:09,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:09,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:09,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:08:09,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:08:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:08:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-14 20:08:09,841 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-14 20:08:09,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:08:09,841 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-14 20:08:09,841 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-14 20:08:09,841 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-14 20:08:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-14 20:08:09,841 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:08:09,842 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:08:09,842 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 20:08:09,842 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:08:09,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:08:09,842 INFO L85 PathProgramCache]: Analyzing trace with hash 306506437, now seen corresponding path program 1 times [2022-04-14 20:08:09,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:08:09,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991105256] [2022-04-14 20:08:09,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:09,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:08:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:09,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:08:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:09,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {166#true} is VALID [2022-04-14 20:08:09,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:08:09,920 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {166#true} {166#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:08:09,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {166#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:08:09,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {166#true} is VALID [2022-04-14 20:08:09,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {166#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:08:09,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166#true} {166#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:08:09,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {166#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:08:09,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {166#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {166#true} is VALID [2022-04-14 20:08:09,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#true} [55] L22-->L23-2: Formula: (and (<= 0 v_main_~x~0_6) (= v_main_~x~0_6 v_main_~y~0_6)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {171#(and (<= 0 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-14 20:08:09,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {171#(and (<= 0 main_~y~0) (<= main_~x~0 main_~y~0))} [59] L23-2-->L23-2: Formula: (or (and (= v_main_~y~0_2 v_main_~y~0_1) (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (not (< 0 v_main_~x~0_3)) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (= v_main_~x~0_3 v_main_~x~0_2)) (and (< 0 (+ v_main_~x~0_2 1)) (= (+ v_main_~x~0_2 v_main_~y~0_2) (+ v_main_~x~0_3 v_main_~y~0_1)) (< v_main_~x~0_2 v_main_~x~0_3))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_2, main_#t~post3=|v_main_#t~post3_3|, main_~x~0=v_main_~x~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {172#(<= 0 main_~y~0)} is VALID [2022-04-14 20:08:09,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {172#(<= 0 main_~y~0)} [58] L23-2-->L23-3: Formula: (not (< 0 v_main_~x~0_1)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {172#(<= 0 main_~y~0)} is VALID [2022-04-14 20:08:09,926 INFO L272 TraceCheckUtils]: 9: Hoare triple {172#(<= 0 main_~y~0)} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~y~0_7) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {173#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 20:08:09,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {173#(not (= |__VERIFIER_assert_#in~cond| 0))} [62] __VERIFIER_assertENTRY-->L15: 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] {174#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 20:08:09,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {174#(not (= __VERIFIER_assert_~cond 0))} [63] L15-->L16: 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[] {167#false} is VALID [2022-04-14 20:08:09,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {167#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#false} is VALID [2022-04-14 20:08:09,927 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-14 20:08:09,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:08:09,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991105256] [2022-04-14 20:08:09,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991105256] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 20:08:09,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947315173] [2022-04-14 20:08:09,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:09,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:08:09,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:08:09,932 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-14 20:08:09,939 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-14 20:08:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:09,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-14 20:08:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:09,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:08:10,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {166#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:08:10,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#true} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {166#true} is VALID [2022-04-14 20:08:10,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {166#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:08:10,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166#true} {166#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:08:10,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {166#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:08:10,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {166#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {166#true} is VALID [2022-04-14 20:08:10,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#true} [55] L22-->L23-2: Formula: (and (<= 0 v_main_~x~0_6) (= v_main_~x~0_6 v_main_~y~0_6)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {197#(and (<= main_~x~0 main_~y~0) (<= 0 main_~x~0))} is VALID [2022-04-14 20:08:10,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {197#(and (<= main_~x~0 main_~y~0) (<= 0 main_~x~0))} [59] L23-2-->L23-2: Formula: (or (and (= v_main_~y~0_2 v_main_~y~0_1) (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (not (< 0 v_main_~x~0_3)) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (= v_main_~x~0_3 v_main_~x~0_2)) (and (< 0 (+ v_main_~x~0_2 1)) (= (+ v_main_~x~0_2 v_main_~y~0_2) (+ v_main_~x~0_3 v_main_~y~0_1)) (< v_main_~x~0_2 v_main_~x~0_3))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_2, main_#t~post3=|v_main_#t~post3_3|, main_~x~0=v_main_~x~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {172#(<= 0 main_~y~0)} is VALID [2022-04-14 20:08:10,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {172#(<= 0 main_~y~0)} [58] L23-2-->L23-3: Formula: (not (< 0 v_main_~x~0_1)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {172#(<= 0 main_~y~0)} is VALID [2022-04-14 20:08:10,310 INFO L272 TraceCheckUtils]: 9: Hoare triple {172#(<= 0 main_~y~0)} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~y~0_7) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {207#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:08:10,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {207#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: 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] {211#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:08:10,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {211#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: 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[] {167#false} is VALID [2022-04-14 20:08:10,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {167#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#false} is VALID [2022-04-14 20:08:10,312 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-14 20:08:10,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:08:10,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {167#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#false} is VALID [2022-04-14 20:08:10,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {211#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: 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[] {167#false} is VALID [2022-04-14 20:08:10,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {207#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: 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] {211#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:08:10,452 INFO L272 TraceCheckUtils]: 9: Hoare triple {172#(<= 0 main_~y~0)} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~y~0_7) 1 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {207#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:08:10,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {172#(<= 0 main_~y~0)} [58] L23-2-->L23-3: Formula: (not (< 0 v_main_~x~0_1)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {172#(<= 0 main_~y~0)} is VALID [2022-04-14 20:08:10,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {171#(and (<= 0 main_~y~0) (<= main_~x~0 main_~y~0))} [59] L23-2-->L23-2: Formula: (or (and (= v_main_~y~0_2 v_main_~y~0_1) (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (not (< 0 v_main_~x~0_3)) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (= v_main_~x~0_3 v_main_~x~0_2)) (and (< 0 (+ v_main_~x~0_2 1)) (= (+ v_main_~x~0_2 v_main_~y~0_2) (+ v_main_~x~0_3 v_main_~y~0_1)) (< v_main_~x~0_2 v_main_~x~0_3))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_2, main_#t~post3=|v_main_#t~post3_3|, main_~x~0=v_main_~x~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {172#(<= 0 main_~y~0)} is VALID [2022-04-14 20:08:10,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#true} [55] L22-->L23-2: Formula: (and (<= 0 v_main_~x~0_6) (= v_main_~x~0_6 v_main_~y~0_6)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {171#(and (<= 0 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-14 20:08:10,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {166#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {166#true} is VALID [2022-04-14 20:08:10,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {166#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:08:10,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {166#true} {166#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:08:10,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {166#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:08:10,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#true} [50] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {166#true} is VALID [2022-04-14 20:08:10,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {166#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#true} is VALID [2022-04-14 20:08:10,454 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-14 20:08:10,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947315173] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 20:08:10,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 20:08:10,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-14 20:08:10,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202972216] [2022-04-14 20:08:10,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 20:08:10,455 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 7 states have internal predecessors, (14), 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 13 [2022-04-14 20:08:10,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:08:10,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.4) internal successors, (14), 7 states have internal predecessors, (14), 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-14 20:08:10,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:08:10,467 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 20:08:10,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:08:10,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 20:08:10,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-14 20:08:10,468 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 7 states have internal predecessors, (14), 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-14 20:08:10,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:10,555 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-14 20:08:10,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 20:08:10,556 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 7 states have internal predecessors, (14), 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 13 [2022-04-14 20:08:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:08:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 7 states have internal predecessors, (14), 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-14 20:08:10,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2022-04-14 20:08:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 7 states have internal predecessors, (14), 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-14 20:08:10,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2022-04-14 20:08:10,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 12 transitions. [2022-04-14 20:08:10,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:08:10,566 INFO L225 Difference]: With dead ends: 12 [2022-04-14 20:08:10,566 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 20:08:10,567 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-14 20:08:10,569 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:08:10,571 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 40 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:08:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 20:08:10,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 20:08:10,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:08:10,572 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-14 20:08:10,572 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-14 20:08:10,572 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-14 20:08:10,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:10,572 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:08:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:08:10,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:10,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:10,572 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-14 20:08:10,573 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-14 20:08:10,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:10,573 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:08:10,573 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:08:10,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:10,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:10,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:08:10,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:08:10,573 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-14 20:08:10,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 20:08:10,573 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-14 20:08:10,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:08:10,574 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 20:08:10,575 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 7 states have internal predecessors, (14), 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-14 20:08:10,575 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:08:10,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:10,577 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 20:08:10,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-14 20:08:10,791 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:08:10,793 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-14 20:08:10,794 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 20:08:10,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:08:10 BasicIcfg [2022-04-14 20:08:10,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 20:08:10,797 INFO L158 Benchmark]: Toolchain (without parser) took 2409.72ms. Allocated memory was 199.2MB in the beginning and 243.3MB in the end (delta: 44.0MB). Free memory was 149.8MB in the beginning and 150.7MB in the end (delta: -912.8kB). Peak memory consumption was 43.1MB. Max. memory is 8.0GB. [2022-04-14 20:08:10,797 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 199.2MB. Free memory is still 166.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 20:08:10,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.80ms. Allocated memory is still 199.2MB. Free memory was 149.5MB in the beginning and 175.0MB in the end (delta: -25.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-14 20:08:10,797 INFO L158 Benchmark]: Boogie Preprocessor took 30.49ms. Allocated memory is still 199.2MB. Free memory was 175.0MB in the beginning and 173.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 20:08:10,797 INFO L158 Benchmark]: RCFGBuilder took 220.78ms. Allocated memory is still 199.2MB. Free memory was 173.4MB in the beginning and 162.9MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-14 20:08:10,798 INFO L158 Benchmark]: IcfgTransformer took 318.70ms. Allocated memory is still 199.2MB. Free memory was 162.9MB in the beginning and 144.6MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-04-14 20:08:10,798 INFO L158 Benchmark]: TraceAbstraction took 1614.40ms. Allocated memory was 199.2MB in the beginning and 243.3MB in the end (delta: 44.0MB). Free memory was 144.0MB in the beginning and 150.7MB in the end (delta: -6.7MB). Peak memory consumption was 38.4MB. Max. memory is 8.0GB. [2022-04-14 20:08:10,801 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.09ms. Allocated memory is still 199.2MB. Free memory is still 166.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.80ms. Allocated memory is still 199.2MB. Free memory was 149.5MB in the beginning and 175.0MB in the end (delta: -25.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.49ms. Allocated memory is still 199.2MB. Free memory was 175.0MB in the beginning and 173.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 220.78ms. Allocated memory is still 199.2MB. Free memory was 173.4MB in the beginning and 162.9MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 318.70ms. Allocated memory is still 199.2MB. Free memory was 162.9MB in the beginning and 144.6MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 1614.40ms. Allocated memory was 199.2MB in the beginning and 243.3MB in the end (delta: 44.0MB). Free memory was 144.0MB in the beginning and 150.7MB in the end (delta: -6.7MB). Peak memory consumption was 38.4MB. 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: 16]: 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, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 39 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 15, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 4 NumberOfNonLiveVariables, 57 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 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-14 20:08:10,830 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...