/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/benchmark43_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 20:08:08,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 20:08:08,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 20:08:08,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 20:08:08,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 20:08:08,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 20:08:08,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 20:08:08,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 20:08:08,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 20:08:08,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 20:08:08,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 20:08:08,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 20:08:08,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 20:08:08,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 20:08:08,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 20:08:08,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 20:08:08,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 20:08:08,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 20:08:08,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 20:08:08,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 20:08:08,192 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 20:08:08,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 20:08:08,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 20:08:08,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 20:08:08,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 20:08:08,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 20:08:08,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 20:08:08,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 20:08:08,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 20:08:08,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 20:08:08,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 20:08:08,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 20:08:08,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 20:08:08,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 20:08:08,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 20:08:08,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 20:08:08,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 20:08:08,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 20:08:08,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 20:08:08,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 20:08:08,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 20:08:08,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 20:08:08,212 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:08,221 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 20:08:08,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 20:08:08,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 20:08:08,223 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 20:08:08,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 20:08:08,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 20:08:08,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 20:08:08,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 20:08:08,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 20:08:08,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 20:08:08,225 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 20:08:08,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 20:08:08,225 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 20:08:08,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 20:08:08,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 20:08:08,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 20:08:08,226 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 20:08:08,226 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 20:08:08,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:08:08,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 20:08:08,227 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 20:08:08,227 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 20:08:08,228 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:08,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 20:08:08,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 20:08:08,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 20:08:08,499 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 20:08:08,500 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 20:08:08,501 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark43_conjunctive.i [2022-04-14 20:08:08,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b2b97de/e0b5b941e02342908e595dac986e2561/FLAG3f88e930e [2022-04-14 20:08:08,926 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 20:08:08,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark43_conjunctive.i [2022-04-14 20:08:08,931 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b2b97de/e0b5b941e02342908e595dac986e2561/FLAG3f88e930e [2022-04-14 20:08:09,352 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b2b97de/e0b5b941e02342908e595dac986e2561 [2022-04-14 20:08:09,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 20:08:09,355 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 20:08:09,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 20:08:09,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 20:08:09,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 20:08:09,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:08:09" (1/1) ... [2022-04-14 20:08:09,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c3735eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:09, skipping insertion in model container [2022-04-14 20:08:09,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:08:09" (1/1) ... [2022-04-14 20:08:09,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 20:08:09,381 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 20:08:09,536 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/benchmark43_conjunctive.i[873,886] [2022-04-14 20:08:09,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:08:09,553 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 20:08:09,567 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/benchmark43_conjunctive.i[873,886] [2022-04-14 20:08:09,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:08:09,597 INFO L208 MainTranslator]: Completed translation [2022-04-14 20:08:09,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:09 WrapperNode [2022-04-14 20:08:09,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 20:08:09,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 20:08:09,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 20:08:09,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 20:08:09,610 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:09" (1/1) ... [2022-04-14 20:08:09,610 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:09" (1/1) ... [2022-04-14 20:08:09,617 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:09" (1/1) ... [2022-04-14 20:08:09,617 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:09" (1/1) ... [2022-04-14 20:08:09,628 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:09" (1/1) ... [2022-04-14 20:08:09,633 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:09" (1/1) ... [2022-04-14 20:08:09,635 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:09" (1/1) ... [2022-04-14 20:08:09,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 20:08:09,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 20:08:09,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 20:08:09,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 20:08:09,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:09" (1/1) ... [2022-04-14 20:08:09,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:08:09,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:08:09,668 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:09,679 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:09,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 20:08:09,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 20:08:09,700 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 20:08:09,700 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 20:08:09,700 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 20:08:09,700 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 20:08:09,701 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-14 20:08:09,701 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-14 20:08:09,701 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 20:08:09,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 20:08:09,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 20:08:09,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-14 20:08:09,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 20:08:09,702 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 20:08:09,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 20:08:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 20:08:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 20:08:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 20:08:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 20:08:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 20:08:09,763 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 20:08:09,765 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 20:08:09,939 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 20:08:09,945 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 20:08:09,945 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 20:08:09,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:08:09 BoogieIcfgContainer [2022-04-14 20:08:09,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 20:08:09,948 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 20:08:09,948 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 20:08:09,949 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 20:08:09,951 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:08:09" (1/1) ... [2022-04-14 20:08:09,953 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 20:08:10,696 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-14 20:08:10,697 INFO L91 elerationTransformer]: Accelerated Formula: (and (< v_main_~x~0_3 100) (= (+ v_main_~x~0_3 1) v_main_~x~0_2) (= v_main_~y~0_2 (+ v_main_~y~0_3 1)) (< v_main_~y~0_3 100)) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0] to Formula: (or (and (or (not (< v_main_~x~0_3 100)) (not (< v_main_~y~0_3 100))) (= v_main_~x~0_3 v_main_~x~0_2) (= v_main_~y~0_3 v_main_~y~0_2)) (let ((.cse0 (+ v_main_~x~0_3 v_main_~y~0_2))) (and (< .cse0 (+ 101 v_main_~y~0_3)) (< v_main_~y~0_3 v_main_~y~0_2) (= .cse0 (+ v_main_~x~0_2 v_main_~y~0_3)) (< v_main_~y~0_2 101)))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0] [2022-04-14 20:08:10,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:08:10 BasicIcfg [2022-04-14 20:08:10,705 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 20:08:10,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 20:08:10,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 20:08:10,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 20:08:10,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 08:08:09" (1/4) ... [2022-04-14 20:08:10,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166dc9cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:08:10, skipping insertion in model container [2022-04-14 20:08:10,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:09" (2/4) ... [2022-04-14 20:08:10,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166dc9cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:08:10, skipping insertion in model container [2022-04-14 20:08:10,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:08:09" (3/4) ... [2022-04-14 20:08:10,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166dc9cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:08:10, skipping insertion in model container [2022-04-14 20:08:10,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:08:10" (4/4) ... [2022-04-14 20:08:10,714 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark43_conjunctive.iJordan [2022-04-14 20:08:10,719 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 20:08:10,720 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 20:08:10,758 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 20:08:10,766 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:10,766 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 20:08:10,803 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:10,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 20:08:10,809 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:08:10,810 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:08:10,810 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:08:10,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:08:10,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1809217115, now seen corresponding path program 1 times [2022-04-14 20:08:10,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:08:10,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668685644] [2022-04-14 20:08:10,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:10,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:08:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:10,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:08:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:10,981 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:10,981 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:10,981 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:10,983 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:10,984 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:10,984 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:10,984 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:10,985 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:10,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~y~0_4 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {23#true} is VALID [2022-04-14 20:08:10,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [55] L22-->L23-2: Formula: (and (< v_main_~x~0_7 100) (< v_main_~y~0_7 100)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:08:10,986 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:10,987 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~x~0_8 100) (= v_main_~y~0_8 100)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {24#false} is VALID [2022-04-14 20:08:10,987 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:10,987 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:10,988 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:10,988 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:10,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:08:10,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668685644] [2022-04-14 20:08:10,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668685644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:08:10,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:08:10,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 20:08:10,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497968828] [2022-04-14 20:08:10,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:08:11,004 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:11,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:08:11,008 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:11,023 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:11,023 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 20:08:11,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:08:11,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 20:08:11,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 20:08:11,057 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:11,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:11,113 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-14 20:08:11,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 20:08:11,114 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:11,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:08:11,115 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:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-14 20:08:11,123 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:11,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-14 20:08:11,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-04-14 20:08:11,154 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:11,161 INFO L225 Difference]: With dead ends: 20 [2022-04-14 20:08:11,161 INFO L226 Difference]: Without dead ends: 13 [2022-04-14 20:08:11,162 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:11,165 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:11,166 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:11,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-14 20:08:11,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-14 20:08:11,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:08:11,189 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:11,189 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:11,190 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:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:11,192 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-14 20:08:11,192 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-14 20:08:11,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:11,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:11,193 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:11,193 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:11,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:11,195 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-14 20:08:11,195 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-14 20:08:11,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:11,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:11,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:08:11,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:08:11,196 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:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-14 20:08:11,198 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 12 [2022-04-14 20:08:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:08:11,199 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-14 20:08:11,199 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:11,199 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-14 20:08:11,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 20:08:11,200 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:08:11,200 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:08:11,200 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 20:08:11,201 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:08:11,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:08:11,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1810140636, now seen corresponding path program 1 times [2022-04-14 20:08:11,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:08:11,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210855951] [2022-04-14 20:08:11,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:11,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:08:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:11,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:08:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:11,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {96#(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:11,255 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:11,255 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:11,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {90#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {96#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:08:11,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#(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:11,256 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:11,257 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:11,257 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:11,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {90#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~y~0_4 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {90#true} is VALID [2022-04-14 20:08:11,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {90#true} [55] L22-->L23-2: Formula: (and (< v_main_~x~0_7 100) (< v_main_~y~0_7 100)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} AuxVars[] AssignedVars[] {95#(and (<= main_~x~0 99) (<= main_~y~0 99))} is VALID [2022-04-14 20:08:11,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {95#(and (<= main_~x~0 99) (<= main_~y~0 99))} [58] L23-2-->L23-3: Formula: (or (not (< v_main_~y~0_1 100)) (not (< v_main_~x~0_1 100))) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-14 20:08:11,259 INFO L272 TraceCheckUtils]: 8: Hoare triple {91#false} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~x~0_8 100) (= v_main_~y~0_8 100)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {91#false} is VALID [2022-04-14 20:08:11,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {91#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] {91#false} is VALID [2022-04-14 20:08:11,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {91#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[] {91#false} is VALID [2022-04-14 20:08:11,259 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:11,260 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:11,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:08:11,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210855951] [2022-04-14 20:08:11,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210855951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:08:11,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:08:11,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 20:08:11,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400480462] [2022-04-14 20:08:11,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:08:11,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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:11,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:08:11,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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:11,280 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:11,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 20:08:11,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:08:11,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 20:08:11,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 20:08:11,283 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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:11,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:11,344 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-14 20:08:11,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 20:08:11,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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:11,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:08:11,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-04-14 20:08:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-04-14 20:08:11,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2022-04-14 20:08:11,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:08:11,371 INFO L225 Difference]: With dead ends: 14 [2022-04-14 20:08:11,371 INFO L226 Difference]: Without dead ends: 14 [2022-04-14 20:08:11,374 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-14 20:08:11,376 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:08:11,377 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:08:11,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-14 20:08:11,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-14 20:08:11,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:08:11,381 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:11,381 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:11,381 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:11,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:11,383 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-14 20:08:11,383 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-14 20:08:11,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:11,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:11,384 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:11,385 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:11,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:11,386 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-14 20:08:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-14 20:08:11,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:11,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:11,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:08:11,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:08:11,388 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:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-14 20:08:11,389 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-14 20:08:11,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:08:11,389 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-14 20:08:11,389 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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:11,389 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-14 20:08:11,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-14 20:08:11,390 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:08:11,390 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:08:11,390 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 20:08:11,390 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:08:11,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:08:11,391 INFO L85 PathProgramCache]: Analyzing trace with hash 306506437, now seen corresponding path program 1 times [2022-04-14 20:08:11,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:08:11,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219750818] [2022-04-14 20:08:11,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:11,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:08:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:11,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:08:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:11,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {167#(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] {157#true} is VALID [2022-04-14 20:08:11,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:08:11,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {157#true} {157#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:08:11,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {157#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:08:11,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {167#(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] {157#true} is VALID [2022-04-14 20:08:11,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:08:11,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:08:11,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {157#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:08:11,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~y~0_4 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {157#true} is VALID [2022-04-14 20:08:11,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {157#true} [55] L22-->L23-2: Formula: (and (< v_main_~x~0_7 100) (< v_main_~y~0_7 100)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} AuxVars[] AssignedVars[] {162#(and (<= main_~x~0 99) (<= main_~y~0 99))} is VALID [2022-04-14 20:08:11,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {162#(and (<= main_~x~0 99) (<= main_~y~0 99))} [59] L23-2-->L23-2: Formula: (or (and (or (not (< v_main_~x~0_3 100)) (not (< v_main_~y~0_3 100))) (= v_main_~x~0_3 v_main_~x~0_2) (= v_main_~y~0_3 v_main_~y~0_2)) (let ((.cse0 (+ v_main_~x~0_3 v_main_~y~0_2))) (and (< .cse0 (+ 101 v_main_~y~0_3)) (< v_main_~y~0_3 v_main_~y~0_2) (= .cse0 (+ v_main_~x~0_2 v_main_~y~0_3)) (< v_main_~y~0_2 101)))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {163#(and (<= main_~y~0 100) (<= main_~x~0 100))} is VALID [2022-04-14 20:08:11,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#(and (<= main_~y~0 100) (<= main_~x~0 100))} [58] L23-2-->L23-3: Formula: (or (not (< v_main_~y~0_1 100)) (not (< v_main_~x~0_1 100))) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {164#(or (and (< 99 main_~x~0) (<= main_~x~0 100)) (= (+ (- 100) main_~y~0) 0))} is VALID [2022-04-14 20:08:11,538 INFO L272 TraceCheckUtils]: 9: Hoare triple {164#(or (and (< 99 main_~x~0) (<= main_~x~0 100)) (= (+ (- 100) main_~y~0) 0))} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~x~0_8 100) (= v_main_~y~0_8 100)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {165#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 20:08:11,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {165#(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] {166#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 20:08:11,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#(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[] {158#false} is VALID [2022-04-14 20:08:11,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {158#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-14 20:08:11,540 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:11,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:08:11,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219750818] [2022-04-14 20:08:11,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219750818] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 20:08:11,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116742] [2022-04-14 20:08:11,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:11,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:08:11,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:08:11,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 20:08:11,582 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:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:11,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 20:08:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:11,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:08:12,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {157#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:08:12,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#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] {157#true} is VALID [2022-04-14 20:08:12,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:08:12,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:08:12,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {157#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:08:12,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~y~0_4 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {157#true} is VALID [2022-04-14 20:08:12,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {157#true} [55] L22-->L23-2: Formula: (and (< v_main_~x~0_7 100) (< v_main_~y~0_7 100)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} AuxVars[] AssignedVars[] {162#(and (<= main_~x~0 99) (<= main_~y~0 99))} is VALID [2022-04-14 20:08:12,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {162#(and (<= main_~x~0 99) (<= main_~y~0 99))} [59] L23-2-->L23-2: Formula: (or (and (or (not (< v_main_~x~0_3 100)) (not (< v_main_~y~0_3 100))) (= v_main_~x~0_3 v_main_~x~0_2) (= v_main_~y~0_3 v_main_~y~0_2)) (let ((.cse0 (+ v_main_~x~0_3 v_main_~y~0_2))) (and (< .cse0 (+ 101 v_main_~y~0_3)) (< v_main_~y~0_3 v_main_~y~0_2) (= .cse0 (+ v_main_~x~0_2 v_main_~y~0_3)) (< v_main_~y~0_2 101)))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {163#(and (<= main_~y~0 100) (<= main_~x~0 100))} is VALID [2022-04-14 20:08:12,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#(and (<= main_~y~0 100) (<= main_~x~0 100))} [58] L23-2-->L23-3: Formula: (or (not (< v_main_~y~0_1 100)) (not (< v_main_~x~0_1 100))) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {195#(and (or (not (< main_~x~0 100)) (not (< main_~y~0 100))) (<= main_~y~0 100) (<= main_~x~0 100))} is VALID [2022-04-14 20:08:12,104 INFO L272 TraceCheckUtils]: 9: Hoare triple {195#(and (or (not (< main_~x~0 100)) (not (< main_~y~0 100))) (<= main_~y~0 100) (<= main_~x~0 100))} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~x~0_8 100) (= v_main_~y~0_8 100)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {199#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:08:12,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {199#(<= 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] {203#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:08:12,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {203#(<= 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[] {158#false} is VALID [2022-04-14 20:08:12,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {158#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-14 20:08:12,107 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:12,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:08:12,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {158#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-14 20:08:12,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {203#(<= 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[] {158#false} is VALID [2022-04-14 20:08:12,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {199#(<= 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] {203#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:08:12,407 INFO L272 TraceCheckUtils]: 9: Hoare triple {164#(or (and (< 99 main_~x~0) (<= main_~x~0 100)) (= (+ (- 100) main_~y~0) 0))} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~x~0_8 100) (= v_main_~y~0_8 100)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {199#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:08:12,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {222#(or (and (< 99 main_~x~0) (<= main_~x~0 100)) (and (< main_~x~0 100) (< main_~y~0 100)) (= (+ (- 100) main_~y~0) 0))} [58] L23-2-->L23-3: Formula: (or (not (< v_main_~y~0_1 100)) (not (< v_main_~x~0_1 100))) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {164#(or (and (< 99 main_~x~0) (<= main_~x~0 100)) (= (+ (- 100) main_~y~0) 0))} is VALID [2022-04-14 20:08:12,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {222#(or (and (< 99 main_~x~0) (<= main_~x~0 100)) (and (< main_~x~0 100) (< main_~y~0 100)) (= (+ (- 100) main_~y~0) 0))} [59] L23-2-->L23-2: Formula: (or (and (or (not (< v_main_~x~0_3 100)) (not (< v_main_~y~0_3 100))) (= v_main_~x~0_3 v_main_~x~0_2) (= v_main_~y~0_3 v_main_~y~0_2)) (let ((.cse0 (+ v_main_~x~0_3 v_main_~y~0_2))) (and (< .cse0 (+ 101 v_main_~y~0_3)) (< v_main_~y~0_3 v_main_~y~0_2) (= .cse0 (+ v_main_~x~0_2 v_main_~y~0_3)) (< v_main_~y~0_2 101)))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {222#(or (and (< 99 main_~x~0) (<= main_~x~0 100)) (and (< main_~x~0 100) (< main_~y~0 100)) (= (+ (- 100) main_~y~0) 0))} is VALID [2022-04-14 20:08:12,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {157#true} [55] L22-->L23-2: Formula: (and (< v_main_~x~0_7 100) (< v_main_~y~0_7 100)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} AuxVars[] AssignedVars[] {222#(or (and (< 99 main_~x~0) (<= main_~x~0 100)) (and (< main_~x~0 100) (< main_~y~0 100)) (= (+ (- 100) main_~y~0) 0))} is VALID [2022-04-14 20:08:12,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~y~0_4 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {157#true} is VALID [2022-04-14 20:08:12,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {157#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:08:12,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:08:12,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:08:12,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#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] {157#true} is VALID [2022-04-14 20:08:12,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {157#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-14 20:08:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-14 20:08:12,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116742] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 20:08:12,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:08:12,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 12 [2022-04-14 20:08:12,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964652829] [2022-04-14 20:08:12,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:08:12,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-14 20:08:12,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:08:12,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 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:12,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:08:12,430 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 20:08:12,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:08:12,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 20:08:12,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-14 20:08:12,431 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 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:12,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:12,486 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-14 20:08:12,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 20:08:12,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-14 20:08:12,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:08:12,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 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:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2022-04-14 20:08:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 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:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2022-04-14 20:08:12,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 12 transitions. [2022-04-14 20:08:12,501 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:12,501 INFO L225 Difference]: With dead ends: 12 [2022-04-14 20:08:12,501 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 20:08:12,502 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-14 20:08:12,502 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:08:12,503 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 32 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:08:12,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 20:08:12,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 20:08:12,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:08:12,504 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:12,504 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:12,504 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:12,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:12,505 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:08:12,505 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:08:12,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:12,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:12,505 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:12,505 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:12,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:12,505 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:08:12,506 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:08:12,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:12,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:12,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:08:12,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:08:12,506 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:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 20:08:12,506 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-14 20:08:12,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:08:12,507 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 20:08:12,507 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 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:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:08:12,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:12,509 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 20:08:12,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 20:08:12,723 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:12,725 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-14 20:08:12,726 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 20:08:12,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:08:12 BasicIcfg [2022-04-14 20:08:12,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 20:08:12,729 INFO L158 Benchmark]: Toolchain (without parser) took 3374.46ms. Allocated memory was 217.1MB in the beginning and 341.8MB in the end (delta: 124.8MB). Free memory was 162.2MB in the beginning and 188.2MB in the end (delta: -26.0MB). Peak memory consumption was 99.2MB. Max. memory is 8.0GB. [2022-04-14 20:08:12,730 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 217.1MB. Free memory is still 178.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 20:08:12,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.26ms. Allocated memory is still 217.1MB. Free memory was 162.0MB in the beginning and 187.2MB in the end (delta: -25.2MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-04-14 20:08:12,730 INFO L158 Benchmark]: Boogie Preprocessor took 39.47ms. Allocated memory is still 217.1MB. Free memory was 187.2MB in the beginning and 185.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 20:08:12,730 INFO L158 Benchmark]: RCFGBuilder took 308.26ms. Allocated memory is still 217.1MB. Free memory was 185.8MB in the beginning and 175.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-14 20:08:12,731 INFO L158 Benchmark]: IcfgTransformer took 757.10ms. Allocated memory is still 217.1MB. Free memory was 175.2MB in the beginning and 142.4MB in the end (delta: 32.8MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-04-14 20:08:12,731 INFO L158 Benchmark]: TraceAbstraction took 2021.71ms. Allocated memory was 217.1MB in the beginning and 341.8MB in the end (delta: 124.8MB). Free memory was 142.1MB in the beginning and 188.2MB in the end (delta: -46.0MB). Peak memory consumption was 79.9MB. Max. memory is 8.0GB. [2022-04-14 20:08:12,732 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 0 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.11ms. Allocated memory is still 217.1MB. Free memory is still 178.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.26ms. Allocated memory is still 217.1MB. Free memory was 162.0MB in the beginning and 187.2MB in the end (delta: -25.2MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.47ms. Allocated memory is still 217.1MB. Free memory was 187.2MB in the beginning and 185.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 308.26ms. Allocated memory is still 217.1MB. Free memory was 185.8MB in the beginning and 175.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 757.10ms. Allocated memory is still 217.1MB. Free memory was 175.2MB in the beginning and 142.4MB in the end (delta: 32.8MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2021.71ms. Allocated memory was 217.1MB in the beginning and 341.8MB in the end (delta: 124.8MB). Free memory was 142.1MB in the beginning and 188.2MB in the end (delta: -46.0MB). Peak memory consumption was 79.9MB. 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: 2.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28 IncrementalHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 40 mSDtfsCounter, 28 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 13, 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, 1.0s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 197 SizeOfPredicates, 1 NumberOfNonLiveVariables, 56 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 1/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:12,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...