./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a622ae6de889131f2da5147d62f9f380917f72e1547f77059c8208bcfb6e8bd0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:56:57,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:56:57,240 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-24 21:56:57,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:56:57,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:56:57,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:56:57,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:56:57,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:56:57,292 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:56:57,293 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:56:57,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:56:57,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:56:57,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:56:57,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:56:57,299 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:56:57,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:56:57,303 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 21:56:57,307 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:56:57,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:56:57,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:56:57,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:56:57,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 21:56:57,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:56:57,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 21:56:57,313 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:56:57,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 21:56:57,314 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:56:57,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:56:57,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:56:57,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:56:57,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:56:57,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:56:57,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:56:57,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:56:57,320 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 21:56:57,320 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:56:57,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:56:57,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:56:57,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:56:57,321 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 21:56:57,321 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:56:57,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:56:57,322 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a622ae6de889131f2da5147d62f9f380917f72e1547f77059c8208bcfb6e8bd0 [2023-11-24 21:56:57,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:56:57,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:56:57,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:56:57,708 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:56:57,708 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:56:57,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i [2023-11-24 21:57:01,097 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:57:01,459 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:57:01,460 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i [2023-11-24 21:57:01,475 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/data/2c6487e14/518c17a42f934ee5898142931f96b499/FLAG6412c3474 [2023-11-24 21:57:01,490 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/data/2c6487e14/518c17a42f934ee5898142931f96b499 [2023-11-24 21:57:01,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:57:01,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:57:01,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:57:01,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:57:01,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:57:01,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:57:01" (1/1) ... [2023-11-24 21:57:01,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c2e54f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:57:01, skipping insertion in model container [2023-11-24 21:57:01,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:57:01" (1/1) ... [2023-11-24 21:57:01,552 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:57:01,918 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i[23220,23233] [2023-11-24 21:57:01,925 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:57:01,940 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:57:02,029 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i[23220,23233] [2023-11-24 21:57:02,040 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:57:02,075 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:57:02,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:57:02 WrapperNode [2023-11-24 21:57:02,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:57:02,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:57:02,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:57:02,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:57:02,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:57:02" (1/1) ... [2023-11-24 21:57:02,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:57:02" (1/1) ... [2023-11-24 21:57:02,144 INFO L138 Inliner]: procedures = 122, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2023-11-24 21:57:02,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:57:02,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:57:02,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:57:02,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:57:02,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:57:02" (1/1) ... [2023-11-24 21:57:02,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:57:02" (1/1) ... [2023-11-24 21:57:02,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:57:02" (1/1) ... [2023-11-24 21:57:02,179 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2023-11-24 21:57:02,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:57:02" (1/1) ... [2023-11-24 21:57:02,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:57:02" (1/1) ... [2023-11-24 21:57:02,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:57:02" (1/1) ... [2023-11-24 21:57:02,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:57:02" (1/1) ... [2023-11-24 21:57:02,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:57:02" (1/1) ... [2023-11-24 21:57:02,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:57:02" (1/1) ... [2023-11-24 21:57:02,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:57:02,206 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:57:02,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:57:02,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:57:02,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:57:02" (1/1) ... [2023-11-24 21:57:02,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:57:02,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:57:02,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:57:02,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:57:02,282 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-24 21:57:02,282 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-24 21:57:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-24 21:57:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-24 21:57:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:57:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:57:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 21:57:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:57:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-24 21:57:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-24 21:57:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-24 21:57:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-24 21:57:02,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:57:02,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:57:02,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:57:02,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:57:02,395 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:57:02,398 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:57:02,484 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-24 21:57:02,694 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:57:02,726 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:57:02,726 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-24 21:57:02,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:57:02 BoogieIcfgContainer [2023-11-24 21:57:02,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:57:02,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:57:02,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:57:02,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:57:02,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:57:01" (1/3) ... [2023-11-24 21:57:02,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f99e3d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:57:02, skipping insertion in model container [2023-11-24 21:57:02,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:57:02" (2/3) ... [2023-11-24 21:57:02,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f99e3d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:57:02, skipping insertion in model container [2023-11-24 21:57:02,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:57:02" (3/3) ... [2023-11-24 21:57:02,744 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_search_value-2.i [2023-11-24 21:57:02,768 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:57:02,768 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-24 21:57:02,835 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:57:02,843 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7333202d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:57:02,844 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 21:57:02,849 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:57:02,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-24 21:57:02,858 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:57:02,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:57:02,860 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:57:02,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:02,866 INFO L85 PathProgramCache]: Analyzing trace with hash 357278617, now seen corresponding path program 1 times [2023-11-24 21:57:02,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:02,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399786474] [2023-11-24 21:57:02,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:02,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:03,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:57:03,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:03,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399786474] [2023-11-24 21:57:03,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399786474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:57:03,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:57:03,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:57:03,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107711604] [2023-11-24 21:57:03,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:57:03,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 21:57:03,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:57:03,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 21:57:03,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 21:57:03,149 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2023-11-24 21:57:03,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:57:03,172 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2023-11-24 21:57:03,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 21:57:03,182 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) Word has length 8 [2023-11-24 21:57:03,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:57:03,188 INFO L225 Difference]: With dead ends: 34 [2023-11-24 21:57:03,188 INFO L226 Difference]: Without dead ends: 17 [2023-11-24 21:57:03,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 21:57:03,195 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:57:03,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:57:03,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-24 21:57:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-11-24 21:57:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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) [2023-11-24 21:57:03,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-11-24 21:57:03,229 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 8 [2023-11-24 21:57:03,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:57:03,230 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-24 21:57:03,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2023-11-24 21:57:03,230 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-11-24 21:57:03,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-24 21:57:03,231 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:57:03,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:57:03,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:57:03,232 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:57:03,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:03,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1991764778, now seen corresponding path program 1 times [2023-11-24 21:57:03,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:03,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434741985] [2023-11-24 21:57:03,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:03,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:57:03,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:03,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434741985] [2023-11-24 21:57:03,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434741985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:57:03,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:57:03,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:57:03,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782276028] [2023-11-24 21:57:03,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:57:03,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:57:03,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:57:03,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:57:03,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:57:03,312 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-24 21:57:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:57:03,328 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2023-11-24 21:57:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:57:03,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2023-11-24 21:57:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:57:03,329 INFO L225 Difference]: With dead ends: 27 [2023-11-24 21:57:03,329 INFO L226 Difference]: Without dead ends: 18 [2023-11-24 21:57:03,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:57:03,331 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:57:03,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:57:03,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-24 21:57:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-24 21:57:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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) [2023-11-24 21:57:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-11-24 21:57:03,337 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-11-24 21:57:03,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:57:03,337 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-24 21:57:03,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-11-24 21:57:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-11-24 21:57:03,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-24 21:57:03,338 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:57:03,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:57:03,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:57:03,339 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:57:03,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:03,340 INFO L85 PathProgramCache]: Analyzing trace with hash 2049023080, now seen corresponding path program 1 times [2023-11-24 21:57:03,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:03,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133861418] [2023-11-24 21:57:03,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:03,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:57:03,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:03,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133861418] [2023-11-24 21:57:03,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133861418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:57:03,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:57:03,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:57:03,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502220405] [2023-11-24 21:57:03,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:57:03,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:57:03,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:57:03,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:57:03,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:57:03,612 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-11-24 21:57:03,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:57:03,675 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2023-11-24 21:57:03,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:57:03,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 10 [2023-11-24 21:57:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:57:03,677 INFO L225 Difference]: With dead ends: 38 [2023-11-24 21:57:03,678 INFO L226 Difference]: Without dead ends: 23 [2023-11-24 21:57:03,678 INFO L412 NwaCegarLoop]: 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 [2023-11-24 21:57:03,680 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:57:03,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 45 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:57:03,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-24 21:57:03,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-11-24 21:57:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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) [2023-11-24 21:57:03,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-11-24 21:57:03,686 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2023-11-24 21:57:03,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:57:03,687 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-11-24 21:57:03,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-11-24 21:57:03,687 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-11-24 21:57:03,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-24 21:57:03,688 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:57:03,688 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:57:03,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:57:03,689 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:57:03,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:03,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1438995548, now seen corresponding path program 1 times [2023-11-24 21:57:03,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:03,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539704675] [2023-11-24 21:57:03,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:03,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:03,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 21:57:03,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:03,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539704675] [2023-11-24 21:57:03,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539704675] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:57:03,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:57:03,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:57:03,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318141570] [2023-11-24 21:57:03,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:57:03,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:57:03,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:57:03,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:57:03,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:57:03,896 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-11-24 21:57:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:57:03,970 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2023-11-24 21:57:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:57:03,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 15 [2023-11-24 21:57:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:57:03,972 INFO L225 Difference]: With dead ends: 31 [2023-11-24 21:57:03,972 INFO L226 Difference]: Without dead ends: 28 [2023-11-24 21:57:03,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:57:03,981 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:57:03,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 23 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:57:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-24 21:57:03,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2023-11-24 21:57:03,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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) [2023-11-24 21:57:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-11-24 21:57:03,988 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2023-11-24 21:57:03,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:57:03,988 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-11-24 21:57:03,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-11-24 21:57:03,989 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-11-24 21:57:03,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-24 21:57:03,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:57:03,990 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:57:03,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:57:03,990 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:57:03,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:03,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1477352526, now seen corresponding path program 1 times [2023-11-24 21:57:03,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:03,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071847577] [2023-11-24 21:57:03,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:03,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:04,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:57:04,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:04,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071847577] [2023-11-24 21:57:04,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071847577] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:57:04,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515131762] [2023-11-24 21:57:04,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:04,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:57:04,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:57:04,180 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:57:04,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 21:57:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:04,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:57:04,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:57:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:57:04,428 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:57:04,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:57:04,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515131762] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:57:04,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:57:04,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-11-24 21:57:04,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362540161] [2023-11-24 21:57:04,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:57:04,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:57:04,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:57:04,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:57:04,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:57:04,490 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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) [2023-11-24 21:57:04,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:57:04,669 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2023-11-24 21:57:04,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 21:57:04,671 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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) Word has length 20 [2023-11-24 21:57:04,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:57:04,672 INFO L225 Difference]: With dead ends: 55 [2023-11-24 21:57:04,672 INFO L226 Difference]: Without dead ends: 39 [2023-11-24 21:57:04,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2023-11-24 21:57:04,676 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:57:04,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:57:04,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-24 21:57:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2023-11-24 21:57:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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) [2023-11-24 21:57:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-11-24 21:57:04,689 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 20 [2023-11-24 21:57:04,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:57:04,690 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-11-24 21:57:04,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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) [2023-11-24 21:57:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-11-24 21:57:04,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-24 21:57:04,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:57:04,692 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:57:04,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-24 21:57:04,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:57:04,899 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:57:04,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:04,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1302450726, now seen corresponding path program 2 times [2023-11-24 21:57:04,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:04,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283338958] [2023-11-24 21:57:04,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:04,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:57:05,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:05,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283338958] [2023-11-24 21:57:05,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283338958] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:57:05,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938127154] [2023-11-24 21:57:05,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 21:57:05,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:57:05,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:57:05,229 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:57:05,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 21:57:05,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 21:57:05,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:57:05,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-24 21:57:05,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:57:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:57:05,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:57:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:57:05,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938127154] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:57:05,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:57:05,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-11-24 21:57:05,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931355938] [2023-11-24 21:57:05,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:57:05,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-24 21:57:05,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:57:05,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-24 21:57:05,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2023-11-24 21:57:05,631 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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) [2023-11-24 21:57:05,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:57:05,855 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2023-11-24 21:57:05,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 21:57:05,856 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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) Word has length 35 [2023-11-24 21:57:05,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:57:05,857 INFO L225 Difference]: With dead ends: 85 [2023-11-24 21:57:05,858 INFO L226 Difference]: Without dead ends: 69 [2023-11-24 21:57:05,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2023-11-24 21:57:05,859 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:57:05,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 80 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:57:05,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-24 21:57:05,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2023-11-24 21:57:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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) [2023-11-24 21:57:05,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2023-11-24 21:57:05,869 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 35 [2023-11-24 21:57:05,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:57:05,870 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2023-11-24 21:57:05,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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) [2023-11-24 21:57:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2023-11-24 21:57:05,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-24 21:57:05,873 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:57:05,873 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:57:05,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-24 21:57:06,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:57:06,079 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 21:57:06,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:06,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2036934490, now seen corresponding path program 3 times [2023-11-24 21:57:06,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:06,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787355276] [2023-11-24 21:57:06,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:06,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 129 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-11-24 21:57:11,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:11,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787355276] [2023-11-24 21:57:11,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787355276] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:57:11,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114377492] [2023-11-24 21:57:11,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 21:57:11,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:57:11,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:57:11,997 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:57:12,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d830485-bcee-46ce-88be-6e284a8bc052/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 21:57:23,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-24 21:57:23,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:57:23,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 133 conjunts are in the unsatisfiable core [2023-11-24 21:57:23,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:57:23,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 21:57:23,855 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 21:57:23,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-24 21:57:23,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-24 21:57:24,044 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-24 21:57:24,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2023-11-24 21:57:24,069 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 21:57:24,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-24 21:57:24,158 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2023-11-24 21:57:24,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 53 [2023-11-24 21:57:24,331 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 21:57:24,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-24 21:57:24,362 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-24 21:57:24,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 47 [2023-11-24 21:57:24,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-24 21:57:24,540 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-24 21:57:24,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 54 [2023-11-24 21:57:24,665 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:57:24,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-24 21:57:24,689 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 21:57:24,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2023-11-24 21:57:24,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-24 21:57:24,828 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-24 21:57:24,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2023-11-24 21:57:25,074 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-24 21:57:25,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 64 [2023-11-24 21:57:25,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2023-11-24 21:57:25,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-24 21:57:25,286 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 21:57:25,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2023-11-24 21:57:25,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-24 21:57:25,405 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-24 21:57:25,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2023-11-24 21:57:25,492 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 21:57:25,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-11-24 21:57:25,583 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-24 21:57:25,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2023-11-24 21:57:25,673 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 21:57:25,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-11-24 21:57:25,732 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-24 21:57:25,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2023-11-24 21:57:25,828 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 21:57:25,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-11-24 21:57:25,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 21:57:25,954 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-24 21:57:25,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2023-11-24 21:57:26,197 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2023-11-24 21:57:26,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 72 [2023-11-24 21:57:26,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:57:26,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 73 [2023-11-24 21:57:26,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2023-11-24 21:57:26,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2023-11-24 21:57:26,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2023-11-24 21:57:26,850 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-24 21:57:26,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 46 [2023-11-24 21:57:27,224 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-24 21:57:27,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 86 [2023-11-24 21:57:27,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 1 [2023-11-24 21:57:27,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:57:27,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 108 [2023-11-24 21:57:28,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:57:28,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 135 [2023-11-24 21:57:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 26 proven. 219 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-24 21:57:28,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:57:28,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:57:28,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2023-11-24 21:57:28,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 119 [2023-11-24 21:57:29,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:57:29,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-11-24 21:57:29,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:57:29,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 94 [2023-11-24 21:57:29,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:57:29,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 110 [2023-11-24 21:57:29,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2023-11-24 21:57:29,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2023-11-24 21:57:29,760 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_2 .cse3))) (or (forall ((v_prenex_8 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_prenex_7 (Array Int Int))) (let ((.cse0 (select v_prenex_7 4))) (or (= .cse0 0) (= .cse0 .cse1) (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_2) .cse1 v_prenex_7) .cse0 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse1 0)))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_1 4)) (.cse4 (select v_arrayElimArr_2 .cse3))) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_2) .cse4 v_arrayElimArr_1) .cse5 v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= .cse5 0) (= .cse4 .cse5) (= .cse4 0))))))) is different from false [2023-11-24 21:57:29,935 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_597 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_2 .cse4)) (.cse1 (select v_arrayElimArr_1 4))) (or (= .cse0 .cse1) (= .cse1 0) (= .cse0 0) (not (= (select (select (store (store (store .cse2 v_subst_2 v_arrayElimArr_2) .cse0 v_arrayElimArr_1) .cse1 v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_2 .cse4))) (or (forall ((v_prenex_8 (Array Int Int)) (v_subst_1 Int) (v_prenex_7 (Array Int Int))) (let ((.cse5 (select v_prenex_7 4))) (or (= .cse5 0) (not (= (select (select (store (store (store .cse2 v_subst_1 v_arrayElimArr_2) .cse6 v_prenex_7) .cse5 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse5 .cse6) (= .cse5 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse6 0)))))) is different from false [2023-11-24 21:57:30,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:57:30,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 106 [2023-11-24 21:57:30,117 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_597 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_1 4)) (.cse2 (select v_arrayElimArr_2 4))) (or (= (select v_arrayElimArr_3 .cse0) 0) (= .cse1 0) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) v_subst_2 v_arrayElimArr_2) .cse2 v_arrayElimArr_1) .cse1 v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse2 .cse1) (= .cse2 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select v_arrayElimArr_3 .cse0) 0) (forall ((v_prenex_8 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_prenex_12 (Array Int Int)) (v_subst_1 Int) (v_prenex_7 (Array Int Int))) (let ((.cse5 (select v_prenex_12 4)) (.cse4 (select v_prenex_7 4))) (or (= .cse4 0) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) v_subst_1 v_prenex_12) .cse5 v_prenex_7) .cse4 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse5 0) (= .cse5 .cse4)))))))) is different from false [2023-11-24 21:57:30,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:57:30,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 122 [2023-11-24 21:57:31,104 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select v_arrayElimArr_4 .cse0) 0) (forall ((v_prenex_8 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_prenex_14 (Array Int Int)) (v_prenex_12 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int) (v_prenex_7 (Array Int Int))) (let ((.cse2 (select v_prenex_12 4)) (.cse1 (select v_prenex_7 4))) (or (= .cse1 0) (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_3 v_prenex_14) v_subst_1 v_prenex_12) .cse2 v_prenex_7) .cse1 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= (select v_prenex_14 4) 0) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse2 0) (= .cse2 .cse1)))))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_597 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_1 4)) (.cse4 (select v_arrayElimArr_2 4))) (or (= (select v_arrayElimArr_4 .cse0) 0) (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_arrayElimArr_2) .cse4 v_arrayElimArr_1) .cse5 v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 0)) (= .cse5 0) (= .cse4 .cse5) (= .cse4 0) (= (select v_arrayElimArr_3 4) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2023-11-24 21:57:32,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:57:32,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 138 [2023-11-24 21:57:39,563 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_580 (Array Int Int))) (or (= (select v_arrayElimArr_5 4) 0) (forall ((v_prenex_8 (Array Int Int)) (v_subst_7 Int) (v_prenex_14 (Array Int Int)) (v_subst_5 Int) (v_prenex_12 (Array Int Int)) (v_subst_3 Int) (v_subst_1 Int) (v_prenex_16 (Array Int Int)) (v_prenex_7 (Array Int Int))) (let ((.cse0 (select v_prenex_12 4)) (.cse1 (select v_prenex_7 4))) (or (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_580) v_subst_7 v_arrayElimArr_5) v_subst_5 v_prenex_16) v_subst_3 v_prenex_14) v_subst_1 v_prenex_12) .cse0 v_prenex_7) .cse1 v_prenex_8) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= .cse1 0) (= (select v_prenex_16 4) 0) (= (select v_prenex_14 4) 0) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse0 0) (= .cse0 .cse1)))))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_580 (Array Int Int)) (v_subst_8 Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_4 Int) (v_subst_2 Int) (v_ArrVal_597 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_1 4)) (.cse3 (select v_arrayElimArr_2 4))) (or (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_580) v_subst_8 v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_4 v_arrayElimArr_3) v_subst_2 v_arrayElimArr_2) .cse3 v_arrayElimArr_1) .cse4 v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= (select v_arrayElimArr_5 4) 0) (= .cse4 0) (= .cse3 .cse4) (= (select v_arrayElimArr_4 4) 0) (= .cse3 0) (= (select v_arrayElimArr_3 4) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2023-11-24 21:57:40,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:57:40,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 160 [2023-11-24 21:57:44,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:57:44,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 233 treesize of output 262 [2023-11-24 21:57:45,369 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-24 21:57:45,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 84 [2023-11-24 21:57:50,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:57:50,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2023-11-24 21:57:50,776 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:57:50,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:57:50,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 352915521 treesize of output 352718918