./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB --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 52ed361cdf08860b8c7c7d564ef95393de2d3a38663ac135cf0da9ded1f39b3f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:23:43,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:23:43,977 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 20:23:43,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:23:43,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:23:44,026 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:23:44,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:23:44,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:23:44,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:23:44,029 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:23:44,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:23:44,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:23:44,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:23:44,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:23:44,031 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:23:44,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:23:44,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:23:44,031 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:23:44,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:23:44,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:23:44,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:23:44,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:23:44,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:23:44,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:23:44,032 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:23:44,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:23:44,033 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:23:44,033 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:23:44,033 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:23:44,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:23:44,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:23:44,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:23:44,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:23:44,035 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:23:44,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:23:44,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:23:44,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:23:44,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:23:44,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:23:44,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:23:44,035 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:23:44,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:23:44,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:23:44,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:23:44,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:23:44,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:23:44,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:23:44,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:23:44,036 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 52ed361cdf08860b8c7c7d564ef95393de2d3a38663ac135cf0da9ded1f39b3f [2024-11-27 20:23:44,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:23:44,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:23:44,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:23:44,417 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:23:44,418 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:23:44,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i [2024-11-27 20:23:47,747 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/data/6773281f0/a0dfa2a4cec64c27bee3c5f0c0166c9b/FLAGf61a59edc [2024-11-27 20:23:48,144 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:23:48,145 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i [2024-11-27 20:23:48,169 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/data/6773281f0/a0dfa2a4cec64c27bee3c5f0c0166c9b/FLAGf61a59edc [2024-11-27 20:23:48,327 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/data/6773281f0/a0dfa2a4cec64c27bee3c5f0c0166c9b [2024-11-27 20:23:48,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:23:48,333 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:23:48,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:23:48,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:23:48,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:23:48,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:23:48" (1/1) ... [2024-11-27 20:23:48,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab51f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:48, skipping insertion in model container [2024-11-27 20:23:48,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:23:48" (1/1) ... [2024-11-27 20:23:48,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:23:48,847 WARN L250 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_2dbde73d-5613-43cd-84fc-e7545fcec2bf/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i[26271,26284] [2024-11-27 20:23:48,853 WARN L250 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_2dbde73d-5613-43cd-84fc-e7545fcec2bf/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i[26396,26409] [2024-11-27 20:23:48,855 WARN L250 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_2dbde73d-5613-43cd-84fc-e7545fcec2bf/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i[26511,26524] [2024-11-27 20:23:48,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:23:48,881 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:23:48,946 WARN L250 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_2dbde73d-5613-43cd-84fc-e7545fcec2bf/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i[26271,26284] [2024-11-27 20:23:48,948 WARN L250 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_2dbde73d-5613-43cd-84fc-e7545fcec2bf/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i[26396,26409] [2024-11-27 20:23:48,949 WARN L250 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_2dbde73d-5613-43cd-84fc-e7545fcec2bf/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i[26511,26524] [2024-11-27 20:23:48,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:23:49,000 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:23:49,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:49 WrapperNode [2024-11-27 20:23:49,001 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:23:49,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:23:49,002 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:23:49,002 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:23:49,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:49" (1/1) ... [2024-11-27 20:23:49,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:49" (1/1) ... [2024-11-27 20:23:49,088 INFO L138 Inliner]: procedures = 142, calls = 63, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 183 [2024-11-27 20:23:49,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:23:49,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:23:49,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:23:49,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:23:49,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:49" (1/1) ... [2024-11-27 20:23:49,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:49" (1/1) ... [2024-11-27 20:23:49,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:49" (1/1) ... [2024-11-27 20:23:49,148 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 7 writes are split as follows [0, 7]. [2024-11-27 20:23:49,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:49" (1/1) ... [2024-11-27 20:23:49,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:49" (1/1) ... [2024-11-27 20:23:49,161 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:49" (1/1) ... [2024-11-27 20:23:49,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:49" (1/1) ... [2024-11-27 20:23:49,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:49" (1/1) ... [2024-11-27 20:23:49,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:49" (1/1) ... [2024-11-27 20:23:49,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:49" (1/1) ... [2024-11-27 20:23:49,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:23:49,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:23:49,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:23:49,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:23:49,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:49" (1/1) ... [2024-11-27 20:23:49,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:23:49,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:23:49,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:23:49,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:23:49,273 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-27 20:23:49,273 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-27 20:23:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2024-11-27 20:23:49,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2024-11-27 20:23:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 20:23:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:23:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 20:23:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 20:23:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2024-11-27 20:23:49,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2024-11-27 20:23:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 20:23:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 20:23:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 20:23:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-27 20:23:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-27 20:23:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-11-27 20:23:49,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-11-27 20:23:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:23:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 20:23:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2024-11-27 20:23:49,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2024-11-27 20:23:49,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:23:49,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:23:49,501 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:23:49,505 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:23:49,957 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2024-11-27 20:23:49,957 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:23:49,975 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:23:49,975 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-27 20:23:49,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:23:49 BoogieIcfgContainer [2024-11-27 20:23:49,976 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:23:49,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:23:49,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:23:49,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:23:49,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:23:48" (1/3) ... [2024-11-27 20:23:49,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a51a7fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:23:49, skipping insertion in model container [2024-11-27 20:23:49,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:23:49" (2/3) ... [2024-11-27 20:23:49,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a51a7fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:23:49, skipping insertion in model container [2024-11-27 20:23:49,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:23:49" (3/3) ... [2024-11-27 20:23:49,988 INFO L128 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-2.i [2024-11-27 20:23:50,007 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:23:50,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_mutex_unbounded-2.i that has 6 procedures, 80 locations, 1 initial locations, 5 loop locations, and 3 error locations. [2024-11-27 20:23:50,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:23:50,106 INFO L333 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, 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;@f0a0c70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:23:50,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-27 20:23:50,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 64 states have internal predecessors, (81), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-27 20:23:50,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-27 20:23:50,122 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:23:50,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:23:50,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:23:50,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:50,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1453229469, now seen corresponding path program 1 times [2024-11-27 20:23:50,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:23:50,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431596112] [2024-11-27 20:23:50,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:50,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:23:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:50,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:23:50,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431596112] [2024-11-27 20:23:50,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431596112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:50,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:50,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:23:50,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653675326] [2024-11-27 20:23:50,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:50,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 20:23:50,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:23:50,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 20:23:50,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:23:50,420 INFO L87 Difference]: Start difference. First operand has 80 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 64 states have internal predecessors, (81), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2024-11-27 20:23:50,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:23:50,464 INFO L93 Difference]: Finished difference Result 157 states and 204 transitions. [2024-11-27 20:23:50,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 20:23:50,467 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2024-11-27 20:23:50,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:23:50,478 INFO L225 Difference]: With dead ends: 157 [2024-11-27 20:23:50,478 INFO L226 Difference]: Without dead ends: 75 [2024-11-27 20:23:50,484 INFO L434 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 [2024-11-27 20:23:50,489 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:23:50,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:23:50,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-27 20:23:50,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-27 20:23:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 59 states have internal predecessors, (67), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-27 20:23:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2024-11-27 20:23:50,584 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 13 [2024-11-27 20:23:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:23:50,585 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2024-11-27 20:23:50,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2024-11-27 20:23:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2024-11-27 20:23:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-27 20:23:50,591 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:23:50,592 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:23:50,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:23:50,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:23:50,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:50,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1683657964, now seen corresponding path program 1 times [2024-11-27 20:23:50,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:23:50,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919375478] [2024-11-27 20:23:50,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:50,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:23:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:51,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:23:51,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919375478] [2024-11-27 20:23:51,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919375478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:51,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:51,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:23:51,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53719917] [2024-11-27 20:23:51,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:51,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:23:51,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:23:51,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:23:51,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:23:51,227 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-11-27 20:23:51,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:23:51,651 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2024-11-27 20:23:51,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:23:51,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2024-11-27 20:23:51,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:23:51,657 INFO L225 Difference]: With dead ends: 134 [2024-11-27 20:23:51,658 INFO L226 Difference]: Without dead ends: 128 [2024-11-27 20:23:51,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:23:51,661 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 59 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:23:51,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 332 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:23:51,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-27 20:23:51,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2024-11-27 20:23:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.2195121951219512) internal successors, (100), 85 states have internal predecessors, (100), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-27 20:23:51,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2024-11-27 20:23:51,695 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 13 [2024-11-27 20:23:51,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:23:51,695 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2024-11-27 20:23:51,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-11-27 20:23:51,696 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2024-11-27 20:23:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-27 20:23:51,699 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:23:51,699 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:23:51,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:23:51,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:23:51,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:51,700 INFO L85 PathProgramCache]: Analyzing trace with hash 329995964, now seen corresponding path program 1 times [2024-11-27 20:23:51,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:23:51,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471545351] [2024-11-27 20:23:51,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:51,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:23:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:51,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:51,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:23:51,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471545351] [2024-11-27 20:23:51,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471545351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:23:51,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:23:51,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:23:51,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369393280] [2024-11-27 20:23:51,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:23:51,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:23:51,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:23:51,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:23:51,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:23:51,831 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:23:52,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:23:52,058 INFO L93 Difference]: Finished difference Result 182 states and 215 transitions. [2024-11-27 20:23:52,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:23:52,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-27 20:23:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:23:52,061 INFO L225 Difference]: With dead ends: 182 [2024-11-27 20:23:52,061 INFO L226 Difference]: Without dead ends: 87 [2024-11-27 20:23:52,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:23:52,062 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 14 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:23:52,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 211 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:23:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-27 20:23:52,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2024-11-27 20:23:52,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 65 states have internal predecessors, (72), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-27 20:23:52,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2024-11-27 20:23:52,081 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 16 [2024-11-27 20:23:52,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:23:52,081 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2024-11-27 20:23:52,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:23:52,081 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2024-11-27 20:23:52,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-27 20:23:52,082 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:23:52,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:23:52,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:23:52,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:23:52,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:52,084 INFO L85 PathProgramCache]: Analyzing trace with hash -148486980, now seen corresponding path program 1 times [2024-11-27 20:23:52,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:23:52,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081535228] [2024-11-27 20:23:52,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:52,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:23:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:52,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:23:52,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081535228] [2024-11-27 20:23:52,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081535228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:23:52,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385821520] [2024-11-27 20:23:52,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:52,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:52,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:23:52,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:23:52,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:23:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:53,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-27 20:23:53,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:23:53,443 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 20:23:53,444 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 11 treesize of output 11 [2024-11-27 20:23:53,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-27 20:23:53,669 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-27 20:23:53,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2024-11-27 20:23:53,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2024-11-27 20:23:53,725 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 10 treesize of output 9 [2024-11-27 20:23:53,733 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 13 treesize of output 17 [2024-11-27 20:23:53,740 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 28 [2024-11-27 20:23:53,761 INFO L349 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2024-11-27 20:23:53,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 20 [2024-11-27 20:23:53,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:23:53,778 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 13 treesize of output 7 [2024-11-27 20:23:53,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2024-11-27 20:23:53,818 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-11-27 20:23:53,818 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 1 case distinctions, treesize of input 18 treesize of output 26 [2024-11-27 20:23:53,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2024-11-27 20:23:53,892 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-27 20:23:53,893 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 1 case distinctions, treesize of input 18 treesize of output 30 [2024-11-27 20:23:53,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-27 20:23:54,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 87 treesize of output 74 [2024-11-27 20:23:54,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2024-11-27 20:23:54,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 55 [2024-11-27 20:23:54,084 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 14 treesize of output 13 [2024-11-27 20:23:54,096 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-11-27 20:23:54,097 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 83 treesize of output 46 [2024-11-27 20:23:54,131 INFO L349 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2024-11-27 20:23:54,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 20 treesize of output 17 [2024-11-27 20:23:54,155 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 13 treesize of output 17 [2024-11-27 20:23:54,168 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 7 treesize of output 3 [2024-11-27 20:23:56,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 438 treesize of output 406 [2024-11-27 20:23:56,445 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 70 treesize of output 58 [2024-11-27 20:23:56,452 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2024-11-27 20:23:56,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:23:56,464 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 59 treesize of output 51 [2024-11-27 20:23:56,470 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2024-11-27 20:23:56,494 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 8 [2024-11-27 20:23:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:56,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:23:57,205 INFO L349 Elim1Store]: treesize reduction 136, result has 36.7 percent of original size [2024-11-27 20:23:57,206 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 554 treesize of output 361 [2024-11-27 20:23:57,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:23:57,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 235 treesize of output 259 [2024-11-27 20:23:57,312 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 136 treesize of output 134 [2024-11-27 20:23:57,340 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 134 treesize of output 130 [2024-11-27 20:23:57,813 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 6 treesize of output 4 [2024-11-27 20:23:57,885 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 8 treesize of output 4 [2024-11-27 20:23:57,950 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 8 treesize of output 4 [2024-11-27 20:23:58,005 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 8 treesize of output 4 [2024-11-27 20:23:58,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:23:58,058 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 47 treesize of output 51 [2024-11-27 20:23:58,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:23:58,133 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 39 treesize of output 43 [2024-11-27 20:23:58,319 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:23:58,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:23:58,334 INFO L349 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2024-11-27 20:23:58,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 44 treesize of output 1 [2024-11-27 20:23:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:23:58,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385821520] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:23:58,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:23:58,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2024-11-27 20:23:58,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964239562] [2024-11-27 20:23:58,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:23:58,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-27 20:23:58,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:23:58,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-27 20:23:58,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=830, Unknown=3, NotChecked=0, Total=930 [2024-11-27 20:23:58,618 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand has 31 states, 26 states have (on average 2.0) internal successors, (52), 24 states have internal predecessors, (52), 7 states have call successors, (8), 5 states have call predecessors, (8), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-27 20:24:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:24:02,131 INFO L93 Difference]: Finished difference Result 189 states and 219 transitions. [2024-11-27 20:24:02,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-27 20:24:02,132 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 2.0) internal successors, (52), 24 states have internal predecessors, (52), 7 states have call successors, (8), 5 states have call predecessors, (8), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 31 [2024-11-27 20:24:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:24:02,138 INFO L225 Difference]: With dead ends: 189 [2024-11-27 20:24:02,138 INFO L226 Difference]: Without dead ends: 155 [2024-11-27 20:24:02,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=318, Invalid=2113, Unknown=19, NotChecked=0, Total=2450 [2024-11-27 20:24:02,141 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 413 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 124 mSolverCounterUnsat, 41 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 41 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:24:02,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 836 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1224 Invalid, 41 Unknown, 0 Unchecked, 2.3s Time] [2024-11-27 20:24:02,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-27 20:24:02,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 128. [2024-11-27 20:24:02,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 99 states have (on average 1.202020202020202) internal successors, (119), 104 states have internal predecessors, (119), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-27 20:24:02,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 151 transitions. [2024-11-27 20:24:02,187 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 151 transitions. Word has length 31 [2024-11-27 20:24:02,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:24:02,188 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 151 transitions. [2024-11-27 20:24:02,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 2.0) internal successors, (52), 24 states have internal predecessors, (52), 7 states have call successors, (8), 5 states have call predecessors, (8), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-27 20:24:02,191 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 151 transitions. [2024-11-27 20:24:02,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 20:24:02,194 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:24:02,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:24:02,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-27 20:24:02,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:24:02,396 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:24:02,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:24:02,397 INFO L85 PathProgramCache]: Analyzing trace with hash -655633172, now seen corresponding path program 1 times [2024-11-27 20:24:02,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:24:02,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743937247] [2024-11-27 20:24:02,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:24:02,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:24:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:24:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 20:24:02,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:24:02,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743937247] [2024-11-27 20:24:02,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743937247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:24:02,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:24:02,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:24:02,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762491054] [2024-11-27 20:24:02,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:24:02,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:24:02,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:24:02,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:24:02,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:24:02,533 INFO L87 Difference]: Start difference. First operand 128 states and 151 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-27 20:24:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:24:02,564 INFO L93 Difference]: Finished difference Result 140 states and 167 transitions. [2024-11-27 20:24:02,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:24:02,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2024-11-27 20:24:02,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:24:02,566 INFO L225 Difference]: With dead ends: 140 [2024-11-27 20:24:02,567 INFO L226 Difference]: Without dead ends: 138 [2024-11-27 20:24:02,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:24:02,568 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:24:02,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:24:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-27 20:24:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2024-11-27 20:24:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 105 states have (on average 1.1904761904761905) internal successors, (125), 110 states have internal predecessors, (125), 16 states have call successors, (16), 10 states have call predecessors, (16), 12 states have return successors, (21), 15 states have call predecessors, (21), 16 states have call successors, (21) [2024-11-27 20:24:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2024-11-27 20:24:02,593 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 34 [2024-11-27 20:24:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:24:02,593 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2024-11-27 20:24:02,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-27 20:24:02,594 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2024-11-27 20:24:02,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-27 20:24:02,595 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:24:02,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:24:02,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:24:02,595 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:24:02,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:24:02,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1020919644, now seen corresponding path program 1 times [2024-11-27 20:24:02,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:24:02,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710851077] [2024-11-27 20:24:02,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:24:02,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:24:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:24:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:24:05,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:24:05,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710851077] [2024-11-27 20:24:05,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710851077] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:24:05,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651025112] [2024-11-27 20:24:05,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:24:05,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:24:05,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:24:05,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:24:05,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:24:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:24:05,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-11-27 20:24:05,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:24:06,521 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-27 20:24:06,522 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 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-27 20:24:06,730 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 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-27 20:24:06,738 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 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-27 20:24:43,839 WARN L286 SmtUtils]: Spent 10.24s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 20:24:44,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:24:44,610 INFO L349 Elim1Store]: treesize reduction 251, result has 18.8 percent of original size [2024-11-27 20:24:44,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 324 treesize of output 462 [2024-11-27 20:24:44,829 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-11-27 20:24:44,830 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 454 treesize of output 383 [2024-11-27 20:24:45,304 INFO L349 Elim1Store]: treesize reduction 153, result has 44.6 percent of original size [2024-11-27 20:24:45,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 98 treesize of output 195 [2024-11-27 20:24:45,594 INFO L349 Elim1Store]: treesize reduction 60, result has 51.2 percent of original size [2024-11-27 20:24:45,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 314 treesize of output 309 [2024-11-27 20:24:45,746 INFO L349 Elim1Store]: treesize reduction 64, result has 36.6 percent of original size [2024-11-27 20:24:45,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 162 [2024-11-27 20:24:45,809 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 47 treesize of output 34 [2024-11-27 20:24:45,928 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 15 treesize of output 9 [2024-11-27 20:24:46,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 79 treesize of output 96 [2024-11-27 20:24:46,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 87 treesize of output 100 [2024-11-27 20:24:48,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:24:48,121 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 29 treesize of output 33 [2024-11-27 20:24:48,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:24:48,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 18 treesize of output 22 [2024-11-27 20:24:48,314 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 21 treesize of output 15 [2024-11-27 20:24:48,360 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-27 20:24:48,361 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 1 case distinctions, treesize of input 26 treesize of output 38 [2024-11-27 20:24:48,610 INFO L349 Elim1Store]: treesize reduction 78, result has 40.0 percent of original size [2024-11-27 20:24:48,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 131 [2024-11-27 20:24:48,887 INFO L349 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2024-11-27 20:24:48,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 159 treesize of output 167 [2024-11-27 20:24:49,183 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-11-27 20:24:49,184 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 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-27 20:24:49,213 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 11 [2024-11-27 20:24:49,332 INFO L349 Elim1Store]: treesize reduction 60, result has 23.1 percent of original size [2024-11-27 20:24:49,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 450 treesize of output 421 [2024-11-27 20:24:49,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:24:49,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1351 treesize of output 1213 [2024-11-27 20:24:51,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:24:51,202 INFO L349 Elim1Store]: treesize reduction 94, result has 5.1 percent of original size [2024-11-27 20:24:51,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 504 treesize of output 408 [2024-11-27 20:24:52,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:24:52,600 INFO L349 Elim1Store]: treesize reduction 94, result has 5.1 percent of original size [2024-11-27 20:24:52,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 487 treesize of output 393 [2024-11-27 20:24:53,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:24:53,435 INFO L349 Elim1Store]: treesize reduction 94, result has 5.1 percent of original size [2024-11-27 20:24:53,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 532 treesize of output 434 [2024-11-27 20:24:53,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:24:53,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:24:53,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 68 [2024-11-27 20:26:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:07,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:26:28,486 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_~#drvlist~0.base|))) (and (forall ((v___ldv_list_add_~new.offset_24 Int) (v_ArrVal_189 Int) (v_ArrVal_188 Int) (v_ArrVal_187 Int) (v_ArrVal_186 (Array Int Int)) (v_ldv_list_add_~head.offset_16 Int) (v___ldv_list_add_~next.offset_24 Int) (v_ArrVal_185 (Array Int Int))) (let ((.cse6 (+ v___ldv_list_add_~new.offset_24 4)) (.cse7 (select .cse9 v_ldv_list_add_~head.offset_16))) (let ((.cse4 (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_185))) (store .cse8 |c_ULTIMATE.start_foo_~me~0#1.base| (store (store (select .cse8 |c_ULTIMATE.start_foo_~me~0#1.base|) v___ldv_list_add_~new.offset_24 .cse7) .cse6 v_ArrVal_187))))) (let ((.cse2 (store (select .cse4 |c_~#drvlist~0.base|) v_ldv_list_add_~head.offset_16 v_ArrVal_189)) (.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| .cse7 (store (select |c_#memory_$Pointer$#1.offset| .cse7) (+ v___ldv_list_add_~next.offset_24 4) v_ArrVal_188)))) (store (store .cse5 |c_ULTIMATE.start_foo_~me~0#1.base| v_ArrVal_186) |c_~#drvlist~0.base| (store (select (store .cse5 |c_ULTIMATE.start_foo_~me~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_foo_~me~0#1.base|) v___ldv_list_add_~new.offset_24 v___ldv_list_add_~next.offset_24) .cse6 v_ldv_list_add_~head.offset_16)) |c_~#drvlist~0.base|) v_ldv_list_add_~head.offset_16 v___ldv_list_add_~new.offset_24))) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (let ((.cse1 (select (let ((.cse3 (store .cse4 |c_~#drvlist~0.base| .cse2))) (select .cse3 (select (select .cse3 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (+ .cse0 (- 4))))) (or (= .cse0 |c_~#mutexes~0.offset|) (not (= .cse1 (select .cse2 |c_~#drvlist~0.offset|))) (= |c_~#drvlist~0.base| .cse1))))))) (forall ((v___ldv_list_add_~new.offset_24 Int) (v_ArrVal_188 Int) (v_ldv_list_add_~head.offset_16 Int) (v___ldv_list_add_~next.offset_24 Int)) (let ((.cse15 (select .cse9 v_ldv_list_add_~head.offset_16))) (let ((.cse17 (store |c_#memory_$Pointer$#1.offset| .cse15 (store (select |c_#memory_$Pointer$#1.offset| .cse15) (+ v___ldv_list_add_~next.offset_24 4) v_ArrVal_188))) (.cse16 (+ v___ldv_list_add_~new.offset_24 4))) (let ((.cse18 (store (select (store .cse17 |c_ULTIMATE.start_foo_~me~0#1.base| (store (store (select .cse17 |c_ULTIMATE.start_foo_~me~0#1.base|) v___ldv_list_add_~new.offset_24 v___ldv_list_add_~next.offset_24) .cse16 v_ldv_list_add_~head.offset_16)) |c_~#drvlist~0.base|) v_ldv_list_add_~head.offset_16 v___ldv_list_add_~new.offset_24))) (or (forall ((v_ArrVal_189 Int) (v_ArrVal_187 Int) (v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse10 (select (select (store (store .cse17 |c_ULTIMATE.start_foo_~me~0#1.base| v_ArrVal_186) |c_~#drvlist~0.base| .cse18) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (or (= .cse10 |c_~#mutexes~0.offset|) (not (let ((.cse12 (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse15 v_ArrVal_185))) (store .cse14 |c_ULTIMATE.start_foo_~me~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_foo_~me~0#1.base|) v___ldv_list_add_~new.offset_24 .cse15) .cse16 v_ArrVal_187))))) (let ((.cse13 (store (select .cse12 |c_~#drvlist~0.base|) v_ldv_list_add_~head.offset_16 v_ArrVal_189))) (= (select (let ((.cse11 (store .cse12 |c_~#drvlist~0.base| .cse13))) (select .cse11 (select (select .cse11 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (+ .cse10 (- 4))) (select .cse13 |c_~#drvlist~0.offset|)))))))) (= (select .cse18 |c_~#drvlist~0.offset|) |c_~#drvlist~0.offset|)))))) (forall ((v___ldv_list_add_~new.offset_24 Int) (v_ArrVal_189 Int) (v_ArrVal_188 Int) (v_ArrVal_187 Int) (v_ArrVal_186 (Array Int Int)) (v_ldv_list_add_~head.offset_16 Int) (v___ldv_list_add_~next.offset_24 Int) (v_ArrVal_185 (Array Int Int))) (let ((.cse24 (+ v___ldv_list_add_~new.offset_24 4)) (.cse25 (select .cse9 v_ldv_list_add_~head.offset_16))) (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$#1.base| .cse25 v_ArrVal_185))) (store .cse27 |c_ULTIMATE.start_foo_~me~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_foo_~me~0#1.base|) v___ldv_list_add_~new.offset_24 .cse25) .cse24 v_ArrVal_187))))) (let ((.cse21 (store (select .cse26 |c_~#drvlist~0.base|) v_ldv_list_add_~head.offset_16 v_ArrVal_189))) (let ((.cse22 (store .cse26 |c_~#drvlist~0.base| .cse21))) (let ((.cse19 (select (select .cse22 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (let ((.cse20 (select (select .cse22 .cse19) (+ (select (select (let ((.cse23 (store |c_#memory_$Pointer$#1.offset| .cse25 (store (select |c_#memory_$Pointer$#1.offset| .cse25) (+ v___ldv_list_add_~next.offset_24 4) v_ArrVal_188)))) (store (store .cse23 |c_ULTIMATE.start_foo_~me~0#1.base| v_ArrVal_186) |c_~#drvlist~0.base| (store (select (store .cse23 |c_ULTIMATE.start_foo_~me~0#1.base| (store (store (select .cse23 |c_ULTIMATE.start_foo_~me~0#1.base|) v___ldv_list_add_~new.offset_24 v___ldv_list_add_~next.offset_24) .cse24 v_ldv_list_add_~head.offset_16)) |c_~#drvlist~0.base|) v_ldv_list_add_~head.offset_16 v___ldv_list_add_~new.offset_24))) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|) (- 4))))) (or (= .cse19 |c_~#mutexes~0.base|) (not (= .cse20 (select .cse21 |c_~#drvlist~0.offset|))) (= |c_~#drvlist~0.base| .cse20))))))))) (forall ((v___ldv_list_add_~new.offset_24 Int) (v_ArrVal_188 Int) (v_ldv_list_add_~head.offset_16 Int) (v___ldv_list_add_~next.offset_24 Int)) (let ((.cse35 (select .cse9 v_ldv_list_add_~head.offset_16))) (let ((.cse30 (store |c_#memory_$Pointer$#1.offset| .cse35 (store (select |c_#memory_$Pointer$#1.offset| .cse35) (+ v___ldv_list_add_~next.offset_24 4) v_ArrVal_188))) (.cse36 (+ v___ldv_list_add_~new.offset_24 4))) (let ((.cse31 (store (select (store .cse30 |c_ULTIMATE.start_foo_~me~0#1.base| (store (store (select .cse30 |c_ULTIMATE.start_foo_~me~0#1.base|) v___ldv_list_add_~new.offset_24 v___ldv_list_add_~next.offset_24) .cse36 v_ldv_list_add_~head.offset_16)) |c_~#drvlist~0.base|) v_ldv_list_add_~head.offset_16 v___ldv_list_add_~new.offset_24))) (or (forall ((v_ArrVal_189 Int) (v_ArrVal_187 Int) (v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse33 (let ((.cse34 (store |c_#memory_$Pointer$#1.base| .cse35 v_ArrVal_185))) (store .cse34 |c_ULTIMATE.start_foo_~me~0#1.base| (store (store (select .cse34 |c_ULTIMATE.start_foo_~me~0#1.base|) v___ldv_list_add_~new.offset_24 .cse35) .cse36 v_ArrVal_187))))) (let ((.cse32 (store (select .cse33 |c_~#drvlist~0.base|) v_ldv_list_add_~head.offset_16 v_ArrVal_189))) (let ((.cse29 (store .cse33 |c_~#drvlist~0.base| .cse32))) (let ((.cse28 (select (select .cse29 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (or (= .cse28 |c_~#mutexes~0.base|) (not (= (select (select .cse29 .cse28) (+ (select (select (store (store .cse30 |c_ULTIMATE.start_foo_~me~0#1.base| v_ArrVal_186) |c_~#drvlist~0.base| .cse31) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|) (- 4))) (select .cse32 |c_~#drvlist~0.offset|))))))))) (= (select .cse31 |c_~#drvlist~0.offset|) |c_~#drvlist~0.offset|)))))))) is different from false [2024-11-27 20:26:28,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651025112] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:26:28,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:26:28,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 34 [2024-11-27 20:26:28,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509951801] [2024-11-27 20:26:28,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:26:28,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-27 20:26:28,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:28,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-27 20:26:28,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1496, Unknown=14, NotChecked=80, Total=1806 [2024-11-27 20:26:28,672 INFO L87 Difference]: Start difference. First operand 136 states and 162 transitions. Second operand has 34 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 26 states have internal predecessors, (51), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-27 20:26:34,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:26:40,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:26:44,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:26:48,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:27:01,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:27:02,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:27:03,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:27:06,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:27:07,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:27:12,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:27:16,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:27:17,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:27:18,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:28:48,057 WARN L286 SmtUtils]: Spent 1.06m on a formula simplification. DAG size of input: 139 DAG size of output: 133 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 20:28:52,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:28:54,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:28:58,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:28:59,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:01,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:03,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:07,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:11,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:12,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:14,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:18,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:22,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:24,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:25,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:29,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:33,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:36,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:38,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:40,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:41,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:43,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:44,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:47,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:50,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:52,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:54,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:29:58,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:30:04,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:30:11,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:30:14,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:30:16,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:30:19,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:30:29,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:30:31,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:32:23,624 WARN L286 SmtUtils]: Spent 1.23m on a formula simplification. DAG size of input: 465 DAG size of output: 605 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 20:32:32,746 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse65 (select |c_#memory_$Pointer$#1.offset| 3)) (.cse8 (select |c_#memory_$Pointer$#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$#1.base| 4))) (let ((.cse48 (select .cse2 |c_~#drvlist~0.offset|)) (.cse49 (select .cse8 |c_~#drvlist~0.offset|)) (.cse27 (exists ((v_arrayElimCell_81 Int)) (= (select .cse8 (+ 4 v_arrayElimCell_81)) 0))) (.cse0 (= (select .cse65 0) 0)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.base| 3) 0) 3))) (and (or (and (let ((.cse26 (or (exists ((|~#drvlist~0.offset| Int)) (and (= |~#drvlist~0.offset| (select .cse8 |~#drvlist~0.offset|)) (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_80 Int) (v_prenex_11 (Array Int Int))) (let ((.cse29 (select .cse8 v_arrayElimCell_80))) (let ((.cse31 (select .cse2 v_arrayElimCell_80)) (.cse30 (+ .cse29 4)) (.cse32 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|)) (.cse28 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|))) (and (= .cse2 (store (store (store .cse28 .cse29 (select .cse2 .cse29)) .cse30 (select .cse2 .cse30)) v_arrayElimCell_80 .cse31)) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (and (= (select v_prenex_18 |~#drvlist~0.offset|) 4) (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_19) 4 v_prenex_18) |ULTIMATE.start_foo_~me~0#1.base|) .cse32) (= .cse31 (select v_prenex_18 v_arrayElimCell_80)))) (= (select .cse32 .cse30) (select .cse28 .cse30)) (= (select .cse32 .cse29) 4) (= (select .cse28 .cse29) 4))))))) (= (select .cse2 |~#drvlist~0.offset|) |c_ULTIMATE.start_foo_~me~1#1.base|))) (exists ((|~#drvlist~0.offset| Int)) (let ((.cse34 (select .cse2 |~#drvlist~0.offset|)) (.cse33 (select .cse8 |~#drvlist~0.offset|))) (and (= |~#drvlist~0.offset| .cse33) (= .cse34 |c_ULTIMATE.start_foo_~me~1#1.base|) (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (let ((.cse35 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|))) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_77 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int))) (and (= (select v_arrayElimCell_77 |~#drvlist~0.offset|) .cse34) (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_DerPreprocessor_10) 4 v_arrayElimCell_77) |ULTIMATE.start_foo_~me~0#1.base|) .cse35))) (exists ((v_prenex_11 (Array Int Int))) (let ((.cse37 (+ .cse33 4)) (.cse36 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|))) (and (= .cse2 (store (store (store .cse36 .cse33 (select .cse2 .cse33)) .cse37 (select .cse2 .cse37)) |~#drvlist~0.offset| .cse34)) (= (select .cse36 .cse37) (select .cse35 .cse37)) (= (select .cse36 .cse33) 4)))) (= 4 (select .cse35 .cse33))))))))))) (or (and .cse0 .cse1 (or (exists ((|~#drvlist~0.offset| Int)) (and (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_80 Int) (v_prenex_11 (Array Int Int))) (let ((.cse4 (select .cse8 v_arrayElimCell_80))) (let ((.cse6 (select .cse2 v_arrayElimCell_80)) (.cse5 (+ .cse4 4)) (.cse7 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|)) (.cse3 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|))) (and (= .cse2 (store (store (store .cse3 .cse4 (select .cse2 .cse4)) .cse5 (select .cse2 .cse5)) v_arrayElimCell_80 .cse6)) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (and (= (select v_prenex_18 |~#drvlist~0.offset|) 4) (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_19) 4 v_prenex_18) |ULTIMATE.start_foo_~me~0#1.base|) .cse7) (= .cse6 (select v_prenex_18 v_arrayElimCell_80)))) (= (select .cse7 .cse5) (select .cse3 .cse5)) (= (select .cse7 .cse4) 4) (= (select .cse3 .cse4) 4))))))) (= (select .cse2 |~#drvlist~0.offset|) |c_ULTIMATE.start_foo_~me~1#1.base|))) (exists ((|~#drvlist~0.offset| Int)) (let ((.cse9 (select .cse2 |~#drvlist~0.offset|))) (and (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|)) (.cse12 (select .cse8 |~#drvlist~0.offset|))) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_77 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int))) (and (= (select v_arrayElimCell_77 |~#drvlist~0.offset|) .cse9) (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_DerPreprocessor_10) 4 v_arrayElimCell_77) |ULTIMATE.start_foo_~me~0#1.base|) .cse10))) (exists ((v_prenex_11 (Array Int Int))) (let ((.cse13 (+ .cse12 4)) (.cse11 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|))) (and (= .cse2 (store (store (store .cse11 .cse12 (select .cse2 .cse12)) .cse13 (select .cse2 .cse13)) |~#drvlist~0.offset| .cse9)) (= (select .cse11 .cse13) (select .cse10 .cse13)) (= (select .cse11 .cse12) 4)))) (= 4 (select .cse10 .cse12)) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4))))) (= .cse9 |c_ULTIMATE.start_foo_~me~1#1.base|)))))) (and .cse0 (or (and (or (exists ((|~#drvlist~0.offset| Int)) (let ((.cse15 (select .cse8 |~#drvlist~0.offset|)) (.cse18 (select .cse2 |~#drvlist~0.offset|))) (and (exists ((v_arrayElimCell_81 Int)) (let ((.cse14 (+ 4 v_arrayElimCell_81))) (and (not (= .cse14 |~#drvlist~0.offset|)) (= (select .cse8 .cse14) 0)))) (= |~#drvlist~0.offset| .cse15) (exists ((v_arrayElimCell_77 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_prenex_11 (Array Int Int)) (|ULTIMATE.start_foo_~me~0#1.base| Int)) (let ((.cse17 (+ .cse15 4)) (.cse16 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|)) (.cse19 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|))) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (= .cse2 (store (store (store .cse16 .cse15 (select .cse2 .cse15)) .cse17 (select .cse2 .cse17)) |~#drvlist~0.offset| .cse18)) (= (select .cse16 .cse17) (select .cse19 .cse17)) (= (select v_arrayElimCell_77 |~#drvlist~0.offset|) .cse18) (= (select .cse16 .cse15) 4) (= 4 (select .cse19 .cse15)) (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_DerPreprocessor_10) 4 v_arrayElimCell_77) |ULTIMATE.start_foo_~me~0#1.base|) .cse19)))) (= .cse18 |c_ULTIMATE.start_foo_~me~1#1.base|)))) (exists ((|~#drvlist~0.offset| Int)) (and (= |~#drvlist~0.offset| (select .cse8 |~#drvlist~0.offset|)) (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_81 Int)) (let ((.cse25 (+ 4 v_arrayElimCell_81))) (and (exists ((v_arrayElimCell_80 Int) (v_prenex_11 (Array Int Int))) (let ((.cse21 (select .cse8 v_arrayElimCell_80))) (let ((.cse23 (select .cse2 v_arrayElimCell_80)) (.cse22 (+ .cse21 4)) (.cse24 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|)) (.cse20 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|))) (and (= .cse2 (store (store (store .cse20 .cse21 (select .cse2 .cse21)) .cse22 (select .cse2 .cse22)) v_arrayElimCell_80 .cse23)) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (and (= (select v_prenex_18 |~#drvlist~0.offset|) 4) (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_19) 4 v_prenex_18) |ULTIMATE.start_foo_~me~0#1.base|) .cse24) (= .cse23 (select v_prenex_18 v_arrayElimCell_80)))) (= (select .cse24 .cse22) (select .cse20 .cse22)) (= (select .cse24 .cse21) 4) (= (select .cse20 .cse21) 4) (not (= .cse25 v_arrayElimCell_80)))))) (= (select .cse8 .cse25) 0)))))) (= (select .cse2 |~#drvlist~0.offset|) |c_ULTIMATE.start_foo_~me~1#1.base|)))) .cse1) (and .cse26 .cse1))) (and .cse27 .cse26 .cse0 .cse1))) (not (= |c_ULTIMATE.start_foo_~me~1#1.base| 4))) (and (or (exists ((|~#drvlist~0.offset| Int)) (let ((.cse38 (select .cse2 |~#drvlist~0.offset|)) (.cse41 (select .cse8 |~#drvlist~0.offset|))) (and (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (let ((.cse39 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|))) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_77 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int))) (and (= (select v_arrayElimCell_77 |~#drvlist~0.offset|) .cse38) (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_DerPreprocessor_10) 4 v_arrayElimCell_77) |ULTIMATE.start_foo_~me~0#1.base|) .cse39))) (exists ((v_prenex_11 (Array Int Int))) (let ((.cse42 (+ .cse41 4)) (.cse40 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|))) (and (= .cse2 (store (store (store .cse40 .cse41 (select .cse2 .cse41)) .cse42 (select .cse2 .cse42)) |~#drvlist~0.offset| .cse38)) (= (select .cse40 .cse42) (select .cse39 .cse42)) (= (select .cse40 .cse41) 4)))) (= 4 (select .cse39 .cse41)) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4))))) (= .cse38 |c_ULTIMATE.start_foo_~me~1#1.base|) (not (= |~#drvlist~0.offset| .cse41))))) (exists ((|~#drvlist~0.offset| Int)) (and (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_80 Int) (v_prenex_11 (Array Int Int))) (let ((.cse44 (select .cse8 v_arrayElimCell_80))) (let ((.cse46 (select .cse2 v_arrayElimCell_80)) (.cse45 (+ .cse44 4)) (.cse47 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|)) (.cse43 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|))) (and (= .cse2 (store (store (store .cse43 .cse44 (select .cse2 .cse44)) .cse45 (select .cse2 .cse45)) v_arrayElimCell_80 .cse46)) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (and (= (select v_prenex_18 |~#drvlist~0.offset|) 4) (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_19) 4 v_prenex_18) |ULTIMATE.start_foo_~me~0#1.base|) .cse47) (= .cse46 (select v_prenex_18 v_arrayElimCell_80)))) (= (select .cse47 .cse45) (select .cse43 .cse45)) (= (select .cse47 .cse44) 4) (= (select .cse43 .cse44) 4))))) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4)))) (= (select .cse2 |~#drvlist~0.offset|) |c_ULTIMATE.start_foo_~me~1#1.base|) (not (= |~#drvlist~0.offset| (select .cse8 |~#drvlist~0.offset|)))))) .cse0 .cse1)) (= |c_~#mutexes~0.offset| 0) (= |c_ULTIMATE.start_foo_~me~1#1.base| .cse48) (= .cse49 (+ 8 |c_ULTIMATE.start_foo_~me~1#1.offset|)) (let ((.cse59 (+ .cse49 4))) (let ((.cse58 (select .cse2 .cse49)) (.cse60 (select .cse2 .cse59))) (let ((.cse95 (or (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (let ((.cse151 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|))) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_prenex_11 (Array Int Int))) (let ((.cse150 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|))) (and (= .cse2 (store (store (store .cse150 .cse49 .cse58) .cse59 .cse60) |c_~#drvlist~0.offset| .cse48)) (= (select .cse150 .cse49) 4) (= (select .cse150 .cse59) (select .cse151 .cse59))))) (= (select .cse151 .cse49) 4) (exists ((v_arrayElimCell_77 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int))) (and (= (select v_arrayElimCell_77 |c_~#drvlist~0.offset|) .cse48) (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_DerPreprocessor_10) 4 v_arrayElimCell_77) |ULTIMATE.start_foo_~me~0#1.base|) .cse151))) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4))))) (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_80 Int) (v_prenex_11 (Array Int Int))) (let ((.cse153 (select .cse8 v_arrayElimCell_80))) (let ((.cse154 (+ .cse153 4)) (.cse156 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|)) (.cse155 (select .cse2 v_arrayElimCell_80)) (.cse152 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|))) (and (= .cse2 (store (store (store .cse152 .cse153 (select .cse2 .cse153)) .cse154 (select .cse2 .cse154)) v_arrayElimCell_80 .cse155)) (= (select .cse156 .cse154) (select .cse152 .cse154)) (= (select .cse156 .cse153) 4) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (and (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_19) 4 v_prenex_18) |ULTIMATE.start_foo_~me~0#1.base|) .cse156) (= 4 (select v_prenex_18 |c_~#drvlist~0.offset|)) (= .cse155 (select v_prenex_18 v_arrayElimCell_80)))) (= (select .cse152 .cse153) 4))))) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4)))))) (.cse50 (= |c_~#drvlist~0.offset| .cse49)) (.cse149 (exists ((v_arrayElimCell_80 Int) (|ULTIMATE.start_foo_~me~0#1.base| Int)) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (not (= |c_~#drvlist~0.offset| v_arrayElimCell_80)) (= (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|) (select .cse8 v_arrayElimCell_80)) 3) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4))))) (.cse67 (= .cse48 4))) (or (and .cse0 (or (and .cse50 (or (and (or (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_81 Int)) (let ((.cse56 (+ 4 v_arrayElimCell_81))) (and (exists ((v_arrayElimCell_80 Int) (v_prenex_11 (Array Int Int))) (let ((.cse52 (select .cse8 v_arrayElimCell_80))) (let ((.cse53 (+ .cse52 4)) (.cse55 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|)) (.cse54 (select .cse2 v_arrayElimCell_80)) (.cse51 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|))) (and (= .cse2 (store (store (store .cse51 .cse52 (select .cse2 .cse52)) .cse53 (select .cse2 .cse53)) v_arrayElimCell_80 .cse54)) (= (select .cse55 .cse53) (select .cse51 .cse53)) (= (select .cse55 .cse52) 4) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (and (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_19) 4 v_prenex_18) |ULTIMATE.start_foo_~me~0#1.base|) .cse55) (= 4 (select v_prenex_18 |c_~#drvlist~0.offset|)) (= .cse54 (select v_prenex_18 v_arrayElimCell_80)))) (= (select .cse51 .cse52) 4) (not (= .cse56 v_arrayElimCell_80)))))) (= (select .cse8 .cse56) 0)))) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4)))) (and (exists ((v_arrayElimCell_77 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_prenex_11 (Array Int Int)) (|ULTIMATE.start_foo_~me~0#1.base| Int)) (let ((.cse57 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|)) (.cse61 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|))) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (= .cse2 (store (store (store .cse57 .cse49 .cse58) .cse59 .cse60) |c_~#drvlist~0.offset| .cse48)) (= (select .cse57 .cse49) 4) (= (select v_arrayElimCell_77 |c_~#drvlist~0.offset|) .cse48) (= (select .cse57 .cse59) (select .cse61 .cse59)) (= (select .cse61 .cse49) 4) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4)) (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_DerPreprocessor_10) 4 v_arrayElimCell_77) |ULTIMATE.start_foo_~me~0#1.base|) .cse61)))) (exists ((v_arrayElimCell_81 Int)) (let ((.cse62 (+ 4 v_arrayElimCell_81))) (and (not (= .cse62 |c_~#drvlist~0.offset|)) (= (select .cse8 .cse62) 0)))))) .cse1) (and (or (and .cse1 (exists ((v_arrayElimCell_81 Int) (v_arrayElimCell_80 Int) (|ULTIMATE.start_foo_~me~0#1.base| Int)) (let ((.cse63 (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|) (select .cse8 v_arrayElimCell_80))) (.cse64 (+ 4 v_arrayElimCell_81))) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (not (= |c_~#drvlist~0.offset| v_arrayElimCell_80)) (not (= .cse63 4)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse63) .cse64) 0) (not (= .cse63 |ULTIMATE.start_foo_~me~0#1.base|)) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4)) (not (= .cse64 v_arrayElimCell_80)))))) (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_81 Int) (v_arrayElimCell_80 Int)) (let ((.cse66 (+ 4 v_arrayElimCell_81))) (and (not (= |c_~#drvlist~0.offset| v_arrayElimCell_80)) (= (select .cse65 .cse66) 0) (= (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|) (select .cse8 v_arrayElimCell_80)) 3) (not (= .cse66 v_arrayElimCell_80))))) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4))))) .cse67) (and (or (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_80 Int)) (and (not (= |c_~#drvlist~0.offset| v_arrayElimCell_80)) (exists ((v_arrayElimCell_81 Int)) (let ((.cse70 (+ 4 v_arrayElimCell_81))) (and (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 Int)) (let ((.cse81 (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_18 v_DerPreprocessor_19))) (let ((.cse69 (store (store .cse81 |ULTIMATE.start_foo_~me~0#1.base| v_DerPreprocessor_20) 4 v_DerPreprocessor_21))) (let ((.cse79 (select .cse69 |ULTIMATE.start_foo_~me~0#1.base|)) (.cse75 (select .cse8 v_arrayElimCell_80))) (let ((.cse68 (select .cse79 .cse75))) (and (= .cse68 v_DerPreprocessor_18) (= v_DerPreprocessor_19 (select .cse69 .cse68)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse68) .cse70) 0) (exists ((v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse80 (store (store (store .cse81 .cse68 v_DerPreprocessor_12) |ULTIMATE.start_foo_~me~0#1.base| v_DerPreprocessor_13) 4 .cse2))) (let ((.cse71 (select .cse80 .cse68))) (let ((.cse78 (store .cse71 v_arrayElimCell_80 (select .cse2 v_arrayElimCell_80))) (.cse76 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|)) (.cse73 (+ .cse75 4))) (let ((.cse74 (select .cse76 .cse73)) (.cse77 (select (store (store (store .cse81 .cse68 v_prenex_22) |ULTIMATE.start_foo_~me~0#1.base| v_prenex_23) 4 .cse78) .cse68)) (.cse72 (select .cse80 |ULTIMATE.start_foo_~me~0#1.base|))) (and (= v_DerPreprocessor_12 .cse71) (= (select .cse72 .cse73) .cse74) (= (store (store .cse71 .cse75 .cse68) .cse73 .cse74) .cse76) (= .cse77 v_prenex_22) (= .cse78 v_DerPreprocessor_21) (= .cse77 .cse71) (= .cse79 .cse72))))))) (= .cse68 |ULTIMATE.start_foo_~me~0#1.base|))))))) (not (= .cse70 v_arrayElimCell_80))))))) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4)))) (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_80 Int)) (and (not (= |c_~#drvlist~0.offset| v_arrayElimCell_80)) (exists ((v_arrayElimCell_81 Int)) (let ((.cse94 (+ 4 v_arrayElimCell_81))) (and (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 Int)) (let ((.cse89 (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_18 v_DerPreprocessor_19))) (let ((.cse93 (store (store .cse89 |ULTIMATE.start_foo_~me~0#1.base| v_DerPreprocessor_20) 4 v_DerPreprocessor_21))) (let ((.cse92 (select .cse93 |ULTIMATE.start_foo_~me~0#1.base|)) (.cse85 (select .cse8 v_arrayElimCell_80))) (let ((.cse84 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|)) (.cse87 (+ .cse85 4)) (.cse82 (select .cse92 .cse85))) (and (= (select .cse2 v_arrayElimCell_80) (select v_DerPreprocessor_21 v_arrayElimCell_80)) (= .cse82 v_DerPreprocessor_18) (exists ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int))) (let ((.cse88 (store (store (store .cse89 .cse82 v_prenex_20) |ULTIMATE.start_foo_~me~0#1.base| v_prenex_21) 4 v_DerPreprocessor_21))) (let ((.cse83 (select .cse88 |ULTIMATE.start_foo_~me~0#1.base|))) (let ((.cse86 (select .cse83 .cse85))) (and (= .cse83 .cse84) (= (store (store (store v_DerPreprocessor_21 v_arrayElimCell_80 (select .cse83 v_arrayElimCell_80)) .cse85 .cse86) .cse87 (select .cse83 .cse87)) .cse83) (= v_prenex_20 (select .cse88 .cse82)) (= .cse82 .cse86)))))) (exists ((v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse90 (store (store (store .cse89 .cse82 v_prenex_4) |ULTIMATE.start_foo_~me~0#1.base| v_prenex_5) 4 .cse2))) (let ((.cse91 (select .cse90 |ULTIMATE.start_foo_~me~0#1.base|))) (and (= (select .cse90 .cse82) v_prenex_4) (= .cse91 .cse92) (= (select .cse91 .cse87) (select .cse84 .cse87)))))) (= v_DerPreprocessor_19 (select .cse93 .cse82)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse82) .cse94) 0) (= .cse82 |ULTIMATE.start_foo_~me~0#1.base|))))))) (not (= .cse94 v_arrayElimCell_80))))))) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4))))) .cse67 .cse1))) (and .cse50 (or (and .cse95 .cse1) (and .cse67 .cse1 (or (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_DerPreprocessor_22 Int) (v_arrayElimCell_80 Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse108 (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_22 v_DerPreprocessor_23))) (let ((.cse96 (store (store .cse108 |ULTIMATE.start_foo_~me~0#1.base| v_DerPreprocessor_24) 4 v_DerPreprocessor_25))) (let ((.cse100 (select .cse96 |ULTIMATE.start_foo_~me~0#1.base|)) (.cse105 (select .cse8 v_arrayElimCell_80))) (let ((.cse97 (select .cse100 .cse105))) (and (not (= |c_~#drvlist~0.offset| v_arrayElimCell_80)) (= v_DerPreprocessor_23 (select .cse96 .cse97)) (= .cse97 v_DerPreprocessor_22) (= .cse97 |ULTIMATE.start_foo_~me~0#1.base|) (exists ((v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse107 (store (store (store .cse108 .cse97 v_DerPreprocessor_12) |ULTIMATE.start_foo_~me~0#1.base| v_DerPreprocessor_13) 4 .cse2))) (let ((.cse99 (select .cse107 .cse97))) (let ((.cse106 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|)) (.cse104 (+ .cse105 4)) (.cse102 (store .cse99 v_arrayElimCell_80 (select .cse2 v_arrayElimCell_80)))) (let ((.cse98 (select (store (store (store .cse108 .cse97 v_prenex_22) |ULTIMATE.start_foo_~me~0#1.base| v_prenex_23) 4 .cse102) .cse97)) (.cse101 (select .cse107 |ULTIMATE.start_foo_~me~0#1.base|)) (.cse103 (select .cse106 .cse104))) (and (= .cse98 .cse99) (= .cse100 .cse101) (= .cse99 v_DerPreprocessor_12) (= .cse98 v_prenex_22) (= v_DerPreprocessor_25 .cse102) (= .cse103 (select .cse101 .cse104)) (= (store (store .cse99 .cse105 .cse97) .cse104 .cse103) .cse106))))))))))))) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4)))) (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_DerPreprocessor_22 Int) (v_arrayElimCell_80 Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse115 (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_22 v_DerPreprocessor_23))) (let ((.cse120 (store (store .cse115 |ULTIMATE.start_foo_~me~0#1.base| v_DerPreprocessor_24) 4 v_DerPreprocessor_25))) (let ((.cse109 (select .cse120 |ULTIMATE.start_foo_~me~0#1.base|)) (.cse118 (select .cse8 v_arrayElimCell_80))) (let ((.cse113 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|)) (.cse114 (+ .cse118 4)) (.cse112 (select .cse109 .cse118))) (and (exists ((v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse111 (store (store (store .cse115 .cse112 v_prenex_4) |ULTIMATE.start_foo_~me~0#1.base| v_prenex_5) 4 .cse2))) (let ((.cse110 (select .cse111 |ULTIMATE.start_foo_~me~0#1.base|))) (and (= .cse109 .cse110) (= (select .cse111 .cse112) v_prenex_4) (= (select .cse113 .cse114) (select .cse110 .cse114)))))) (= (select .cse2 v_arrayElimCell_80) (select v_DerPreprocessor_25 v_arrayElimCell_80)) (exists ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int))) (let ((.cse116 (store (store (store .cse115 .cse112 v_prenex_20) |ULTIMATE.start_foo_~me~0#1.base| v_prenex_21) 4 v_DerPreprocessor_25))) (let ((.cse117 (select .cse116 |ULTIMATE.start_foo_~me~0#1.base|))) (let ((.cse119 (select .cse117 .cse118))) (and (= (select .cse116 .cse112) v_prenex_20) (= .cse117 .cse113) (= (store (store (store v_DerPreprocessor_25 v_arrayElimCell_80 (select .cse117 v_arrayElimCell_80)) .cse118 .cse119) .cse114 (select .cse117 .cse114)) .cse117) (= .cse119 .cse112)))))) (not (= |c_~#drvlist~0.offset| v_arrayElimCell_80)) (= v_DerPreprocessor_23 (select .cse120 .cse112)) (= .cse112 v_DerPreprocessor_22) (= .cse112 |ULTIMATE.start_foo_~me~0#1.base|))))))) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4)))))) (and .cse67 (or (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_80 Int)) (and (not (= |c_~#drvlist~0.offset| v_arrayElimCell_80)) (= (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|) (select .cse8 v_arrayElimCell_80)) 3))) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4)))) (and (exists ((v_arrayElimCell_80 Int) (|ULTIMATE.start_foo_~me~0#1.base| Int)) (let ((.cse121 (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|) (select .cse8 v_arrayElimCell_80)))) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (not (= |c_~#drvlist~0.offset| v_arrayElimCell_80)) (not (= .cse121 4)) (not (= .cse121 |ULTIMATE.start_foo_~me~0#1.base|)) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4))))) .cse1))))))) (and .cse95 .cse0 .cse1) (and .cse50 (or (and (or (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_DerPreprocessor_26 Int) (v_arrayElimCell_81 Int) (v_arrayElimCell_80 Int) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse132 (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_26 v_DerPreprocessor_27))) (let ((.cse134 (store (store .cse132 |ULTIMATE.start_foo_~me~0#1.base| v_DerPreprocessor_28) 4 v_DerPreprocessor_29))) (let ((.cse122 (select .cse134 |ULTIMATE.start_foo_~me~0#1.base|)) (.cse128 (select .cse8 v_arrayElimCell_80))) (let ((.cse129 (select .cse122 .cse128))) (and (not (= |c_~#drvlist~0.offset| v_arrayElimCell_80)) (exists ((v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse133 (store (store (store .cse132 .cse129 v_DerPreprocessor_12) |ULTIMATE.start_foo_~me~0#1.base| v_DerPreprocessor_13) 4 .cse2))) (let ((.cse124 (select .cse133 .cse129))) (let ((.cse130 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|)) (.cse126 (+ .cse128 4)) (.cse131 (store .cse124 v_arrayElimCell_80 (select .cse2 v_arrayElimCell_80)))) (let ((.cse123 (select .cse133 |ULTIMATE.start_foo_~me~0#1.base|)) (.cse127 (select (store (store (store .cse132 .cse129 v_prenex_22) |ULTIMATE.start_foo_~me~0#1.base| v_prenex_23) 4 .cse131) .cse129)) (.cse125 (select .cse130 .cse126))) (and (= .cse122 .cse123) (= v_DerPreprocessor_12 .cse124) (= .cse125 (select .cse123 .cse126)) (= v_prenex_22 .cse127) (= .cse124 .cse127) (= (store (store .cse124 .cse128 .cse129) .cse126 .cse125) .cse130) (= v_DerPreprocessor_29 .cse131))))))) (= |ULTIMATE.start_foo_~me~0#1.base| .cse129) (= v_DerPreprocessor_26 .cse129) (= (select (select |c_#memory_$Pointer$#1.offset| .cse129) (+ 4 v_arrayElimCell_81)) 0) (= (select .cse134 .cse129) v_DerPreprocessor_27))))))) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4)))) (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_DerPreprocessor_26 Int) (v_arrayElimCell_81 Int) (v_arrayElimCell_80 Int) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse141 (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_26 v_DerPreprocessor_27))) (let ((.cse142 (store (store .cse141 |ULTIMATE.start_foo_~me~0#1.base| v_DerPreprocessor_28) 4 v_DerPreprocessor_29))) (let ((.cse139 (select .cse142 |ULTIMATE.start_foo_~me~0#1.base|)) (.cse146 (select .cse8 v_arrayElimCell_80))) (let ((.cse136 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|)) (.cse137 (+ .cse146 4)) (.cse135 (select .cse139 .cse146))) (and (not (= |c_~#drvlist~0.offset| v_arrayElimCell_80)) (= |ULTIMATE.start_foo_~me~0#1.base| .cse135) (exists ((v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse140 (store (store (store .cse141 .cse135 v_prenex_4) |ULTIMATE.start_foo_~me~0#1.base| v_prenex_5) 4 .cse2))) (let ((.cse138 (select .cse140 |ULTIMATE.start_foo_~me~0#1.base|))) (and (= (select .cse136 .cse137) (select .cse138 .cse137)) (= .cse138 .cse139) (= v_prenex_4 (select .cse140 .cse135)))))) (= (select .cse2 v_arrayElimCell_80) (select v_DerPreprocessor_29 v_arrayElimCell_80)) (= v_DerPreprocessor_26 .cse135) (= (select (select |c_#memory_$Pointer$#1.offset| .cse135) (+ 4 v_arrayElimCell_81)) 0) (= (select .cse142 .cse135) v_DerPreprocessor_27) (exists ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int))) (let ((.cse144 (store (store (store .cse141 .cse135 v_prenex_20) |ULTIMATE.start_foo_~me~0#1.base| v_prenex_21) 4 v_DerPreprocessor_29))) (let ((.cse145 (select .cse144 |ULTIMATE.start_foo_~me~0#1.base|))) (let ((.cse143 (select .cse145 .cse146))) (and (= .cse143 .cse135) (= v_prenex_20 (select .cse144 .cse135)) (= .cse145 .cse136) (= .cse145 (store (store (store v_DerPreprocessor_29 v_arrayElimCell_80 (select .cse145 v_arrayElimCell_80)) .cse146 .cse143) .cse137 (select .cse145 .cse137)))))))))))))) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4))))) .cse0 .cse67 .cse1) (and .cse95 .cse27 .cse0 .cse1) (and (let ((.cse147 (and .cse149 .cse0))) (or (and (or .cse147 (and (exists ((v_arrayElimCell_81 Int) (v_arrayElimCell_80 Int) (|ULTIMATE.start_foo_~me~0#1.base| Int)) (let ((.cse148 (select (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|) (select .cse8 v_arrayElimCell_80)))) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (not (= |c_~#drvlist~0.offset| v_arrayElimCell_80)) (not (= .cse148 4)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse148) (+ 4 v_arrayElimCell_81)) 0) (not (= .cse148 |ULTIMATE.start_foo_~me~0#1.base|)) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4))))) .cse0)) .cse1) .cse147)) .cse67))) (and .cse50 .cse149 .cse67))))) (= 3 |c_~#mutexes~0.base|) (= |c_~#drvlist~0.base| 4) (or (and (not (= |c_ULTIMATE.start_mutex_lock_~m#1.base| 4)) (let ((.cse157 (or (exists ((|~#drvlist~0.offset| Int)) (let ((.cse181 (select .cse2 |~#drvlist~0.offset|)) (.cse180 (select .cse8 |~#drvlist~0.offset|))) (and (= |~#drvlist~0.offset| .cse180) (= |c_ULTIMATE.start_mutex_lock_~m#1.base| .cse181) (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (let ((.cse182 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|))) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_77 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int))) (and (= (select v_arrayElimCell_77 |~#drvlist~0.offset|) .cse181) (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_DerPreprocessor_10) 4 v_arrayElimCell_77) |ULTIMATE.start_foo_~me~0#1.base|) .cse182))) (exists ((v_prenex_11 (Array Int Int))) (let ((.cse184 (+ .cse180 4)) (.cse183 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|))) (and (= .cse2 (store (store (store .cse183 .cse180 (select .cse2 .cse180)) .cse184 (select .cse2 .cse184)) |~#drvlist~0.offset| .cse181)) (= (select .cse183 .cse184) (select .cse182 .cse184)) (= (select .cse183 .cse180) 4)))) (= 4 (select .cse182 .cse180)))))))) (exists ((|~#drvlist~0.offset| Int)) (and (= |~#drvlist~0.offset| (select .cse8 |~#drvlist~0.offset|)) (= |c_ULTIMATE.start_mutex_lock_~m#1.base| (select .cse2 |~#drvlist~0.offset|)) (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_80 Int) (v_prenex_11 (Array Int Int))) (let ((.cse186 (select .cse8 v_arrayElimCell_80))) (let ((.cse188 (select .cse2 v_arrayElimCell_80)) (.cse187 (+ .cse186 4)) (.cse189 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|)) (.cse185 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|))) (and (= .cse2 (store (store (store .cse185 .cse186 (select .cse2 .cse186)) .cse187 (select .cse2 .cse187)) v_arrayElimCell_80 .cse188)) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (and (= (select v_prenex_18 |~#drvlist~0.offset|) 4) (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_19) 4 v_prenex_18) |ULTIMATE.start_foo_~me~0#1.base|) .cse189) (= .cse188 (select v_prenex_18 v_arrayElimCell_80)))) (= (select .cse189 .cse187) (select .cse185 .cse187)) (= (select .cse189 .cse186) 4) (= (select .cse185 .cse186) 4)))))))))))) (or (and .cse157 .cse27 .cse0 .cse1) (and (or (exists ((|~#drvlist~0.offset| Int)) (and (= |c_ULTIMATE.start_mutex_lock_~m#1.base| (select .cse2 |~#drvlist~0.offset|)) (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_80 Int) (v_prenex_11 (Array Int Int))) (let ((.cse159 (select .cse8 v_arrayElimCell_80))) (let ((.cse161 (select .cse2 v_arrayElimCell_80)) (.cse160 (+ .cse159 4)) (.cse162 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|)) (.cse158 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|))) (and (= .cse2 (store (store (store .cse158 .cse159 (select .cse2 .cse159)) .cse160 (select .cse2 .cse160)) v_arrayElimCell_80 .cse161)) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (and (= (select v_prenex_18 |~#drvlist~0.offset|) 4) (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_19) 4 v_prenex_18) |ULTIMATE.start_foo_~me~0#1.base|) .cse162) (= .cse161 (select v_prenex_18 v_arrayElimCell_80)))) (= (select .cse162 .cse160) (select .cse158 .cse160)) (= (select .cse162 .cse159) 4) (= (select .cse158 .cse159) 4))))))))) (exists ((|~#drvlist~0.offset| Int)) (let ((.cse163 (select .cse2 |~#drvlist~0.offset|))) (and (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (let ((.cse164 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|)) (.cse166 (select .cse8 |~#drvlist~0.offset|))) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_77 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int))) (and (= (select v_arrayElimCell_77 |~#drvlist~0.offset|) .cse163) (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_DerPreprocessor_10) 4 v_arrayElimCell_77) |ULTIMATE.start_foo_~me~0#1.base|) .cse164))) (exists ((v_prenex_11 (Array Int Int))) (let ((.cse167 (+ .cse166 4)) (.cse165 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|))) (and (= .cse2 (store (store (store .cse165 .cse166 (select .cse2 .cse166)) .cse167 (select .cse2 .cse167)) |~#drvlist~0.offset| .cse163)) (= (select .cse165 .cse167) (select .cse164 .cse167)) (= (select .cse165 .cse166) 4)))) (= 4 (select .cse164 .cse166)) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4))))) (= |c_ULTIMATE.start_mutex_lock_~m#1.base| .cse163))))) .cse0 .cse1) (and (or (and .cse157 .cse1) (and (or (exists ((|~#drvlist~0.offset| Int)) (let ((.cse169 (select .cse8 |~#drvlist~0.offset|)) (.cse172 (select .cse2 |~#drvlist~0.offset|))) (and (exists ((v_arrayElimCell_81 Int)) (let ((.cse168 (+ 4 v_arrayElimCell_81))) (and (not (= .cse168 |~#drvlist~0.offset|)) (= (select .cse8 .cse168) 0)))) (= |~#drvlist~0.offset| .cse169) (exists ((v_arrayElimCell_77 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_prenex_11 (Array Int Int)) (|ULTIMATE.start_foo_~me~0#1.base| Int)) (let ((.cse171 (+ .cse169 4)) (.cse170 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|)) (.cse173 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|))) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (= .cse2 (store (store (store .cse170 .cse169 (select .cse2 .cse169)) .cse171 (select .cse2 .cse171)) |~#drvlist~0.offset| .cse172)) (= (select .cse170 .cse171) (select .cse173 .cse171)) (= (select v_arrayElimCell_77 |~#drvlist~0.offset|) .cse172) (= (select .cse170 .cse169) 4) (= 4 (select .cse173 .cse169)) (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_DerPreprocessor_10) 4 v_arrayElimCell_77) |ULTIMATE.start_foo_~me~0#1.base|) .cse173)))) (= |c_ULTIMATE.start_mutex_lock_~m#1.base| .cse172)))) (exists ((|~#drvlist~0.offset| Int)) (and (= |~#drvlist~0.offset| (select .cse8 |~#drvlist~0.offset|)) (= |c_ULTIMATE.start_mutex_lock_~m#1.base| (select .cse2 |~#drvlist~0.offset|)) (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_81 Int)) (let ((.cse179 (+ 4 v_arrayElimCell_81))) (and (exists ((v_arrayElimCell_80 Int) (v_prenex_11 (Array Int Int))) (let ((.cse175 (select .cse8 v_arrayElimCell_80))) (let ((.cse177 (select .cse2 v_arrayElimCell_80)) (.cse176 (+ .cse175 4)) (.cse178 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|)) (.cse174 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|))) (and (= .cse2 (store (store (store .cse174 .cse175 (select .cse2 .cse175)) .cse176 (select .cse2 .cse176)) v_arrayElimCell_80 .cse177)) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (and (= (select v_prenex_18 |~#drvlist~0.offset|) 4) (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_19) 4 v_prenex_18) |ULTIMATE.start_foo_~me~0#1.base|) .cse178) (= .cse177 (select v_prenex_18 v_arrayElimCell_80)))) (= (select .cse178 .cse176) (select .cse174 .cse176)) (= (select .cse178 .cse175) 4) (= (select .cse174 .cse175) 4) (not (= .cse179 v_arrayElimCell_80)))))) (= (select .cse8 .cse179) 0))))))))) .cse1)) .cse0)))) (and .cse0 (or (exists ((|~#drvlist~0.offset| Int)) (let ((.cse190 (select .cse2 |~#drvlist~0.offset|)) (.cse193 (select .cse8 |~#drvlist~0.offset|))) (and (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (let ((.cse191 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|))) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_77 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int))) (and (= (select v_arrayElimCell_77 |~#drvlist~0.offset|) .cse190) (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_DerPreprocessor_10) 4 v_arrayElimCell_77) |ULTIMATE.start_foo_~me~0#1.base|) .cse191))) (exists ((v_prenex_11 (Array Int Int))) (let ((.cse194 (+ .cse193 4)) (.cse192 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|))) (and (= .cse2 (store (store (store .cse192 .cse193 (select .cse2 .cse193)) .cse194 (select .cse2 .cse194)) |~#drvlist~0.offset| .cse190)) (= (select .cse192 .cse194) (select .cse191 .cse194)) (= (select .cse192 .cse193) 4)))) (= 4 (select .cse191 .cse193)) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4))))) (= |c_ULTIMATE.start_mutex_lock_~m#1.base| .cse190) (not (= |~#drvlist~0.offset| .cse193))))) (exists ((|~#drvlist~0.offset| Int)) (and (exists ((|ULTIMATE.start_foo_~me~0#1.base| Int)) (and (not (= 3 |ULTIMATE.start_foo_~me~0#1.base|)) (exists ((v_arrayElimCell_80 Int) (v_prenex_11 (Array Int Int))) (let ((.cse196 (select .cse8 v_arrayElimCell_80))) (let ((.cse198 (select .cse2 v_arrayElimCell_80)) (.cse197 (+ .cse196 4)) (.cse199 (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base|)) (.cse195 (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_11) 4 .cse2) |ULTIMATE.start_foo_~me~0#1.base|))) (and (= .cse2 (store (store (store .cse195 .cse196 (select .cse2 .cse196)) .cse197 (select .cse2 .cse197)) v_arrayElimCell_80 .cse198)) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_18 (Array Int Int))) (and (= (select v_prenex_18 |~#drvlist~0.offset|) 4) (= (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_foo_~me~0#1.base| v_prenex_19) 4 v_prenex_18) |ULTIMATE.start_foo_~me~0#1.base|) .cse199) (= .cse198 (select v_prenex_18 v_arrayElimCell_80)))) (= (select .cse199 .cse197) (select .cse195 .cse197)) (= (select .cse199 .cse196) 4) (= (select .cse195 .cse196) 4))))) (not (= |ULTIMATE.start_foo_~me~0#1.base| 4)))) (= |c_ULTIMATE.start_mutex_lock_~m#1.base| (select .cse2 |~#drvlist~0.offset|)) (not (= |~#drvlist~0.offset| (select .cse8 |~#drvlist~0.offset|)))))) .cse1))))) is different from false [2024-11-27 20:32:44,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:33:36,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:33:36,561 INFO L93 Difference]: Finished difference Result 321 states and 387 transitions. [2024-11-27 20:33:36,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-27 20:33:36,563 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 26 states have internal predecessors, (51), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 35 [2024-11-27 20:33:36,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:33:36,566 INFO L225 Difference]: With dead ends: 321 [2024-11-27 20:33:36,566 INFO L226 Difference]: Without dead ends: 192 [2024-11-27 20:33:36,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 381.5s TimeCoverageRelationStatistics Valid=641, Invalid=4577, Unknown=46, NotChecked=286, Total=5550 [2024-11-27 20:33:36,570 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 153 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 43 mSolverCounterUnsat, 41 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 160.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 41 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 161.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:33:36,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 766 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1371 Invalid, 41 Unknown, 65 Unchecked, 161.7s Time] [2024-11-27 20:33:36,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-27 20:33:36,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 163. [2024-11-27 20:33:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 124 states have (on average 1.1693548387096775) internal successors, (145), 130 states have internal predecessors, (145), 20 states have call successors, (20), 14 states have call predecessors, (20), 16 states have return successors, (25), 18 states have call predecessors, (25), 20 states have call successors, (25) [2024-11-27 20:33:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 190 transitions. [2024-11-27 20:33:36,639 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 190 transitions. Word has length 35 [2024-11-27 20:33:36,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:33:36,639 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 190 transitions. [2024-11-27 20:33:36,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 26 states have internal predecessors, (51), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-27 20:33:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 190 transitions. [2024-11-27 20:33:36,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-27 20:33:36,642 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:33:36,642 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:33:36,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 20:33:36,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:33:36,845 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:33:36,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:33:36,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1950288780, now seen corresponding path program 2 times [2024-11-27 20:33:36,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:33:36,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197635951] [2024-11-27 20:33:36,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:33:36,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:33:36,901 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:33:36,902 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:33:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:33:43,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:33:43,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197635951] [2024-11-27 20:33:43,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197635951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:33:43,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553298945] [2024-11-27 20:33:43,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:33:43,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:33:43,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:33:43,916 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:33:43,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dbde73d-5613-43cd-84fc-e7545fcec2bf/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:33:44,119 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:33:44,119 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:33:44,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-11-27 20:33:44,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:33:44,829 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-27 20:33:44,829 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 [2024-11-27 20:33:45,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 59 [2024-11-27 20:33:46,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2024-11-27 20:33:46,042 INFO L349 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2024-11-27 20:33:46,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 30 [2024-11-27 20:33:46,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:33:46,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:33:46,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 40 [2024-11-27 20:33:46,093 INFO L349 Elim1Store]: treesize reduction 26, result has 43.5 percent of original size [2024-11-27 20:33:46,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 36 [2024-11-27 20:33:46,109 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2024-11-27 20:33:46,113 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 8 treesize of output 7 [2024-11-27 20:33:46,126 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 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-27 20:33:47,121 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 20:33:47,122 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 [2024-11-27 20:34:10,701 INFO L349 Elim1Store]: treesize reduction 164, result has 7.3 percent of original size [2024-11-27 20:34:10,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 302 treesize of output 406 [2024-11-27 20:34:11,260 INFO L349 Elim1Store]: treesize reduction 362, result has 16.0 percent of original size [2024-11-27 20:34:11,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 428 treesize of output 534 [2024-11-27 20:34:11,355 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:11,639 INFO L349 Elim1Store]: treesize reduction 190, result has 17.0 percent of original size [2024-11-27 20:34:11,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 199 treesize of output 312 [2024-11-27 20:34:11,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 37 treesize of output 64 [2024-11-27 20:34:13,912 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-27 20:34:13,913 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 1 case distinctions, treesize of input 21 treesize of output 1 [2024-11-27 20:34:13,935 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-27 20:34:13,935 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 1 case distinctions, treesize of input 21 treesize of output 1 [2024-11-27 20:34:16,569 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:16,631 INFO L349 Elim1Store]: treesize reduction 143, result has 3.4 percent of original size [2024-11-27 20:34:16,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 192 treesize of output 170 [2024-11-27 20:34:16,837 INFO L349 Elim1Store]: treesize reduction 77, result has 1.3 percent of original size [2024-11-27 20:34:16,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 18 [2024-11-27 20:34:17,231 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:17,250 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:17,257 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:17,257 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:17,267 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:20,660 INFO L349 Elim1Store]: treesize reduction 496, result has 19.0 percent of original size [2024-11-27 20:34:20,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 33 case distinctions, treesize of input 1022 treesize of output 1755 [2024-11-27 20:34:30,374 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:30,375 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:30,405 INFO L349 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2024-11-27 20:34:30,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 23 [2024-11-27 20:34:30,610 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:30,610 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:30,641 INFO L349 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2024-11-27 20:34:30,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 23 [2024-11-27 20:34:30,779 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:30,779 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:30,818 INFO L349 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2024-11-27 20:34:30,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 23 [2024-11-27 20:34:30,950 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:30,951 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:30,994 INFO L349 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2024-11-27 20:34:30,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 23 [2024-11-27 20:34:31,092 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:31,153 INFO L349 Elim1Store]: treesize reduction 121, result has 0.8 percent of original size [2024-11-27 20:34:31,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 65 treesize of output 23 [2024-11-27 20:34:33,747 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:33,748 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:33,749 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:33,757 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-27 20:34:33,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 16 [2024-11-27 20:34:35,535 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:35,536 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:35,536 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:35,544 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-27 20:34:35,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 16 [2024-11-27 20:34:44,980 INFO L349 Elim1Store]: treesize reduction 366, result has 22.8 percent of original size [2024-11-27 20:34:44,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 254 treesize of output 375 [2024-11-27 20:34:48,498 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:48,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 18 [2024-11-27 20:34:48,602 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2024-11-27 20:34:48,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 18 [2024-11-27 20:34:48,641 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:48,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 18 [2024-11-27 20:34:48,692 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2024-11-27 20:34:48,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 18 [2024-11-27 20:34:48,957 INFO L349 Elim1Store]: treesize reduction 75, result has 1.3 percent of original size [2024-11-27 20:34:48,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 18 [2024-11-27 20:34:49,008 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:49,009 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:49,014 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-27 20:34:49,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 18 [2024-11-27 20:34:49,146 INFO L349 Elim1Store]: treesize reduction 75, result has 1.3 percent of original size [2024-11-27 20:34:49,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 18 [2024-11-27 20:34:49,194 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:49,195 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:49,201 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-27 20:34:49,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 18 [2024-11-27 20:34:49,406 INFO L349 Elim1Store]: treesize reduction 75, result has 1.3 percent of original size [2024-11-27 20:34:49,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 18 [2024-11-27 20:34:49,458 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:49,459 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:49,465 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-27 20:34:49,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 18 [2024-11-27 20:34:49,554 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:49,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-27 20:34:49,630 INFO L349 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2024-11-27 20:34:49,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 13 [2024-11-27 20:34:49,758 INFO L349 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2024-11-27 20:34:49,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 13 [2024-11-27 20:34:49,839 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:49,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-27 20:34:50,067 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:50,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 18 [2024-11-27 20:34:50,147 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2024-11-27 20:34:50,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 18 [2024-11-27 20:34:50,229 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2024-11-27 20:34:50,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 18 [2024-11-27 20:34:50,267 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:50,268 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:34:50,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 18