./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/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_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:18:17,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:18:17,895 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-27 23:18:17,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:18:17,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:18:17,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:18:17,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:18:17,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:18:17,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:18:17,942 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:18:17,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:18:17,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:18:17,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:18:17,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:18:17,944 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:18:17,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:18:17,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:18:17,944 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:18:17,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:18:17,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:18:17,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:18:17,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:18:17,945 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 23:18:17,945 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 23:18:17,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:18:17,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:18:17,946 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 23:18:17,946 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 23:18:17,946 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:18:17,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:18:17,946 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:18:17,946 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:18:17,947 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:18:17,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:18:17,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:18:17,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:18:17,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:18:17,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:18:17,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:18:17,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:18:17,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:18:17,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:18:17,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:18:17,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:18:17,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:18:17,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:18:17,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:18:17,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:18:17,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:18:17,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:18:17,950 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_38a8c699-cf75-428e-956e-20f6d40a22e9/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 valid-memcleanup) ) 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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2024-11-27 23:18:18,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:18:18,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:18:18,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:18:18,267 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:18:18,267 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:18:18,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-27 23:18:21,666 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/data/68f6a9936/e54ee4e21a994fb3a6e4b9af017feaff/FLAGcab5322fc [2024-11-27 23:18:22,107 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:18:22,111 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-27 23:18:22,139 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/data/68f6a9936/e54ee4e21a994fb3a6e4b9af017feaff/FLAGcab5322fc [2024-11-27 23:18:22,164 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/data/68f6a9936/e54ee4e21a994fb3a6e4b9af017feaff [2024-11-27 23:18:22,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:18:22,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:18:22,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:18:22,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:18:22,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:18:22,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:18:22" (1/1) ... [2024-11-27 23:18:22,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa34941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:18:22, skipping insertion in model container [2024-11-27 23:18:22,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:18:22" (1/1) ... [2024-11-27 23:18:22,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:18:22,799 WARN L609 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2024-11-27 23:18:22,800 WARN L609 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2024-11-27 23:18:22,802 WARN L609 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2024-11-27 23:18:22,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:18:22,884 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-27 23:18:22,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@c75d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:18:22, skipping insertion in model container [2024-11-27 23:18:22,885 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:18:22,885 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-27 23:18:22,887 INFO L158 Benchmark]: Toolchain (without parser) took 716.37ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 75.9MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 23:18:22,888 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 117.4MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:18:22,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 712.81ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 75.9MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 23:18:22,890 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.72ms. Allocated memory is still 117.4MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 712.81ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 75.9MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 860]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/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_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:18:25,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:18:26,053 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-27 23:18:26,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:18:26,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:18:26,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:18:26,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:18:26,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:18:26,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:18:26,114 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:18:26,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:18:26,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:18:26,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:18:26,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:18:26,118 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:18:26,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:18:26,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:18:26,118 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:18:26,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:18:26,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:18:26,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:18:26,119 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:18:26,119 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 23:18:26,119 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 23:18:26,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:18:26,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:18:26,120 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 23:18:26,120 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 23:18:26,120 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 23:18:26,120 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 23:18:26,120 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:18:26,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:18:26,122 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:18:26,122 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:18:26,122 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:18:26,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:18:26,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:18:26,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:18:26,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:18:26,122 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:18:26,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:18:26,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:18:26,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:18:26,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:18:26,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:18:26,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:18:26,123 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 23:18:26,123 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 23:18:26,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:18:26,123 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:18:26,123 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:18:26,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:18:26,126 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_38a8c699-cf75-428e-956e-20f6d40a22e9/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 valid-memcleanup) ) 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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2024-11-27 23:18:26,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:18:26,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:18:26,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:18:26,533 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:18:26,534 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:18:26,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-27 23:18:29,688 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/data/fc744164a/f30f981260a44c4895b3fac90fb21459/FLAG2bea6cdb6 [2024-11-27 23:18:30,080 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:18:30,080 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-27 23:18:30,102 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/data/fc744164a/f30f981260a44c4895b3fac90fb21459/FLAG2bea6cdb6 [2024-11-27 23:18:30,276 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/data/fc744164a/f30f981260a44c4895b3fac90fb21459 [2024-11-27 23:18:30,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:18:30,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:18:30,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:18:30,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:18:30,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:18:30,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:18:30" (1/1) ... [2024-11-27 23:18:30,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cbe46f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:18:30, skipping insertion in model container [2024-11-27 23:18:30,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:18:30" (1/1) ... [2024-11-27 23:18:30,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:18:30,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:18:30,791 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-27 23:18:30,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:18:30,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:18:30,901 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:18:30,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:18:31,029 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:18:31,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:18:31 WrapperNode [2024-11-27 23:18:31,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:18:31,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:18:31,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:18:31,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:18:31,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:18:31" (1/1) ... [2024-11-27 23:18:31,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:18:31" (1/1) ... [2024-11-27 23:18:31,106 INFO L138 Inliner]: procedures = 235, calls = 76, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 116 [2024-11-27 23:18:31,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:18:31,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:18:31,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:18:31,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:18:31,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:18:31" (1/1) ... [2024-11-27 23:18:31,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:18:31" (1/1) ... [2024-11-27 23:18:31,125 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:18:31" (1/1) ... [2024-11-27 23:18:31,195 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2024-11-27 23:18:31,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:18:31" (1/1) ... [2024-11-27 23:18:31,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:18:31" (1/1) ... [2024-11-27 23:18:31,208 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:18:31" (1/1) ... [2024-11-27 23:18:31,209 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:18:31" (1/1) ... [2024-11-27 23:18:31,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:18:31" (1/1) ... [2024-11-27 23:18:31,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:18:31" (1/1) ... [2024-11-27 23:18:31,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:18:31" (1/1) ... [2024-11-27 23:18:31,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:18:31,222 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:18:31,223 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:18:31,223 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:18:31,224 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:18:31" (1/1) ... [2024-11-27 23:18:31,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:18:31,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:18:31,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:18:31,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:18:31,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-27 23:18:31,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-27 23:18:31,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 23:18:31,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 23:18:31,289 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2024-11-27 23:18:31,290 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2024-11-27 23:18:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 23:18:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-27 23:18:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-27 23:18:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-27 23:18:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-27 23:18:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 23:18:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-27 23:18:31,290 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2024-11-27 23:18:31,291 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2024-11-27 23:18:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-27 23:18:31,291 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-27 23:18:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 23:18:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:18:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 23:18:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 23:18:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-11-27 23:18:31,292 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-11-27 23:18:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:18:31,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:18:31,447 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:18:31,449 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:18:32,045 INFO L? ?]: Removed 69 outVars from TransFormulas that were not future-live. [2024-11-27 23:18:32,045 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:18:32,063 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:18:32,063 INFO L312 CfgBuilder]: Removed 23 assume(true) statements. [2024-11-27 23:18:32,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:18:32 BoogieIcfgContainer [2024-11-27 23:18:32,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:18:32,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:18:32,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:18:32,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:18:32,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:18:30" (1/3) ... [2024-11-27 23:18:32,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d48e420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:18:32, skipping insertion in model container [2024-11-27 23:18:32,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:18:31" (2/3) ... [2024-11-27 23:18:32,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d48e420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:18:32, skipping insertion in model container [2024-11-27 23:18:32,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:18:32" (3/3) ... [2024-11-27 23:18:32,090 INFO L128 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2024-11-27 23:18:32,104 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:18:32,105 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bubble_sort_linux-2.i that has 5 procedures, 122 locations, 1 initial locations, 23 loop locations, and 2 error locations. [2024-11-27 23:18:32,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:18:32,175 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=None, 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;@238802b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:18:32,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 23:18:32,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 92 states have (on average 1.7391304347826086) internal successors, (160), 112 states have internal predecessors, (160), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-27 23:18:32,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-27 23:18:32,188 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:18:32,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:18:32,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-27 23:18:32,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:18:32,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1579504552, now seen corresponding path program 1 times [2024-11-27 23:18:32,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:18:32,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [326272252] [2024-11-27 23:18:32,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:18:32,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:18:32,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:18:32,210 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:18:32,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 23:18:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:18:32,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 23:18:32,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:18:32,359 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 23:18:32,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:18:32,359 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:18:32,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326272252] [2024-11-27 23:18:32,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326272252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:18:32,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:18:32,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:18:32,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58590781] [2024-11-27 23:18:32,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:18:32,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 23:18:32,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:18:32,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 23:18:32,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 23:18:32,399 INFO L87 Difference]: Start difference. First operand has 122 states, 92 states have (on average 1.7391304347826086) internal successors, (160), 112 states have internal predecessors, (160), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:18:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:18:32,429 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2024-11-27 23:18:32,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 23:18:32,432 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-27 23:18:32,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:18:32,439 INFO L225 Difference]: With dead ends: 117 [2024-11-27 23:18:32,440 INFO L226 Difference]: Without dead ends: 115 [2024-11-27 23:18:32,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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 23:18:32,447 INFO L435 NwaCegarLoop]: 139 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, 139 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 23:18:32,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:18:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-27 23:18:32,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-27 23:18:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 104 states have internal predecessors, (110), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 23:18:32,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2024-11-27 23:18:32,497 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 11 [2024-11-27 23:18:32,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:18:32,497 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2024-11-27 23:18:32,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:18:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2024-11-27 23:18:32,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-27 23:18:32,499 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:18:32,499 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] [2024-11-27 23:18:32,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 23:18:32,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:18:32,700 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-27 23:18:32,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:18:32,700 INFO L85 PathProgramCache]: Analyzing trace with hash 210280168, now seen corresponding path program 1 times [2024-11-27 23:18:32,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:18:32,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1130470947] [2024-11-27 23:18:32,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:18:32,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:18:32,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:18:32,705 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:18:32,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 23:18:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:18:32,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 23:18:32,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:18:33,023 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 23:18:33,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:18:33,023 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:18:33,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130470947] [2024-11-27 23:18:33,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130470947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:18:33,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:18:33,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:18:33,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753896111] [2024-11-27 23:18:33,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:18:33,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:18:33,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:18:33,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:18:33,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:18:33,029 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:18:33,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:18:33,258 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2024-11-27 23:18:33,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:18:33,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-27 23:18:33,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:18:33,262 INFO L225 Difference]: With dead ends: 114 [2024-11-27 23:18:33,263 INFO L226 Difference]: Without dead ends: 114 [2024-11-27 23:18:33,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:18:33,264 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 180 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:18:33,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 261 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:18:33,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-27 23:18:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-27 23:18:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 103 states have internal predecessors, (109), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-27 23:18:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2024-11-27 23:18:33,284 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 22 [2024-11-27 23:18:33,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:18:33,285 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2024-11-27 23:18:33,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:18:33,285 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2024-11-27 23:18:33,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-27 23:18:33,289 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:18:33,290 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] [2024-11-27 23:18:33,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 23:18:33,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:18:33,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-27 23:18:33,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:18:33,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2017392610, now seen corresponding path program 1 times [2024-11-27 23:18:33,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:18:33,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2108354268] [2024-11-27 23:18:33,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:18:33,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:18:33,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:18:33,501 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:18:33,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 23:18:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:18:33,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-27 23:18:33,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:18:33,747 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 23:18:33,750 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 13 [2024-11-27 23:18:33,856 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 23:18:33,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2024-11-27 23:18:33,921 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 23:18:33,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2024-11-27 23:18:34,021 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-11-27 23:18:34,021 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 23:18:34,106 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 23:18:34,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2024-11-27 23:18:34,183 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 23:18:34,206 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 23:18:34,298 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 23:18:38,756 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-11-27 23:18:38,756 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 23:18:38,826 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 23:18:39,599 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-27 23:18:39,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 30 [2024-11-27 23:18:41,844 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select |c_#memory_$Pointer$#1.base| (_ bv3 32)))) (or (exists ((v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_7| (_ BitVec 32)) (v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_7| (_ BitVec 32))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_arrayElimArr_2) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_1) (_ bv3 32) v_arrayElimArr_2) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_list_add___list_add_~new#1.offset_7| (_ bv3 32)) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|) (_ bv3 32))) (_ bv3 32)) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse0) (= (select v_arrayElimArr_2 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_7|)) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (exists ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_7| (_ BitVec 32))) (and (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select v_DerPreprocessor_13 |v_list_add___list_add_~new#1.offset_7|)) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_12) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_13) (_ bv3 32)) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select v_DerPreprocessor_13 (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|)) (_ bv3 32)))) (exists ((|v_list_add___list_add_~next#1.base_7| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_7| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_7| (_ BitVec 32)) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_8 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_7|)) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= (store (select (store (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_8) |v_list_add___list_add_~next#1.base_7| v_arrayElimArr_8) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_7) (_ bv3 32) v_DerPreprocessor_8) |v_list_add___list_add_~next#1.base_7| v_arrayElimArr_8) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_list_add___list_add_~new#1.offset_7| |v_list_add___list_add_~next#1.base_7|) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|) (_ bv3 32))) (_ bv3 32)) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse0) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| |v_list_add___list_add_~next#1.base_7|)) (not (= (_ bv3 32) |v_list_add___list_add_~next#1.base_7|)))))) (not (= (_ bv3 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (_ bv3 32) |c_~#gl_list~0.base|)) is different from true [2024-11-27 23:18:41,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:18:41,912 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 89 treesize of output 78 [2024-11-27 23:18:41,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 65 [2024-11-27 23:18:41,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:18:41,941 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 71 treesize of output 65 [2024-11-27 23:18:41,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-11-27 23:18:42,005 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2024-11-27 23:18:42,005 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 72 [2024-11-27 23:18:42,021 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 51 treesize of output 47 [2024-11-27 23:18:42,145 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 5 [2024-11-27 23:18:42,164 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 5 [2024-11-27 23:18:42,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-27 23:18:42,397 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 16 treesize of output 8 [2024-11-27 23:18:42,447 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 23:18:42,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:18:42,447 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:18:42,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108354268] [2024-11-27 23:18:42,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108354268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:18:42,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:18:42,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 23:18:42,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055657696] [2024-11-27 23:18:42,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:18:42,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 23:18:42,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:18:42,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 23:18:42,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=68, Unknown=3, NotChecked=16, Total=110 [2024-11-27 23:18:42,449 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:18:46,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:18:47,542 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| (_ bv3 32)))) (and (or (exists ((v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_7| (_ BitVec 32)) (v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_7| (_ BitVec 32))) (and (= (store (select (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_arrayElimArr_2) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_1) (_ bv3 32) v_arrayElimArr_2) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_list_add___list_add_~new#1.offset_7| (_ bv3 32)) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|) (_ bv3 32))) (_ bv3 32)) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse0) (= (select v_arrayElimArr_2 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_7|)) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (exists ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_7| (_ BitVec 32))) (and (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select v_DerPreprocessor_13 |v_list_add___list_add_~new#1.offset_7|)) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_12) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_13) (_ bv3 32)) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select v_DerPreprocessor_13 (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|)) (_ bv3 32)))) (exists ((|v_list_add___list_add_~next#1.base_7| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_7| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_7| (_ BitVec 32)) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_8 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_7|)) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= (store (select (store (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_8) |v_list_add___list_add_~next#1.base_7| v_arrayElimArr_8) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_7) (_ bv3 32) v_DerPreprocessor_8) |v_list_add___list_add_~next#1.base_7| v_arrayElimArr_8) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_list_add___list_add_~new#1.offset_7| |v_list_add___list_add_~next#1.base_7|) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|) (_ bv3 32))) (_ bv3 32)) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse0) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| |v_list_add___list_add_~next#1.base_7|)) (not (= (_ bv3 32) |v_list_add___list_add_~next#1.base_7|))))) (not (= (_ bv3 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (_ bv3 32) |c_~#gl_list~0.base|) (not (= (_ bv3 32) (select .cse0 |c_~#gl_list~0.offset|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (_ bv3 32)))))) is different from true [2024-11-27 23:18:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:18:55,141 INFO L93 Difference]: Finished difference Result 225 states and 265 transitions. [2024-11-27 23:18:55,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 23:18:55,142 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-27 23:18:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:18:55,144 INFO L225 Difference]: With dead ends: 225 [2024-11-27 23:18:55,144 INFO L226 Difference]: Without dead ends: 225 [2024-11-27 23:18:55,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=8, NotChecked=54, Total=272 [2024-11-27 23:18:55,145 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 307 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 19 mSolverCounterUnsat, 124 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 124 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:18:55,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 637 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 404 Invalid, 124 Unknown, 272 Unchecked, 11.0s Time] [2024-11-27 23:18:55,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-27 23:18:55,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 198. [2024-11-27 23:18:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 165 states have (on average 1.2303030303030302) internal successors, (203), 180 states have internal predecessors, (203), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-27 23:18:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 239 transitions. [2024-11-27 23:18:55,181 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 239 transitions. Word has length 25 [2024-11-27 23:18:55,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:18:55,181 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 239 transitions. [2024-11-27 23:18:55,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:18:55,181 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 239 transitions. [2024-11-27 23:18:55,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-27 23:18:55,182 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:18:55,182 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] [2024-11-27 23:18:55,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 23:18:55,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:18:55,383 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-27 23:18:55,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:18:55,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1981756823, now seen corresponding path program 1 times [2024-11-27 23:18:55,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:18:55,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1720905712] [2024-11-27 23:18:55,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:18:55,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:18:55,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:18:55,389 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:18:55,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 23:18:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:18:55,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-27 23:18:55,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:18:55,701 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 23:18:55,701 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 13 [2024-11-27 23:18:55,823 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 23:18:55,836 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 23:18:56,189 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 41 treesize of output 46 [2024-11-27 23:18:56,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:18:56,199 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 36 treesize of output 19 [2024-11-27 23:18:56,207 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 21 treesize of output 11 [2024-11-27 23:18:56,295 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 23:18:56,715 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 23:18:56,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:18:56,715 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:18:56,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720905712] [2024-11-27 23:18:56,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720905712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:18:56,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:18:56,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 23:18:56,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767971582] [2024-11-27 23:18:56,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:18:56,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 23:18:56,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:18:56,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 23:18:56,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=87, Unknown=3, NotChecked=0, Total=110 [2024-11-27 23:18:56,718 INFO L87 Difference]: Start difference. First operand 198 states and 239 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:19:00,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:19:03,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:19:05,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:19:07,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:19:12,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:19:15,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:19:15,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:19:15,605 INFO L93 Difference]: Finished difference Result 224 states and 263 transitions. [2024-11-27 23:19:15,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 23:19:15,606 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-27 23:19:15,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:19:15,607 INFO L225 Difference]: With dead ends: 224 [2024-11-27 23:19:15,608 INFO L226 Difference]: Without dead ends: 224 [2024-11-27 23:19:15,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=208, Unknown=8, NotChecked=0, Total=272 [2024-11-27 23:19:15,609 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 234 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 34 mSolverCounterUnsat, 77 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 77 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2024-11-27 23:19:15,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 402 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 944 Invalid, 77 Unknown, 0 Unchecked, 18.5s Time] [2024-11-27 23:19:15,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-27 23:19:15,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 198. [2024-11-27 23:19:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 165 states have (on average 1.2242424242424241) internal successors, (202), 180 states have internal predecessors, (202), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-27 23:19:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 238 transitions. [2024-11-27 23:19:15,628 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 238 transitions. Word has length 28 [2024-11-27 23:19:15,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:19:15,629 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 238 transitions. [2024-11-27 23:19:15,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:19:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 238 transitions. [2024-11-27 23:19:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-27 23:19:15,630 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:19:15,630 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 23:19:15,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-27 23:19:15,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:19:15,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-27 23:19:15,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:15,831 INFO L85 PathProgramCache]: Analyzing trace with hash 957610544, now seen corresponding path program 1 times [2024-11-27 23:19:15,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:19:15,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2053054345] [2024-11-27 23:19:15,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:15,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:19:15,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:19:15,833 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:19:15,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 23:19:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:15,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-27 23:19:15,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:19:16,119 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 23:19:16,119 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 13 [2024-11-27 23:19:16,279 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 23:19:16,294 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 23:19:16,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-11-27 23:19:16,872 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 56 treesize of output 57 [2024-11-27 23:19:16,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 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-27 23:19:16,917 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 22 treesize of output 34 [2024-11-27 23:19:17,122 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-27 23:19:17,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 78 [2024-11-27 23:19:17,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2024-11-27 23:19:17,770 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 23:19:17,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:19:17,770 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:19:17,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053054345] [2024-11-27 23:19:17,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053054345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:17,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:17,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 23:19:17,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271577132] [2024-11-27 23:19:17,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:17,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 23:19:17,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:19:17,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 23:19:17,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-27 23:19:17,772 INFO L87 Difference]: Start difference. First operand 198 states and 238 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:19:24,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:19:24,069 INFO L93 Difference]: Finished difference Result 223 states and 261 transitions. [2024-11-27 23:19:24,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 23:19:24,070 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-27 23:19:24,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:19:24,071 INFO L225 Difference]: With dead ends: 223 [2024-11-27 23:19:24,071 INFO L226 Difference]: Without dead ends: 223 [2024-11-27 23:19:24,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-27 23:19:24,073 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 272 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-27 23:19:24,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 443 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 903 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2024-11-27 23:19:24,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-27 23:19:24,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 198. [2024-11-27 23:19:24,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 165 states have (on average 1.2181818181818183) internal successors, (201), 180 states have internal predecessors, (201), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-27 23:19:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 237 transitions. [2024-11-27 23:19:24,086 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 237 transitions. Word has length 31 [2024-11-27 23:19:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:19:24,086 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 237 transitions. [2024-11-27 23:19:24,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:19:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 237 transitions. [2024-11-27 23:19:24,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 23:19:24,088 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:19:24,088 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 23:19:24,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-27 23:19:24,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:19:24,292 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-27 23:19:24,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:24,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1506128516, now seen corresponding path program 1 times [2024-11-27 23:19:24,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:19:24,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [449630443] [2024-11-27 23:19:24,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:24,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:19:24,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:19:24,295 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:19:24,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 23:19:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:24,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-27 23:19:24,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:19:24,553 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 23:19:24,554 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 13 [2024-11-27 23:19:24,688 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 23:19:24,713 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 23:19:27,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-11-27 23:19:27,256 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 56 treesize of output 57 [2024-11-27 23:19:27,289 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 0 case distinctions, treesize of input 14 treesize of output 18 [2024-11-27 23:19:27,311 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 23 treesize of output 22 [2024-11-27 23:19:27,331 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 45 treesize of output 24 [2024-11-27 23:19:27,356 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 0 case distinctions, treesize of input 19 treesize of output 21 [2024-11-27 23:19:27,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-11-27 23:19:27,425 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2024-11-27 23:19:27,859 INFO L349 Elim1Store]: treesize reduction 38, result has 11.6 percent of original size [2024-11-27 23:19:27,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 120 [2024-11-27 23:19:27,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2024-11-27 23:19:27,942 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-11-27 23:19:27,943 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 2 case distinctions, treesize of input 132 treesize of output 109 [2024-11-27 23:19:27,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 153 [2024-11-27 23:19:28,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 23 treesize of output 40 [2024-11-27 23:19:29,497 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 52 treesize of output 28 [2024-11-27 23:19:30,033 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 23:19:30,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:19:30,033 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:19:30,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449630443] [2024-11-27 23:19:30,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449630443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:30,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:30,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 23:19:30,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567773332] [2024-11-27 23:19:30,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:30,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 23:19:30,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:19:30,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 23:19:30,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-27 23:19:30,036 INFO L87 Difference]: Start difference. First operand 198 states and 237 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:19:36,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 23:19:49,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:19:49,602 INFO L93 Difference]: Finished difference Result 222 states and 259 transitions. [2024-11-27 23:19:49,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 23:19:49,603 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-11-27 23:19:49,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:19:49,604 INFO L225 Difference]: With dead ends: 222 [2024-11-27 23:19:49,605 INFO L226 Difference]: Without dead ends: 222 [2024-11-27 23:19:49,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-11-27 23:19:49,606 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 266 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:19:49,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 514 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1021 Invalid, 1 Unknown, 0 Unchecked, 18.0s Time] [2024-11-27 23:19:49,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-27 23:19:49,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2024-11-27 23:19:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 165 states have (on average 1.2121212121212122) internal successors, (200), 180 states have internal predecessors, (200), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-27 23:19:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 236 transitions. [2024-11-27 23:19:49,620 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 236 transitions. Word has length 34 [2024-11-27 23:19:49,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:19:49,620 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 236 transitions. [2024-11-27 23:19:49,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:19:49,621 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 236 transitions. [2024-11-27 23:19:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-27 23:19:49,622 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:19:49,622 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-27 23:19:49,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-27 23:19:49,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:19:49,824 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-27 23:19:49,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:49,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1443166528, now seen corresponding path program 1 times [2024-11-27 23:19:49,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:19:49,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [840271421] [2024-11-27 23:19:49,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:49,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:19:49,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:19:49,827 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:19:49,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 23:19:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:50,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-27 23:19:50,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:19:50,156 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 24 treesize of output 32 [2024-11-27 23:19:50,168 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 12 treesize of output 1 [2024-11-27 23:19:50,188 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 29 treesize of output 37 [2024-11-27 23:19:50,193 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 23:19:50,197 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 38 treesize of output 21 [2024-11-27 23:19:50,204 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 23:19:50,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:19:50,224 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 8 [2024-11-27 23:19:50,237 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 23:19:50,260 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 36 treesize of output 44 [2024-11-27 23:19:50,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:19:50,292 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 0 case distinctions, treesize of input 45 treesize of output 21 [2024-11-27 23:19:50,300 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 8 treesize of output 1 [2024-11-27 23:19:50,311 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 31 treesize of output 39 [2024-11-27 23:19:50,325 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:19:50,452 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 19 treesize of output 18 [2024-11-27 23:19:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-27 23:19:50,785 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:19:50,785 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:19:50,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840271421] [2024-11-27 23:19:50,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840271421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:50,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:50,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 23:19:50,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183793679] [2024-11-27 23:19:50,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:50,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 23:19:50,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:19:50,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 23:19:50,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-27 23:19:50,787 INFO L87 Difference]: Start difference. First operand 198 states and 236 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:19:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:19:53,070 INFO L93 Difference]: Finished difference Result 291 states and 346 transitions. [2024-11-27 23:19:53,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 23:19:53,073 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-11-27 23:19:53,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:19:53,076 INFO L225 Difference]: With dead ends: 291 [2024-11-27 23:19:53,076 INFO L226 Difference]: Without dead ends: 291 [2024-11-27 23:19:53,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-27 23:19:53,077 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 291 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:19:53,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 574 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-27 23:19:53,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-27 23:19:53,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 267. [2024-11-27 23:19:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 229 states have (on average 1.2270742358078603) internal successors, (281), 245 states have internal predecessors, (281), 28 states have call successors, (28), 9 states have call predecessors, (28), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-27 23:19:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 323 transitions. [2024-11-27 23:19:53,090 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 323 transitions. Word has length 37 [2024-11-27 23:19:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:19:53,091 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 323 transitions. [2024-11-27 23:19:53,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 23:19:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 323 transitions. [2024-11-27 23:19:53,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-27 23:19:53,092 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:19:53,093 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, 1, 1] [2024-11-27 23:19:53,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-27 23:19:53,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:19:53,293 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-27 23:19:53,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:19:53,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1476275169, now seen corresponding path program 1 times [2024-11-27 23:19:53,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:19:53,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1186944912] [2024-11-27 23:19:53,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:19:53,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:19:53,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:19:53,298 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:19:53,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 23:19:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:19:53,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-27 23:19:53,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:19:53,614 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 23:19:53,614 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 13 [2024-11-27 23:19:53,747 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 23:19:53,766 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 23:19:55,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-11-27 23:19:55,969 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 56 treesize of output 57 [2024-11-27 23:19:55,988 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 43 treesize of output 24 [2024-11-27 23:19:56,001 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 0 case distinctions, treesize of input 17 treesize of output 18 [2024-11-27 23:19:56,042 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 11 treesize of output 15 [2024-11-27 23:19:56,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-11-27 23:19:56,092 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2024-11-27 23:19:56,615 INFO L349 Elim1Store]: treesize reduction 32, result has 30.4 percent of original size [2024-11-27 23:19:56,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 137 treesize of output 116 [2024-11-27 23:19:56,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2024-11-27 23:19:56,645 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-27 23:19:56,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 52 [2024-11-27 23:19:58,910 INFO L349 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2024-11-27 23:19:58,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 71 treesize of output 29 [2024-11-27 23:19:59,086 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 23:19:59,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:19:59,086 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:19:59,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186944912] [2024-11-27 23:19:59,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186944912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:19:59,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:19:59,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 23:19:59,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616869011] [2024-11-27 23:19:59,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:19:59,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 23:19:59,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:19:59,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 23:19:59,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-27 23:19:59,088 INFO L87 Difference]: Start difference. First operand 267 states and 323 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:20:02,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 23:20:06,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-27 23:20:19,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:20:19,064 INFO L93 Difference]: Finished difference Result 290 states and 344 transitions. [2024-11-27 23:20:19,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 23:20:19,065 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2024-11-27 23:20:19,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:20:19,066 INFO L225 Difference]: With dead ends: 290 [2024-11-27 23:20:19,066 INFO L226 Difference]: Without dead ends: 290 [2024-11-27 23:20:19,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-11-27 23:20:19,067 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 259 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2024-11-27 23:20:19,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 579 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1037 Invalid, 1 Unknown, 0 Unchecked, 18.8s Time] [2024-11-27 23:20:19,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-27 23:20:19,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 267. [2024-11-27 23:20:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 229 states have (on average 1.222707423580786) internal successors, (280), 245 states have internal predecessors, (280), 28 states have call successors, (28), 9 states have call predecessors, (28), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-27 23:20:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 322 transitions. [2024-11-27 23:20:19,078 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 322 transitions. Word has length 37 [2024-11-27 23:20:19,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:20:19,078 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 322 transitions. [2024-11-27 23:20:19,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:20:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 322 transitions. [2024-11-27 23:20:19,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-27 23:20:19,079 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:20:19,080 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2024-11-27 23:20:19,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-27 23:20:19,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:20:19,280 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-27 23:20:19,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:20:19,281 INFO L85 PathProgramCache]: Analyzing trace with hash -895936203, now seen corresponding path program 1 times [2024-11-27 23:20:19,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:20:19,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [263934184] [2024-11-27 23:20:19,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:20:19,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:20:19,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:20:19,283 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:20:19,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 23:20:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:20:19,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-27 23:20:19,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:20:19,599 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-27 23:20:19,599 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 21 treesize of output 20 [2024-11-27 23:20:19,723 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 23:20:19,733 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 23:20:20,061 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 37 treesize of output 42 [2024-11-27 23:20:20,076 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2024-11-27 23:20:20,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:20:20,213 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 23 treesize of output 14 [2024-11-27 23:20:20,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2024-11-27 23:20:20,429 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 23:20:20,429 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 13 [2024-11-27 23:20:20,555 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 28 treesize of output 19 [2024-11-27 23:20:20,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:20:20,993 INFO L349 Elim1Store]: treesize reduction 66, result has 22.4 percent of original size [2024-11-27 23:20:20,993 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 113 [2024-11-27 23:20:21,074 INFO L349 Elim1Store]: treesize reduction 17, result has 37.0 percent of original size [2024-11-27 23:20:21,074 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 3 case distinctions, treesize of input 55 treesize of output 35 [2024-11-27 23:20:21,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 41 [2024-11-27 23:20:21,203 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 17 treesize of output 12 [2024-11-27 23:20:21,571 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 16 treesize of output 8 [2024-11-27 23:20:21,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:20:21,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:20:22,034 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_534 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_534) |c_~#gl_list~0.base|) (bvadd (_ bv4 32) |c_~#gl_list~0.offset|)) |c_~#gl_list~0.base|))) is different from false [2024-11-27 23:20:22,272 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_543 (_ BitVec 32)) (v_ArrVal_534 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) v_ArrVal_542))) (store .cse0 |c_~#gl_list~0.base| (store (select (store .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_544) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_543))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_534) |c_~#gl_list~0.base|) (bvadd (_ bv4 32) |c_~#gl_list~0.offset|)) |c_~#gl_list~0.base|))) is different from false [2024-11-27 23:20:22,276 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:20:22,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263934184] [2024-11-27 23:20:22,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263934184] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:20:22,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2013610965] [2024-11-27 23:20:22,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:20:22,276 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 23:20:22,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 23:20:22,286 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 23:20:22,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-27 23:20:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:20:23,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-27 23:20:23,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:20:23,372 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-27 23:20:23,372 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 21 treesize of output 20 [2024-11-27 23:20:23,459 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 23:20:23,476 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 23:20:25,768 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 53 treesize of output 50 [2024-11-27 23:20:25,784 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2024-11-27 23:20:30,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:20:30,154 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 23 treesize of output 14 [2024-11-27 23:20:30,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2024-11-27 23:20:30,343 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 23:20:30,343 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 13 [2024-11-27 23:20:30,414 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 28 treesize of output 19 [2024-11-27 23:20:39,920 WARN L286 SmtUtils]: Spent 5.49s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 23:20:43,126 INFO L349 Elim1Store]: treesize reduction 160, result has 8.6 percent of original size [2024-11-27 23:20:43,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 189 treesize of output 259 [2024-11-27 23:20:43,219 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:20:43,803 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:20:43,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:20:43,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:20:43,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:20:45,158 INFO L349 Elim1Store]: treesize reduction 301, result has 15.2 percent of original size [2024-11-27 23:20:45,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 6120 treesize of output 5658 [2024-11-27 23:20:46,780 INFO L349 Elim1Store]: treesize reduction 67, result has 24.7 percent of original size [2024-11-27 23:20:46,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 327 treesize of output 340 [2024-11-27 23:20:47,156 INFO L349 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2024-11-27 23:20:47,157 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 79 treesize of output 69 [2024-11-27 23:20:47,216 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-27 23:20:47,217 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 73 treesize of output 59 [2024-11-27 23:20:47,500 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 246 [2024-11-27 23:20:48,758 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:20:48,848 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:20:48,898 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:20:48,981 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:20:49,032 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:20:49,066 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:20:49,112 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:20:49,154 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:20:49,170 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:20:49,230 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:20:49,322 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 86 treesize of output 232 [2024-11-27 23:20:51,965 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 98 treesize of output 268 [2024-11-27 23:20:53,409 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 77 treesize of output 208 [2024-11-27 23:20:55,102 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 89 treesize of output 244 [2024-11-27 23:20:57,660 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:20:57,709 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:20:57,731 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:20:57,758 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:20:57,967 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 77 treesize of output 208 [2024-11-27 23:20:59,754 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 89 treesize of output 244 [2024-11-27 23:21:02,599 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:21:02,634 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:21:02,662 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:21:02,694 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:21:06,736 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse9 (select |c_#memory_$Pointer$#1.base| (_ bv3 32)))) (let ((.cse8 (select .cse9 (_ bv4 32)))) (let ((.cse0 (not (= .cse8 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (.cse1 (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select .cse9 (_ bv0 32)))) (.cse2 (not (= (_ bv3 32) .cse8))) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (or (and .cse0 .cse1 .cse2 (exists ((v_prenex_8 (_ BitVec 32)) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_52 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_51 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (_ BitVec 32))) (let ((.cse6 (store (store (store (store |c_#memory_$Pointer$#1.base| .cse8 v_DerPreprocessor_50) v_DerPreprocessor_49 v_DerPreprocessor_51) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_52) (_ bv3 32) .cse9))) (let ((.cse3 (select .cse6 .cse8))) (let ((.cse4 (select (store .cse3 (bvadd (_ bv4 32) v_prenex_8) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (_ bv0 32)))) (let ((.cse5 (select .cse6 .cse4))) (and (= v_DerPreprocessor_50 .cse3) (not (= (_ bv3 32) .cse4)) (= v_DerPreprocessor_51 .cse5) (= (select |c_#memory_$Pointer$#1.base| .cse4) .cse5) (= (select .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse7) (= .cse4 v_DerPreprocessor_49)))))))) (exists ((v_DerPreprocessor_89 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_90 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_27| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_DerPreprocessor_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_96 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_27 (_ BitVec 32)) (v_DerPreprocessor_97 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_90))) (let ((.cse23 (store .cse22 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_89))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28)) (.cse18 (select .cse23 (_ bv3 32)))) (let ((.cse21 (store (store .cse20 (_ bv3 32) .cse18) v_DerPreprocessor_27 v_DerPreprocessor_30))) (let ((.cse12 (select .cse21 (_ bv3 32)))) (let ((.cse11 (select .cse12 (_ bv0 32)))) (let ((.cse13 (select .cse23 .cse11)) (.cse16 (bvadd (_ bv4 32) v_prenex_4))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.base| .cse11 v_DerPreprocessor_96) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_97) (_ bv3 32) (store (select (store .cse22 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store v_DerPreprocessor_89 v_prenex_5 .cse11) (bvadd (_ bv4 32) v_prenex_5) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (.cse14 (select .cse21 .cse11)) (.cse15 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_28|)) (.cse17 (select .cse13 .cse16)) (.cse19 (select .cse21 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (and (= .cse7 (select .cse10 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_96 (select .cse10 .cse11)) (= .cse11 v_DerPreprocessor_27) (= .cse11 (select .cse12 (_ bv4 32))) (= .cse13 (store (store .cse14 .cse15 (select .cse13 .cse15)) .cse16 .cse17)) (= (store (select (store (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) .cse18) v_DerPreprocessor_27 v_DerPreprocessor_30) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store .cse19 |v_list_add___list_add_~new#1.offset_27| .cse11) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_27|) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse9) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select .cse14 .cse15)) (= .cse11 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (not (= (_ bv3 32) (select (select (store (store .cse20 (_ bv3 32) v_DerPreprocessor_29) v_DerPreprocessor_27 v_DerPreprocessor_30) (_ bv3 32)) (_ bv0 32)))) (= .cse17 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= v_DerPreprocessor_28 .cse19))))))))))) (exists ((|v_list_add___list_add_~next#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_27| (_ BitVec 32)) (v_DerPreprocessor_134 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_133 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (_ BitVec 32)) (v_DerPreprocessor_132 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_5 (_ BitVec 32)) (v_DerPreprocessor_139 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_138 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_131 (_ BitVec 32))) (let ((.cse35 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_132) (_ bv3 32) v_DerPreprocessor_133) v_DerPreprocessor_131 v_DerPreprocessor_134))) (let ((.cse30 (store |c_#memory_$Pointer$#1.base| (_ bv3 32) (select .cse35 (_ bv3 32))))) (let ((.cse34 (store .cse30 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28))) (let ((.cse33 (select .cse34 (_ bv3 32)))) (let ((.cse25 (select .cse33 (_ bv0 32)))) (let ((.cse29 (select .cse35 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse31 (select .cse35 .cse25)) (.cse32 (bvadd (_ bv4 32) v_prenex_4))) (let ((.cse26 (select .cse34 .cse25)) (.cse27 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_28|)) (.cse28 (select .cse31 .cse32)) (.cse24 (store (store (store |c_#memory_$Pointer$#1.base| .cse25 v_DerPreprocessor_138) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_139) (_ bv3 32) (store (select (store (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_133) v_DerPreprocessor_131 v_DerPreprocessor_134) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store .cse29 v_prenex_5 .cse25) (bvadd (_ bv4 32) v_prenex_5) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (and (= v_DerPreprocessor_138 (select .cse24 .cse25)) (= v_DerPreprocessor_131 .cse25) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select .cse26 .cse27)) (= .cse28 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= v_DerPreprocessor_132 .cse29) (= (store (select (store .cse30 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store v_DerPreprocessor_28 |v_list_add___list_add_~new#1.offset_27| .cse25) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_27|) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse9) (not (= (_ bv3 32) (select (select (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_29) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28) (_ bv3 32)) (_ bv0 32)))) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse25) (= .cse31 (store (store .cse26 .cse27 (select .cse31 .cse27)) .cse32 .cse28)) (= (select .cse33 (_ bv4 32)) .cse25) (= (select .cse24 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse7)))))))))) (and .cse0 .cse1 .cse2 (exists ((v_DerPreprocessor_44 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_41 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_DerPreprocessor_43 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_42 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (store (store (store (store |c_#memory_$Pointer$#1.base| .cse8 v_DerPreprocessor_42) v_DerPreprocessor_41 v_DerPreprocessor_43) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_44) (_ bv3 32) .cse9))) (let ((.cse36 (select .cse38 .cse8))) (let ((.cse37 (select (store .cse36 (bvadd (_ bv4 32) v_prenex_4) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (_ bv0 32)))) (let ((.cse39 (select .cse38 .cse37))) (and (= .cse36 v_DerPreprocessor_42) (= .cse37 v_DerPreprocessor_41) (= (select .cse38 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse7) (= v_DerPreprocessor_43 .cse39) (= .cse39 (select |c_#memory_$Pointer$#1.base| .cse37))))))))) (and .cse0 (exists ((v_DerPreprocessor_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (store (store (store |c_#memory_$Pointer$#1.base| .cse8 v_DerPreprocessor_46) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_47) (_ bv3 32) .cse9))) (and (= (select .cse40 .cse8) (select |c_#memory_$Pointer$#1.base| .cse8)) (= (select .cse40 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse7)))) .cse1 .cse2) (exists ((|v_list_add___list_add_~next#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_135 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_27| (_ BitVec 32)) (v_DerPreprocessor_133 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (_ BitVec 32)) (v_DerPreprocessor_132 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_5 (_ BitVec 32)) (v_DerPreprocessor_136 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_133))) (let ((.cse52 (store .cse50 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_132))) (let ((.cse43 (store |c_#memory_$Pointer$#1.base| (_ bv3 32) (select .cse52 (_ bv3 32))))) (let ((.cse51 (store .cse43 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28))) (let ((.cse44 (select .cse51 (_ bv3 32)))) (let ((.cse42 (select .cse44 (_ bv0 32)))) (let ((.cse48 (select .cse52 .cse42)) (.cse49 (bvadd (_ bv4 32) v_prenex_4))) (let ((.cse46 (select .cse51 .cse42)) (.cse47 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_28|)) (.cse45 (select .cse48 .cse49)) (.cse41 (store (store (store |c_#memory_$Pointer$#1.base| .cse42 v_DerPreprocessor_135) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_136) (_ bv3 32) (store (select (store .cse50 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store v_DerPreprocessor_132 v_prenex_5 .cse42) (bvadd (_ bv4 32) v_prenex_5) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (and (= v_DerPreprocessor_135 (select .cse41 .cse42)) (= .cse9 (store (select (store .cse43 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store v_DerPreprocessor_28 |v_list_add___list_add_~new#1.offset_27| .cse42) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_27|) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= .cse42 (select .cse44 (_ bv4 32))) (= .cse45 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= (select .cse46 .cse47) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= (store (store .cse46 .cse47 (select .cse48 .cse47)) .cse49 .cse45) .cse48) (not (= (_ bv3 32) (select (select (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_29) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28) (_ bv3 32)) (_ bv0 32)))) (= .cse42 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= .cse7 (select .cse41 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))))))))))) (exists ((v_DerPreprocessor_89 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_99 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_91 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_DerPreprocessor_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_90 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_28| (_ BitVec 32)) (|v_list_add___list_add_~new#1.offset_27| (_ BitVec 32)) (v_DerPreprocessor_88 (_ BitVec 32)) (v_DerPreprocessor_100 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_27 (_ BitVec 32))) (let ((.cse66 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_89) (_ bv3 32) v_DerPreprocessor_90) v_DerPreprocessor_88 v_DerPreprocessor_91))) (let ((.cse59 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28)) (.cse58 (select .cse66 (_ bv3 32)))) (let ((.cse65 (store (store .cse59 (_ bv3 32) .cse58) v_DerPreprocessor_27 v_DerPreprocessor_30))) (let ((.cse62 (select .cse65 (_ bv3 32)))) (let ((.cse57 (select .cse62 (_ bv0 32)))) (let ((.cse63 (select .cse66 .cse57)) (.cse64 (bvadd (_ bv4 32) v_prenex_4)) (.cse60 (select .cse66 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (let ((.cse56 (select .cse65 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse61 (store (store (store |c_#memory_$Pointer$#1.base| .cse57 v_DerPreprocessor_99) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_100) (_ bv3 32) (store (select (store (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_90) v_DerPreprocessor_88 v_DerPreprocessor_91) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store .cse60 v_prenex_5 .cse57) (bvadd (_ bv4 32) v_prenex_5) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (.cse54 (select .cse65 .cse57)) (.cse55 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_28|)) (.cse53 (select .cse63 .cse64))) (and (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse53) (= (select .cse54 .cse55) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= v_DerPreprocessor_28 .cse56) (= .cse57 v_DerPreprocessor_88) (= (store (select (store (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) .cse58) v_DerPreprocessor_27 v_DerPreprocessor_30) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store .cse56 |v_list_add___list_add_~new#1.offset_27| .cse57) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_27|) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse9) (not (= (_ bv3 32) (select (select (store (store .cse59 (_ bv3 32) v_DerPreprocessor_29) v_DerPreprocessor_27 v_DerPreprocessor_30) (_ bv3 32)) (_ bv0 32)))) (= v_DerPreprocessor_89 .cse60) (= (select .cse61 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse7) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse57) (= (select .cse61 .cse57) v_DerPreprocessor_99) (= (select .cse62 (_ bv4 32)) .cse57) (= .cse57 v_DerPreprocessor_27) (= (store (store .cse54 .cse55 (select .cse63 .cse55)) .cse64 .cse53) .cse63)))))))))) (exists ((v_DerPreprocessor_107 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_27| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_DerPreprocessor_106 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_104 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_103 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_104))) (let ((.cse78 (store .cse77 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_103))) (let ((.cse75 (store |c_#memory_$Pointer$#1.base| (_ bv3 32) (select .cse78 (_ bv3 32))))) (let ((.cse76 (store .cse75 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28))) (let ((.cse67 (select .cse76 (_ bv3 32)))) (let ((.cse68 (select .cse67 (_ bv0 32)))) (let ((.cse72 (select .cse78 .cse68)) (.cse73 (bvadd (_ bv4 32) v_prenex_4))) (let ((.cse69 (store (store (store |c_#memory_$Pointer$#1.base| .cse68 v_DerPreprocessor_106) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_107) (_ bv3 32) (store (select (store .cse77 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store v_DerPreprocessor_103 v_prenex_5 .cse68) (bvadd (_ bv4 32) v_prenex_5) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (.cse70 (select .cse76 .cse68)) (.cse71 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_28|)) (.cse74 (select .cse72 .cse73))) (and (= (select .cse67 (_ bv4 32)) .cse68) (= (select .cse69 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse7) (= v_DerPreprocessor_106 (select .cse69 .cse68)) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select .cse70 .cse71)) (not (= (_ bv3 32) (select (select (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_29) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28) (_ bv3 32)) (_ bv0 32)))) (= (store (store .cse70 .cse71 (select .cse72 .cse71)) .cse73 .cse74) .cse72) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse74) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse68) (= .cse9 (store (select (store .cse75 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store v_DerPreprocessor_28 |v_list_add___list_add_~new#1.offset_27| .cse68) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_27|) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))))))))))) (exists ((v_DerPreprocessor_109 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_102 (_ BitVec 32)) (|v_list_add___list_add_~next#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_27| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_DerPreprocessor_110 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_5 (_ BitVec 32)) (v_DerPreprocessor_105 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_104 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_103 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse90 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_103) (_ bv3 32) v_DerPreprocessor_104) v_DerPreprocessor_102 v_DerPreprocessor_105))) (let ((.cse86 (store |c_#memory_$Pointer$#1.base| (_ bv3 32) (select .cse90 (_ bv3 32))))) (let ((.cse89 (store .cse86 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28))) (let ((.cse85 (select .cse89 (_ bv3 32)))) (let ((.cse80 (select .cse85 (_ bv0 32)))) (let ((.cse87 (select .cse90 .cse80)) (.cse88 (bvadd (_ bv4 32) v_prenex_4)) (.cse79 (select .cse90 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (let ((.cse84 (store (store (store |c_#memory_$Pointer$#1.base| .cse80 v_DerPreprocessor_109) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_110) (_ bv3 32) (store (select (store (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_104) v_DerPreprocessor_102 v_DerPreprocessor_105) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store .cse79 v_prenex_5 .cse80) (bvadd (_ bv4 32) v_prenex_5) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (.cse81 (select .cse89 .cse80)) (.cse82 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_28|)) (.cse83 (select .cse87 .cse88))) (and (= v_DerPreprocessor_103 .cse79) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse80) (= v_DerPreprocessor_102 .cse80) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select .cse81 .cse82)) (= .cse83 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= .cse7 (select .cse84 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_109 (select .cse84 .cse80)) (= (select .cse85 (_ bv4 32)) .cse80) (not (= (_ bv3 32) (select (select (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_29) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28) (_ bv3 32)) (_ bv0 32)))) (= (store (select (store .cse86 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store v_DerPreprocessor_28 |v_list_add___list_add_~new#1.offset_27| .cse80) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_27|) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse9) (= .cse87 (store (store .cse81 .cse82 (select .cse87 .cse82)) .cse88 .cse83))))))))))))))) (not (= (_ bv3 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (_ bv0 32) |c_~#gl_list~0.offset|) (= (_ bv3 32) |c_~#gl_list~0.base|)) is different from false [2024-11-27 23:21:06,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:24:38,202 WARN L286 SmtUtils]: Spent 3.50m on a formula simplification. DAG size of input: 1096 DAG size of output: 211 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:24:38,202 INFO L349 Elim1Store]: treesize reduction 3356, result has 13.1 percent of original size [2024-11-27 23:24:38,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 22 select indices, 22 select index equivalence classes, 1 disjoint index pairs (out of 231 index pairs), introduced 25 new quantified variables, introduced 250 case distinctions, treesize of input 1552202 treesize of output 1199998 [2024-11-27 23:24:53,964 WARN L286 SmtUtils]: Spent 15.73s on a formula simplification. DAG size of input: 5388 DAG size of output: 1973 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 23:24:54,847 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 44805 treesize of output 44803 [2024-11-27 23:24:55,661 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 44803 treesize of output 44801 [2024-11-27 23:25:02,957 WARN L286 SmtUtils]: Spent 6.38s on a formula simplification. DAG size of input: 17 DAG size of output: 8 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:25:02,957 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-27 23:25:02,959 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 44801 treesize of output 44802 [2024-11-27 23:25:17,358 WARN L286 SmtUtils]: Spent 13.42s on a formula simplification. DAG size of input: 53 DAG size of output: 29 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:25:17,358 INFO L349 Elim1Store]: treesize reduction 100, result has 35.9 percent of original size [2024-11-27 23:25:17,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 44779 treesize of output 44292 [2024-11-27 23:25:18,531 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 43971 treesize of output 43969 [2024-11-27 23:25:20,119 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 44002 treesize of output 43995 [2024-11-27 23:25:22,273 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 47192 treesize of output 47190 [2024-11-27 23:25:47,532 WARN L286 SmtUtils]: Spent 23.60s on a formula simplification. DAG size of input: 53 DAG size of output: 29 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:25:47,532 INFO L349 Elim1Store]: treesize reduction 100, result has 35.9 percent of original size [2024-11-27 23:25:47,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 47190 treesize of output 46343 [2024-11-27 23:25:49,046 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 46022 treesize of output 46020 [2024-11-27 23:25:57,210 WARN L286 SmtUtils]: Spent 6.31s on a formula simplification. DAG size of input: 17 DAG size of output: 8 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:25:57,210 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-27 23:25:57,211 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 46020 treesize of output 46021 [2024-11-27 23:25:58,922 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 46026 treesize of output 46019 [2024-11-27 23:26:02,103 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 45987 treesize of output 45985 [2024-11-27 23:26:28,204 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 0 case distinctions, treesize of input 25 treesize of output 25 [2024-11-27 23:26:33,364 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 73 treesize of output 67 [2024-11-27 23:26:33,471 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 73 treesize of output 67 [2024-11-27 23:26:34,002 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 73 treesize of output 67 [2024-11-27 23:26:34,153 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 100 treesize of output 94 [2024-11-27 23:26:34,295 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 100 treesize of output 94 [2024-11-27 23:26:34,536 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 100 treesize of output 94 [2024-11-27 23:26:36,192 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 0 case distinctions, treesize of input 25 treesize of output 25 [2024-11-27 23:26:36,323 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 24 treesize of output 20 [2024-11-27 23:26:36,343 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-27 23:26:36,545 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 283 treesize of output 245 [2024-11-27 23:26:36,599 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 276 treesize of output 240 [2024-11-27 23:26:37,159 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-27 23:26:37,160 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 187 treesize of output 189 [2024-11-27 23:26:37,709 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-27 23:26:37,709 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 181 treesize of output 183 [2024-11-27 23:26:37,905 INFO L224 Elim1Store]: Index analysis took 131 ms [2024-11-27 23:26:39,531 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-27 23:26:39,531 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 175 treesize of output 179 [2024-11-27 23:26:41,442 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-27 23:26:41,442 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 171 treesize of output 175 [2024-11-27 23:26:41,973 INFO L224 Elim1Store]: Index analysis took 247 ms [2024-11-27 23:26:42,835 INFO L349 Elim1Store]: treesize reduction 96, result has 25.6 percent of original size [2024-11-27 23:26:42,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 240 treesize of output 437 [2024-11-27 23:26:44,105 INFO L224 Elim1Store]: Index analysis took 1074 ms [2024-11-27 23:26:44,221 INFO L349 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2024-11-27 23:26:44,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 107 treesize of output 141 [2024-11-27 23:26:53,024 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification. DAG size of input: 102 DAG size of output: 51 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-27 23:26:53,024 INFO L349 Elim1Store]: treesize reduction 390, result has 19.6 percent of original size [2024-11-27 23:26:53,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 296 treesize of output 663 [2024-11-27 23:26:53,586 INFO L224 Elim1Store]: Index analysis took 374 ms [2024-11-27 23:26:53,814 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-27 23:26:53,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 141 [2024-11-27 23:26:54,088 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-27 23:26:54,089 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 82 treesize of output 54 [2024-11-27 23:27:08,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:27:08,698 INFO L224 Elim1Store]: Index analysis took 663 ms [2024-11-27 23:27:08,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 225 [2024-11-27 23:27:10,151 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 17 [2024-11-27 23:27:10,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:27:10,297 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 0 case distinctions, treesize of input 51 treesize of output 35 [2024-11-27 23:27:10,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:27:10,410 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 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-27 23:27:10,967 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 17 [2024-11-27 23:27:11,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:27:11,078 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 0 case distinctions, treesize of input 51 treesize of output 35 [2024-11-27 23:27:11,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:27:11,201 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 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-27 23:27:12,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 21 treesize of output 17 [2024-11-27 23:27:12,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:27:12,358 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 0 case distinctions, treesize of input 51 treesize of output 35 [2024-11-27 23:27:12,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:27:12,478 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 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-27 23:27:14,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:27:15,055 INFO L349 Elim1Store]: treesize reduction 106, result has 9.4 percent of original size [2024-11-27 23:27:15,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 68 [2024-11-27 23:27:15,283 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-27 23:27:15,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 107 [2024-11-27 23:27:16,743 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-27 23:27:16,743 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 137 treesize of output 141 [2024-11-27 23:27:19,261 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 17 [2024-11-27 23:27:19,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:27:19,302 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 0 case distinctions, treesize of input 51 treesize of output 35 [2024-11-27 23:27:19,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:27:19,329 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 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-27 23:27:21,176 INFO L349 Elim1Store]: treesize reduction 45, result has 45.1 percent of original size [2024-11-27 23:27:21,177 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 972 treesize of output 977 [2024-11-27 23:27:22,154 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 24 treesize of output 12 [2024-11-27 23:27:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-27 23:27:22,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:27:23,032 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_33| (_ BitVec 32)) (v_ArrVal_660 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_34| (_ BitVec 32))) (not (= (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_660) |c_~#gl_list~0.base| (store (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse0 (store (select |c_#memory_$Pointer$#1.base| .cse0) (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_34|) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store .cse1 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse1 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_list_add___list_add_~new#1.offset_33| .cse0) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_33|) |c_~#gl_list~0.base|))) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_653) |c_~#gl_list~0.base|) (bvadd (_ bv4 32) |c_~#gl_list~0.offset|)) |c_~#gl_list~0.base|))) is different from false [2024-11-27 23:27:23,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2013610965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:27:23,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:27:23,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2024-11-27 23:27:23,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341515574] [2024-11-27 23:27:23,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:27:23,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-27 23:27:23,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:27:23,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-27 23:27:23,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=582, Unknown=35, NotChecked=212, Total=930 [2024-11-27 23:27:23,040 INFO L87 Difference]: Start difference. First operand 267 states and 322 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 14 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-27 23:27:31,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:27:36,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:27:41,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:27:47,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:27:49,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:27:51,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:27:55,384 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| (_ bv3 32)))) (let ((.cse8 (select .cse9 (_ bv4 32)))) (let ((.cse91 (select .cse9 (_ bv0 32))) (.cse2 (not (= (_ bv3 32) .cse8)))) (and (let ((.cse0 (not (= .cse8 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (.cse1 (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse91)) (.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (or (and .cse0 .cse1 .cse2 (exists ((v_prenex_8 (_ BitVec 32)) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_52 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_51 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (_ BitVec 32))) (let ((.cse6 (store (store (store (store |c_#memory_$Pointer$#1.base| .cse8 v_DerPreprocessor_50) v_DerPreprocessor_49 v_DerPreprocessor_51) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_52) (_ bv3 32) .cse9))) (let ((.cse3 (select .cse6 .cse8))) (let ((.cse4 (select (store .cse3 (bvadd (_ bv4 32) v_prenex_8) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (_ bv0 32)))) (let ((.cse5 (select .cse6 .cse4))) (and (= v_DerPreprocessor_50 .cse3) (not (= (_ bv3 32) .cse4)) (= v_DerPreprocessor_51 .cse5) (= (select |c_#memory_$Pointer$#1.base| .cse4) .cse5) (= (select .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse7) (= .cse4 v_DerPreprocessor_49)))))))) (exists ((v_DerPreprocessor_89 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_90 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_27| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_DerPreprocessor_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_96 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_27 (_ BitVec 32)) (v_DerPreprocessor_97 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_90))) (let ((.cse23 (store .cse22 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_89))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28)) (.cse18 (select .cse23 (_ bv3 32)))) (let ((.cse21 (store (store .cse20 (_ bv3 32) .cse18) v_DerPreprocessor_27 v_DerPreprocessor_30))) (let ((.cse12 (select .cse21 (_ bv3 32)))) (let ((.cse11 (select .cse12 (_ bv0 32)))) (let ((.cse13 (select .cse23 .cse11)) (.cse16 (bvadd (_ bv4 32) v_prenex_4))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.base| .cse11 v_DerPreprocessor_96) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_97) (_ bv3 32) (store (select (store .cse22 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store v_DerPreprocessor_89 v_prenex_5 .cse11) (bvadd (_ bv4 32) v_prenex_5) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (.cse14 (select .cse21 .cse11)) (.cse15 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_28|)) (.cse17 (select .cse13 .cse16)) (.cse19 (select .cse21 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (and (= .cse7 (select .cse10 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_96 (select .cse10 .cse11)) (= .cse11 v_DerPreprocessor_27) (= .cse11 (select .cse12 (_ bv4 32))) (= .cse13 (store (store .cse14 .cse15 (select .cse13 .cse15)) .cse16 .cse17)) (= (store (select (store (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) .cse18) v_DerPreprocessor_27 v_DerPreprocessor_30) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store .cse19 |v_list_add___list_add_~new#1.offset_27| .cse11) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_27|) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse9) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select .cse14 .cse15)) (= .cse11 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (not (= (_ bv3 32) (select (select (store (store .cse20 (_ bv3 32) v_DerPreprocessor_29) v_DerPreprocessor_27 v_DerPreprocessor_30) (_ bv3 32)) (_ bv0 32)))) (= .cse17 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= v_DerPreprocessor_28 .cse19))))))))))) (exists ((|v_list_add___list_add_~next#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_27| (_ BitVec 32)) (v_DerPreprocessor_134 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_133 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (_ BitVec 32)) (v_DerPreprocessor_132 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_5 (_ BitVec 32)) (v_DerPreprocessor_139 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_138 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_131 (_ BitVec 32))) (let ((.cse35 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_132) (_ bv3 32) v_DerPreprocessor_133) v_DerPreprocessor_131 v_DerPreprocessor_134))) (let ((.cse30 (store |c_#memory_$Pointer$#1.base| (_ bv3 32) (select .cse35 (_ bv3 32))))) (let ((.cse34 (store .cse30 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28))) (let ((.cse33 (select .cse34 (_ bv3 32)))) (let ((.cse25 (select .cse33 (_ bv0 32)))) (let ((.cse29 (select .cse35 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse31 (select .cse35 .cse25)) (.cse32 (bvadd (_ bv4 32) v_prenex_4))) (let ((.cse26 (select .cse34 .cse25)) (.cse27 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_28|)) (.cse28 (select .cse31 .cse32)) (.cse24 (store (store (store |c_#memory_$Pointer$#1.base| .cse25 v_DerPreprocessor_138) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_139) (_ bv3 32) (store (select (store (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_133) v_DerPreprocessor_131 v_DerPreprocessor_134) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store .cse29 v_prenex_5 .cse25) (bvadd (_ bv4 32) v_prenex_5) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (and (= v_DerPreprocessor_138 (select .cse24 .cse25)) (= v_DerPreprocessor_131 .cse25) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select .cse26 .cse27)) (= .cse28 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= v_DerPreprocessor_132 .cse29) (= (store (select (store .cse30 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store v_DerPreprocessor_28 |v_list_add___list_add_~new#1.offset_27| .cse25) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_27|) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse9) (not (= (_ bv3 32) (select (select (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_29) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28) (_ bv3 32)) (_ bv0 32)))) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse25) (= .cse31 (store (store .cse26 .cse27 (select .cse31 .cse27)) .cse32 .cse28)) (= (select .cse33 (_ bv4 32)) .cse25) (= (select .cse24 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse7)))))))))) (and .cse0 .cse1 .cse2 (exists ((v_DerPreprocessor_44 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_41 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_DerPreprocessor_43 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_42 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (store (store (store (store |c_#memory_$Pointer$#1.base| .cse8 v_DerPreprocessor_42) v_DerPreprocessor_41 v_DerPreprocessor_43) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_44) (_ bv3 32) .cse9))) (let ((.cse36 (select .cse38 .cse8))) (let ((.cse37 (select (store .cse36 (bvadd (_ bv4 32) v_prenex_4) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (_ bv0 32)))) (let ((.cse39 (select .cse38 .cse37))) (and (= .cse36 v_DerPreprocessor_42) (= .cse37 v_DerPreprocessor_41) (= (select .cse38 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse7) (= v_DerPreprocessor_43 .cse39) (= .cse39 (select |c_#memory_$Pointer$#1.base| .cse37))))))))) (and .cse0 (exists ((v_DerPreprocessor_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (store (store (store |c_#memory_$Pointer$#1.base| .cse8 v_DerPreprocessor_46) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_47) (_ bv3 32) .cse9))) (and (= (select .cse40 .cse8) (select |c_#memory_$Pointer$#1.base| .cse8)) (= (select .cse40 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse7)))) .cse1 .cse2) (exists ((|v_list_add___list_add_~next#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_135 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_27| (_ BitVec 32)) (v_DerPreprocessor_133 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (_ BitVec 32)) (v_DerPreprocessor_132 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_5 (_ BitVec 32)) (v_DerPreprocessor_136 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse50 (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_133))) (let ((.cse52 (store .cse50 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_132))) (let ((.cse43 (store |c_#memory_$Pointer$#1.base| (_ bv3 32) (select .cse52 (_ bv3 32))))) (let ((.cse51 (store .cse43 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28))) (let ((.cse44 (select .cse51 (_ bv3 32)))) (let ((.cse42 (select .cse44 (_ bv0 32)))) (let ((.cse48 (select .cse52 .cse42)) (.cse49 (bvadd (_ bv4 32) v_prenex_4))) (let ((.cse46 (select .cse51 .cse42)) (.cse47 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_28|)) (.cse45 (select .cse48 .cse49)) (.cse41 (store (store (store |c_#memory_$Pointer$#1.base| .cse42 v_DerPreprocessor_135) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_136) (_ bv3 32) (store (select (store .cse50 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store v_DerPreprocessor_132 v_prenex_5 .cse42) (bvadd (_ bv4 32) v_prenex_5) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (and (= v_DerPreprocessor_135 (select .cse41 .cse42)) (= .cse9 (store (select (store .cse43 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store v_DerPreprocessor_28 |v_list_add___list_add_~new#1.offset_27| .cse42) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_27|) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= .cse42 (select .cse44 (_ bv4 32))) (= .cse45 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= (select .cse46 .cse47) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= (store (store .cse46 .cse47 (select .cse48 .cse47)) .cse49 .cse45) .cse48) (not (= (_ bv3 32) (select (select (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_29) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28) (_ bv3 32)) (_ bv0 32)))) (= .cse42 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= .cse7 (select .cse41 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))))))))))) (exists ((v_DerPreprocessor_89 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_99 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_91 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_DerPreprocessor_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_90 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_28| (_ BitVec 32)) (|v_list_add___list_add_~new#1.offset_27| (_ BitVec 32)) (v_DerPreprocessor_88 (_ BitVec 32)) (v_DerPreprocessor_100 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_27 (_ BitVec 32))) (let ((.cse66 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_89) (_ bv3 32) v_DerPreprocessor_90) v_DerPreprocessor_88 v_DerPreprocessor_91))) (let ((.cse59 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28)) (.cse58 (select .cse66 (_ bv3 32)))) (let ((.cse65 (store (store .cse59 (_ bv3 32) .cse58) v_DerPreprocessor_27 v_DerPreprocessor_30))) (let ((.cse62 (select .cse65 (_ bv3 32)))) (let ((.cse57 (select .cse62 (_ bv0 32)))) (let ((.cse63 (select .cse66 .cse57)) (.cse64 (bvadd (_ bv4 32) v_prenex_4)) (.cse60 (select .cse66 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (let ((.cse56 (select .cse65 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse61 (store (store (store |c_#memory_$Pointer$#1.base| .cse57 v_DerPreprocessor_99) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_100) (_ bv3 32) (store (select (store (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_90) v_DerPreprocessor_88 v_DerPreprocessor_91) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store .cse60 v_prenex_5 .cse57) (bvadd (_ bv4 32) v_prenex_5) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (.cse54 (select .cse65 .cse57)) (.cse55 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_28|)) (.cse53 (select .cse63 .cse64))) (and (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse53) (= (select .cse54 .cse55) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= v_DerPreprocessor_28 .cse56) (= .cse57 v_DerPreprocessor_88) (= (store (select (store (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) .cse58) v_DerPreprocessor_27 v_DerPreprocessor_30) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store .cse56 |v_list_add___list_add_~new#1.offset_27| .cse57) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_27|) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse9) (not (= (_ bv3 32) (select (select (store (store .cse59 (_ bv3 32) v_DerPreprocessor_29) v_DerPreprocessor_27 v_DerPreprocessor_30) (_ bv3 32)) (_ bv0 32)))) (= v_DerPreprocessor_89 .cse60) (= (select .cse61 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse7) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse57) (= (select .cse61 .cse57) v_DerPreprocessor_99) (= (select .cse62 (_ bv4 32)) .cse57) (= .cse57 v_DerPreprocessor_27) (= (store (store .cse54 .cse55 (select .cse63 .cse55)) .cse64 .cse53) .cse63)))))))))) (exists ((v_DerPreprocessor_107 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_27| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_DerPreprocessor_106 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_104 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_103 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse77 (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_104))) (let ((.cse78 (store .cse77 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_103))) (let ((.cse75 (store |c_#memory_$Pointer$#1.base| (_ bv3 32) (select .cse78 (_ bv3 32))))) (let ((.cse76 (store .cse75 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28))) (let ((.cse67 (select .cse76 (_ bv3 32)))) (let ((.cse68 (select .cse67 (_ bv0 32)))) (let ((.cse72 (select .cse78 .cse68)) (.cse73 (bvadd (_ bv4 32) v_prenex_4))) (let ((.cse69 (store (store (store |c_#memory_$Pointer$#1.base| .cse68 v_DerPreprocessor_106) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_107) (_ bv3 32) (store (select (store .cse77 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store v_DerPreprocessor_103 v_prenex_5 .cse68) (bvadd (_ bv4 32) v_prenex_5) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (.cse70 (select .cse76 .cse68)) (.cse71 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_28|)) (.cse74 (select .cse72 .cse73))) (and (= (select .cse67 (_ bv4 32)) .cse68) (= (select .cse69 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse7) (= v_DerPreprocessor_106 (select .cse69 .cse68)) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select .cse70 .cse71)) (not (= (_ bv3 32) (select (select (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_29) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28) (_ bv3 32)) (_ bv0 32)))) (= (store (store .cse70 .cse71 (select .cse72 .cse71)) .cse73 .cse74) .cse72) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse74) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse68) (= .cse9 (store (select (store .cse75 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store v_DerPreprocessor_28 |v_list_add___list_add_~new#1.offset_27| .cse68) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_27|) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))))))))))) (exists ((v_DerPreprocessor_109 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_102 (_ BitVec 32)) (|v_list_add___list_add_~next#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_27| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_DerPreprocessor_110 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_5 (_ BitVec 32)) (v_DerPreprocessor_105 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_104 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_103 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse90 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_103) (_ bv3 32) v_DerPreprocessor_104) v_DerPreprocessor_102 v_DerPreprocessor_105))) (let ((.cse86 (store |c_#memory_$Pointer$#1.base| (_ bv3 32) (select .cse90 (_ bv3 32))))) (let ((.cse89 (store .cse86 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28))) (let ((.cse85 (select .cse89 (_ bv3 32)))) (let ((.cse80 (select .cse85 (_ bv0 32)))) (let ((.cse87 (select .cse90 .cse80)) (.cse88 (bvadd (_ bv4 32) v_prenex_4)) (.cse79 (select .cse90 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (let ((.cse84 (store (store (store |c_#memory_$Pointer$#1.base| .cse80 v_DerPreprocessor_109) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_110) (_ bv3 32) (store (select (store (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_104) v_DerPreprocessor_102 v_DerPreprocessor_105) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store .cse79 v_prenex_5 .cse80) (bvadd (_ bv4 32) v_prenex_5) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (.cse81 (select .cse89 .cse80)) (.cse82 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_28|)) (.cse83 (select .cse87 .cse88))) (and (= v_DerPreprocessor_103 .cse79) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse80) (= v_DerPreprocessor_102 .cse80) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select .cse81 .cse82)) (= .cse83 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= .cse7 (select .cse84 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_109 (select .cse84 .cse80)) (= (select .cse85 (_ bv4 32)) .cse80) (not (= (_ bv3 32) (select (select (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_29) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_28) (_ bv3 32)) (_ bv0 32)))) (= (store (select (store .cse86 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store v_DerPreprocessor_28 |v_list_add___list_add_~new#1.offset_27| .cse80) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_27|) (_ bv3 32))) (_ bv3 32)) (_ bv0 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse9) (= .cse87 (store (store .cse81 .cse82 (select .cse87 .cse82)) .cse88 .cse83))))))))))))) (not (= (_ bv3 32) .cse91)) (not (= (_ bv3 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (_ bv0 32) |c_~#gl_list~0.offset|) (= (_ bv3 32) |c_~#gl_list~0.base|) .cse2)))) is different from false [2024-11-27 23:27:59,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:28:08,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:28:17,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:17,900 INFO L93 Difference]: Finished difference Result 403 states and 475 transitions. [2024-11-27 23:28:17,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-27 23:28:17,900 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 14 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2024-11-27 23:28:17,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:17,904 INFO L225 Difference]: With dead ends: 403 [2024-11-27 23:28:17,904 INFO L226 Difference]: Without dead ends: 403 [2024-11-27 23:28:17,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=237, Invalid=1131, Unknown=58, NotChecked=380, Total=1806 [2024-11-27 23:28:17,904 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 917 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 1625 mSolverCounterSat, 132 mSolverCounterUnsat, 384 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 2443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1625 IncrementalHoareTripleChecker+Invalid, 384 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 45.5s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:17,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 622 Invalid, 2443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1625 Invalid, 384 Unknown, 302 Unchecked, 45.5s Time] [2024-11-27 23:28:17,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-27 23:28:17,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 351. [2024-11-27 23:28:17,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 305 states have (on average 1.222950819672131) internal successors, (373), 322 states have internal predecessors, (373), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-27 23:28:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 425 transitions. [2024-11-27 23:28:17,924 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 425 transitions. Word has length 40 [2024-11-27 23:28:17,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:17,924 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 425 transitions. [2024-11-27 23:28:17,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 14 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-27 23:28:17,925 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 425 transitions. [2024-11-27 23:28:17,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-27 23:28:17,925 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:17,927 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, 1, 1, 1, 1, 1] [2024-11-27 23:28:17,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-27 23:28:18,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-27 23:28:18,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-27 23:28:18,328 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-27 23:28:18,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:18,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1863083690, now seen corresponding path program 1 times [2024-11-27 23:28:18,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:28:18,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1729277389] [2024-11-27 23:28:18,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:18,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:28:18,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:28:18,330 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:28:18,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-27 23:28:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:18,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-27 23:28:18,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:28:18,683 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 23:28:18,683 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 13 treesize of output 13 [2024-11-27 23:28:18,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-27 23:28:18,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-27 23:28:22,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 167 [2024-11-27 23:28:22,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 200 treesize of output 178 [2024-11-27 23:28:23,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:28:23,185 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 75 [2024-11-27 23:28:28,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:28:28,471 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 0 case distinctions, treesize of input 109 treesize of output 92 [2024-11-27 23:28:28,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 130 [2024-11-27 23:28:28,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 66 treesize of output 70 [2024-11-27 23:28:28,513 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 67 treesize of output 72 [2024-11-27 23:28:28,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 55 treesize of output 59 [2024-11-27 23:28:28,849 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 5 [2024-11-27 23:28:28,968 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 31 treesize of output 23 [2024-11-27 23:28:29,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 23:28:29,473 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 748 treesize of output 740 [2024-11-27 23:28:49,011 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 35 treesize of output 15 [2024-11-27 23:28:49,522 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 23:28:49,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:28:49,523 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:28:49,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729277389] [2024-11-27 23:28:49,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729277389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:49,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:28:49,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 23:28:49,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764945393] [2024-11-27 23:28:49,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:49,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 23:28:49,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:28:49,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 23:28:49,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=109, Unknown=1, NotChecked=0, Total=132 [2024-11-27 23:28:49,524 INFO L87 Difference]: Start difference. First operand 351 states and 425 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:28:55,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:28:59,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:29:03,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:29:06,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:29:12,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:29:18,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:29:20,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:29:23,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:29:27,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:29:29,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:29:33,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:29:39,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:29:41,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:29:45,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:29:49,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:29:52,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:29:56,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:29:58,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:03,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:07,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:11,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:14,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:16,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:20,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:25,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:26,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:30,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:33,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:39,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:43,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:46,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:48,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:52,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:30:55,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:31:01,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:31:05,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:31:08,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 23:31:09,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:09,878 INFO L93 Difference]: Finished difference Result 370 states and 442 transitions. [2024-11-27 23:31:09,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 23:31:09,879 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-11-27 23:31:09,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:09,881 INFO L225 Difference]: With dead ends: 370 [2024-11-27 23:31:09,881 INFO L226 Difference]: Without dead ends: 370 [2024-11-27 23:31:09,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=75, Invalid=303, Unknown=2, NotChecked=0, Total=380 [2024-11-27 23:31:09,882 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 297 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 25 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 130.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 131.7s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:09,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 631 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 985 Invalid, 15 Unknown, 0 Unchecked, 131.7s Time] [2024-11-27 23:31:09,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-27 23:31:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 351. [2024-11-27 23:31:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 305 states have (on average 1.219672131147541) internal successors, (372), 322 states have internal predecessors, (372), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-27 23:31:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 424 transitions. [2024-11-27 23:31:09,895 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 424 transitions. Word has length 40 [2024-11-27 23:31:09,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:09,895 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 424 transitions. [2024-11-27 23:31:09,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:31:09,896 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 424 transitions. [2024-11-27 23:31:09,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-27 23:31:09,897 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:09,897 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-11-27 23:31:09,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-27 23:31:10,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:10,098 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-27 23:31:10,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:10,098 INFO L85 PathProgramCache]: Analyzing trace with hash -848098862, now seen corresponding path program 1 times [2024-11-27 23:31:10,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:31:10,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1577332413] [2024-11-27 23:31:10,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:31:10,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:10,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:10,100 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:31:10,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-27 23:31:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:10,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-27 23:31:10,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:31:10,554 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-27 23:31:10,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-27 23:31:10,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-27 23:31:10,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-27 23:31:11,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2024-11-27 23:31:11,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2024-11-27 23:31:11,282 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 27 treesize of output 24 [2024-11-27 23:31:11,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 34 [2024-11-27 23:31:11,861 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-11-27 23:31:11,861 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 2 case distinctions, treesize of input 181 treesize of output 126 [2024-11-27 23:31:11,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 27 treesize of output 18 [2024-11-27 23:31:12,194 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 23:31:12,194 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 13 [2024-11-27 23:31:12,404 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 36 treesize of output 25 [2024-11-27 23:31:12,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 23:31:12,921 INFO L349 Elim1Store]: treesize reduction 66, result has 22.4 percent of original size [2024-11-27 23:31:12,921 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 119 [2024-11-27 23:31:12,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 118 [2024-11-27 23:31:13,033 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 57 treesize of output 52 [2024-11-27 23:31:13,063 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:31:13,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577332413] [2024-11-27 23:31:13,064 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-27 23:31:13,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-27 23:31:13,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:13,265 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-27 23:31:13,272 INFO L158 Benchmark]: Toolchain (without parser) took 762989.85ms. Allocated memory was 83.9MB in the beginning and 1.1GB in the end (delta: 1.1GB). Free memory was 58.3MB in the beginning and 935.9MB in the end (delta: -877.6MB). Peak memory consumption was 181.5MB. Max. memory is 16.1GB. [2024-11-27 23:31:13,272 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 83.9MB. Free memory is still 63.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:31:13,272 INFO L158 Benchmark]: CACSL2BoogieTranslator took 746.06ms. Allocated memory is still 83.9MB. Free memory was 58.3MB in the beginning and 25.2MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-27 23:31:13,272 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.62ms. Allocated memory is still 83.9MB. Free memory was 25.2MB in the beginning and 22.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:31:13,276 INFO L158 Benchmark]: Boogie Preprocessor took 113.87ms. Allocated memory is still 83.9MB. Free memory was 22.6MB in the beginning and 56.9MB in the end (delta: -34.3MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-11-27 23:31:13,276 INFO L158 Benchmark]: RCFGBuilder took 841.28ms. Allocated memory is still 83.9MB. Free memory was 56.9MB in the beginning and 28.3MB in the end (delta: 28.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 23:31:13,277 INFO L158 Benchmark]: TraceAbstraction took 761205.56ms. Allocated memory was 83.9MB in the beginning and 1.1GB in the end (delta: 1.1GB). Free memory was 27.8MB in the beginning and 935.9MB in the end (delta: -908.1MB). Peak memory consumption was 153.3MB. Max. memory is 16.1GB. [2024-11-27 23:31:13,278 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 83.9MB. Free memory is still 63.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 746.06ms. Allocated memory is still 83.9MB. Free memory was 58.3MB in the beginning and 25.2MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.62ms. Allocated memory is still 83.9MB. Free memory was 25.2MB in the beginning and 22.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 113.87ms. Allocated memory is still 83.9MB. Free memory was 22.6MB in the beginning and 56.9MB in the end (delta: -34.3MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * RCFGBuilder took 841.28ms. Allocated memory is still 83.9MB. Free memory was 56.9MB in the beginning and 28.3MB in the end (delta: 28.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 761205.56ms. Allocated memory was 83.9MB in the beginning and 1.1GB in the end (delta: 1.1GB). Free memory was 27.8MB in the beginning and 935.9MB in the end (delta: -908.1MB). Peak memory consumption was 153.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-27 23:31:13,491 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-27 23:31:13,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38a8c699-cf75-428e-956e-20f6d40a22e9/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no need to replace index