./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52ed361cdf08860b8c7c7d564ef95393de2d3a38663ac135cf0da9ded1f39b3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:33:40,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:33:40,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:33:40,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:33:40,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:33:41,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:33:41,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:33:41,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:33:41,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:33:41,014 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:33:41,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:33:41,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:33:41,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:33:41,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:33:41,015 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:33:41,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:33:41,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:33:41,016 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:33:41,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:33:41,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:33:41,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:33:41,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:33:41,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:33:41,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:33:41,016 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:33:41,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:33:41,016 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:33:41,017 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:33:41,017 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:33:41,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:33:41,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:33:41,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:33:41,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:33:41,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:33:41,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:33:41,017 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:33:41,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:33:41,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:33:41,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:33:41,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:33:41,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:33:41,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:33:41,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:33:41,018 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52ed361cdf08860b8c7c7d564ef95393de2d3a38663ac135cf0da9ded1f39b3f [2025-03-16 17:33:41,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:33:41,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:33:41,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:33:41,276 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:33:41,276 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:33:41,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i [2025-03-16 17:33:42,438 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d05303a0/526b7fbc5c5342a0b573ca21d00fd369/FLAG2776a6b02 [2025-03-16 17:33:42,759 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:33:42,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i [2025-03-16 17:33:42,776 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d05303a0/526b7fbc5c5342a0b573ca21d00fd369/FLAG2776a6b02 [2025-03-16 17:33:42,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d05303a0/526b7fbc5c5342a0b573ca21d00fd369 [2025-03-16 17:33:42,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:33:42,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:33:42,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:33:42,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:33:42,806 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:33:42,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:33:42" (1/1) ... [2025-03-16 17:33:42,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@511c9d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:42, skipping insertion in model container [2025-03-16 17:33:42,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:33:42" (1/1) ... [2025-03-16 17:33:42,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:33:43,042 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i[26271,26284] [2025-03-16 17:33:43,047 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i[26396,26409] [2025-03-16 17:33:43,048 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i[26511,26524] [2025-03-16 17:33:43,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:33:43,071 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:33:43,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i[26271,26284] [2025-03-16 17:33:43,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i[26396,26409] [2025-03-16 17:33:43,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i[26511,26524] [2025-03-16 17:33:43,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:33:43,168 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:33:43,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:43 WrapperNode [2025-03-16 17:33:43,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:33:43,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:33:43,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:33:43,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:33:43,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:43" (1/1) ... [2025-03-16 17:33:43,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:43" (1/1) ... [2025-03-16 17:33:43,213 INFO L138 Inliner]: procedures = 142, calls = 63, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 175 [2025-03-16 17:33:43,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:33:43,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:33:43,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:33:43,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:33:43,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:43" (1/1) ... [2025-03-16 17:33:43,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:43" (1/1) ... [2025-03-16 17:33:43,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:43" (1/1) ... [2025-03-16 17:33:43,262 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 7 writes are split as follows [0, 7]. [2025-03-16 17:33:43,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:43" (1/1) ... [2025-03-16 17:33:43,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:43" (1/1) ... [2025-03-16 17:33:43,275 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:43" (1/1) ... [2025-03-16 17:33:43,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:43" (1/1) ... [2025-03-16 17:33:43,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:43" (1/1) ... [2025-03-16 17:33:43,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:43" (1/1) ... [2025-03-16 17:33:43,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:33:43,292 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:33:43,293 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:33:43,293 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:33:43,293 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:43" (1/1) ... [2025-03-16 17:33:43,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:33:43,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:33:43,320 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 17:33:43,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 17:33:43,343 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2025-03-16 17:33:43,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2025-03-16 17:33:43,343 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2025-03-16 17:33:43,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2025-03-16 17:33:43,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 17:33:43,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:33:43,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 17:33:43,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 17:33:43,344 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2025-03-16 17:33:43,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2025-03-16 17:33:43,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 17:33:43,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 17:33:43,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 17:33:43,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 17:33:43,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 17:33:43,345 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2025-03-16 17:33:43,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2025-03-16 17:33:43,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:33:43,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 17:33:43,345 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2025-03-16 17:33:43,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2025-03-16 17:33:43,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:33:43,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:33:43,474 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:33:43,477 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:33:43,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L667: havoc ldv_set_empty_#t~ret31#1; [2025-03-16 17:33:43,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: havoc ldv_list_empty_#t~mem10#1.base, ldv_list_empty_#t~mem10#1.offset; [2025-03-16 17:33:43,748 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2025-03-16 17:33:43,748 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:33:43,759 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:33:43,759 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:33:43,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:33:43 BoogieIcfgContainer [2025-03-16 17:33:43,760 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:33:43,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:33:43,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:33:43,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:33:43,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:33:42" (1/3) ... [2025-03-16 17:33:43,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6510ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:33:43, skipping insertion in model container [2025-03-16 17:33:43,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:43" (2/3) ... [2025-03-16 17:33:43,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6510ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:33:43, skipping insertion in model container [2025-03-16 17:33:43,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:33:43" (3/3) ... [2025-03-16 17:33:43,767 INFO L128 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-2.i [2025-03-16 17:33:43,780 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:33:43,781 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_mutex_unbounded-2.i that has 6 procedures, 64 locations, 1 initial locations, 5 loop locations, and 3 error locations. [2025-03-16 17:33:43,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:33:43,833 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24a60a35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:33:43,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-16 17:33:43,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 48 states have internal predecessors, (60), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 17:33:43,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-16 17:33:43,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:33:43,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:33:43,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:33:43,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:33:43,846 INFO L85 PathProgramCache]: Analyzing trace with hash 132497927, now seen corresponding path program 1 times [2025-03-16 17:33:43,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:33:43,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542002873] [2025-03-16 17:33:43,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:33:43,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:33:43,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-16 17:33:43,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-16 17:33:43,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:33:43,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:33:44,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:33:44,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542002873] [2025-03-16 17:33:44,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542002873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:33:44,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:33:44,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:33:44,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112262119] [2025-03-16 17:33:44,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:33:44,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:33:44,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:33:44,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:33:44,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:33:44,327 INFO L87 Difference]: Start difference. First operand has 64 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 48 states have internal predecessors, (60), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:44,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:33:44,537 INFO L93 Difference]: Finished difference Result 176 states and 230 transitions. [2025-03-16 17:33:44,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:33:44,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-16 17:33:44,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:33:44,543 INFO L225 Difference]: With dead ends: 176 [2025-03-16 17:33:44,543 INFO L226 Difference]: Without dead ends: 104 [2025-03-16 17:33:44,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:33:44,547 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 54 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:33:44,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 274 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:33:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-16 17:33:44,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 81. [2025-03-16 17:33:44,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 62 states have internal predecessors, (77), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-16 17:33:44,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2025-03-16 17:33:44,587 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 8 [2025-03-16 17:33:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:33:44,588 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2025-03-16 17:33:44,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2025-03-16 17:33:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-16 17:33:44,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:33:44,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:33:44,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:33:44,590 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:33:44,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:33:44,591 INFO L85 PathProgramCache]: Analyzing trace with hash 531587700, now seen corresponding path program 1 times [2025-03-16 17:33:44,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:33:44,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233077064] [2025-03-16 17:33:44,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:33:44,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:33:44,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-16 17:33:44,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-16 17:33:44,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:33:44,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:33:44,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:33:44,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233077064] [2025-03-16 17:33:44,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233077064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:33:44,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:33:44,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:33:44,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653788895] [2025-03-16 17:33:44,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:33:44,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:33:44,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:33:44,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:33:44,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:33:44,659 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:33:44,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:33:44,742 INFO L93 Difference]: Finished difference Result 148 states and 181 transitions. [2025-03-16 17:33:44,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:33:44,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-16 17:33:44,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:33:44,743 INFO L225 Difference]: With dead ends: 148 [2025-03-16 17:33:44,743 INFO L226 Difference]: Without dead ends: 73 [2025-03-16 17:33:44,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:33:44,745 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 13 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:33:44,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 178 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:33:44,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-16 17:33:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2025-03-16 17:33:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 51 states have internal predecessors, (58), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-16 17:33:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2025-03-16 17:33:44,751 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 11 [2025-03-16 17:33:44,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:33:44,751 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2025-03-16 17:33:44,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:33:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2025-03-16 17:33:44,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 17:33:44,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:33:44,752 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] [2025-03-16 17:33:44,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:33:44,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:33:44,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:33:44,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1820697950, now seen corresponding path program 1 times [2025-03-16 17:33:44,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:33:44,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861792136] [2025-03-16 17:33:44,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:33:44,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:33:44,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 17:33:44,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 17:33:44,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:33:44,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:33:45,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:33:45,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861792136] [2025-03-16 17:33:45,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861792136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:33:45,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993536804] [2025-03-16 17:33:45,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:33:45,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:33:45,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:33:45,152 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:33:45,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 17:33:45,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 17:33:45,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 17:33:45,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:33:45,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:45,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-16 17:33:45,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:33:45,386 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-16 17:33:45,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-16 17:33:45,502 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 [2025-03-16 17:33:45,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2025-03-16 17:33:45,539 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 [2025-03-16 17:33:45,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2025-03-16 17:33:45,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-16 17:33:45,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2025-03-16 17:33:45,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 28 [2025-03-16 17:33:45,573 INFO L349 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2025-03-16 17:33:45,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2025-03-16 17:33:45,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:45,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 7 [2025-03-16 17:33:45,594 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 [2025-03-16 17:33:45,612 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2025-03-16 17:33:45,613 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 [2025-03-16 17:33:45,641 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 [2025-03-16 17:33:45,663 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2025-03-16 17:33:45,663 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 [2025-03-16 17:33:45,720 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 [2025-03-16 17:33:45,732 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 [2025-03-16 17:33:45,761 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 [2025-03-16 17:33:45,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 55 [2025-03-16 17:33:45,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2025-03-16 17:33:45,785 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2025-03-16 17:33:45,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 46 [2025-03-16 17:33:45,806 INFO L349 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2025-03-16 17:33:45,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2025-03-16 17:33:45,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2025-03-16 17:33:45,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-16 17:33:46,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 438 treesize of output 406 [2025-03-16 17:33:46,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2025-03-16 17:33:46,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2025-03-16 17:33:46,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:46,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 51 [2025-03-16 17:33:46,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2025-03-16 17:33:46,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-16 17:33:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:33:46,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:33:47,182 INFO L349 Elim1Store]: treesize reduction 136, result has 36.7 percent of original size [2025-03-16 17:33:47,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 554 treesize of output 361 [2025-03-16 17:33:47,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:47,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 235 treesize of output 259 [2025-03-16 17:33:47,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 134 [2025-03-16 17:33:47,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 130 [2025-03-16 17:33:47,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-16 17:33:47,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:33:47,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:33:47,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:33:47,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:47,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2025-03-16 17:33:47,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:47,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 43 [2025-03-16 17:33:47,631 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:33:47,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:33:47,639 INFO L349 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2025-03-16 17:33:47,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 1 [2025-03-16 17:33:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:33:47,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993536804] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:33:47,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:33:47,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2025-03-16 17:33:47,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841722559] [2025-03-16 17:33:47,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:33:47,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 17:33:47,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:33:47,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 17:33:47,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2025-03-16 17:33:47,755 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 31 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 24 states have internal predecessors, (44), 7 states have call successors, (8), 5 states have call predecessors, (8), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-16 17:33:51,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 17:33:57,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 17:34:01,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 17:34:01,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:34:01,566 INFO L93 Difference]: Finished difference Result 153 states and 183 transitions. [2025-03-16 17:34:01,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 17:34:01,566 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 24 states have internal predecessors, (44), 7 states have call successors, (8), 5 states have call predecessors, (8), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 26 [2025-03-16 17:34:01,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:34:01,567 INFO L225 Difference]: With dead ends: 153 [2025-03-16 17:34:01,567 INFO L226 Difference]: Without dead ends: 128 [2025-03-16 17:34:01,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=318, Invalid=2116, Unknown=16, NotChecked=0, Total=2450 [2025-03-16 17:34:01,569 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 413 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 151 mSolverCounterUnsat, 38 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 38 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:34:01,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 548 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 929 Invalid, 38 Unknown, 0 Unchecked, 13.2s Time] [2025-03-16 17:34:01,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-16 17:34:01,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2025-03-16 17:34:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 80 states have internal predecessors, (95), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-16 17:34:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 127 transitions. [2025-03-16 17:34:01,580 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 127 transitions. Word has length 26 [2025-03-16 17:34:01,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:34:01,580 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 127 transitions. [2025-03-16 17:34:01,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 24 states have internal predecessors, (44), 7 states have call successors, (8), 5 states have call predecessors, (8), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-16 17:34:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2025-03-16 17:34:01,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 17:34:01,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:34:01,581 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] [2025-03-16 17:34:01,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 17:34:01,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:34:01,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:34:01,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:34:01,786 INFO L85 PathProgramCache]: Analyzing trace with hash -368563267, now seen corresponding path program 1 times [2025-03-16 17:34:01,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:34:01,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713999846] [2025-03-16 17:34:01,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:34:01,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:34:01,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 17:34:01,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 17:34:01,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:34:01,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:34:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:34:01,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:34:01,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713999846] [2025-03-16 17:34:01,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713999846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:34:01,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:34:01,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:34:01,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134117917] [2025-03-16 17:34:01,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:34:01,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:34:01,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:34:01,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:34:01,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:34:01,847 INFO L87 Difference]: Start difference. First operand 104 states and 127 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:34:01,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:34:01,864 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2025-03-16 17:34:01,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:34:01,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2025-03-16 17:34:01,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:34:01,865 INFO L225 Difference]: With dead ends: 116 [2025-03-16 17:34:01,867 INFO L226 Difference]: Without dead ends: 114 [2025-03-16 17:34:01,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:34:01,868 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:34:01,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:34:01,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-16 17:34:01,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2025-03-16 17:34:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 86 states have internal predecessors, (101), 16 states have call successors, (16), 10 states have call predecessors, (16), 12 states have return successors, (21), 15 states have call predecessors, (21), 16 states have call successors, (21) [2025-03-16 17:34:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2025-03-16 17:34:01,889 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 29 [2025-03-16 17:34:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:34:01,889 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2025-03-16 17:34:01,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 17:34:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2025-03-16 17:34:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 17:34:01,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:34:01,890 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] [2025-03-16 17:34:01,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 17:34:01,890 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:34:01,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:34:01,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1445084530, now seen corresponding path program 1 times [2025-03-16 17:34:01,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:34:01,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970913106] [2025-03-16 17:34:01,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:34:01,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:34:01,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 17:34:01,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 17:34:01,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:34:01,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:34:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:34:03,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:34:03,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970913106] [2025-03-16 17:34:03,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970913106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:34:03,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115946285] [2025-03-16 17:34:03,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:34:03,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:34:03,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:34:03,433 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:34:03,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 17:34:03,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 17:34:03,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 17:34:03,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:34:03,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:34:03,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 122 conjuncts are in the unsatisfiable core [2025-03-16 17:34:03,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:34:03,813 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-16 17:34:03,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-16 17:34:03,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 17:34:07,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2025-03-16 17:34:07,582 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 [2025-03-16 17:34:07,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:34:07,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 48 [2025-03-16 17:34:07,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2025-03-16 17:34:07,601 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-03-16 17:34:07,619 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 5 treesize of output 3 [2025-03-16 17:34:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:34:09,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:34:10,678 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_~#drvlist~0.base|) |c_~#drvlist~0.offset|))) (let ((.cse5 (+ |c_ULTIMATE.start_foo_~me~0#1.offset| 12)) (.cse6 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse4 (+ |c_ULTIMATE.start_foo_~me~0#1.offset| 8))) (and (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_190 (Array Int Int)) (v___ldv_list_add_~next.offset_25 Int) (v_ArrVal_193 Int) (v_ArrVal_192 Int) (v_ArrVal_189 (Array Int Int))) (let ((.cse1 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_191))) (store .cse8 |c_ULTIMATE.start_foo_~me~0#1.base| (store (store (select .cse8 |c_ULTIMATE.start_foo_~me~0#1.base|) .cse4 .cse2) .cse5 v_ArrVal_193))))) (store .cse7 |c_~#drvlist~0.base| (store (select .cse7 |c_~#drvlist~0.base|) |c_~#drvlist~0.offset| |c_ULTIMATE.start_foo_~me~0#1.base|))))) (let ((.cse0 (select (select .cse1 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (or (= |c_~#mutexes~0.base| .cse0) (not (= (select (select .cse1 .cse0) (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_190) |c_ULTIMATE.start_foo_~me~0#1.base| v_ArrVal_189) |c_~#drvlist~0.base| (store (select (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse2 (store .cse6 (+ v___ldv_list_add_~next.offset_25 4) v_ArrVal_192)))) (store .cse3 |c_ULTIMATE.start_foo_~me~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_foo_~me~0#1.base|) .cse4 v___ldv_list_add_~next.offset_25) .cse5 |c_~#drvlist~0.offset|))) |c_~#drvlist~0.base|) |c_~#drvlist~0.offset| .cse4)) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|) (- 4))) |c_ULTIMATE.start_foo_~me~0#1.base|)))))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_190 (Array Int Int)) (v___ldv_list_add_~next.offset_25 Int) (v_ArrVal_193 Int) (v_ArrVal_192 Int) (v_ArrVal_189 (Array Int Int))) (let ((.cse9 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_190) |c_ULTIMATE.start_foo_~me~0#1.base| v_ArrVal_189) |c_~#drvlist~0.base| (store (select (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| .cse2 (store .cse6 (+ v___ldv_list_add_~next.offset_25 4) v_ArrVal_192)))) (store .cse13 |c_ULTIMATE.start_foo_~me~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_foo_~me~0#1.base|) .cse4 v___ldv_list_add_~next.offset_25) .cse5 |c_~#drvlist~0.offset|))) |c_~#drvlist~0.base|) |c_~#drvlist~0.offset| .cse4)) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (or (= .cse9 |c_~#mutexes~0.offset|) (not (= (select (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_191))) (store .cse12 |c_ULTIMATE.start_foo_~me~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_foo_~me~0#1.base|) .cse4 .cse2) .cse5 v_ArrVal_193))))) (store .cse11 |c_~#drvlist~0.base| (store (select .cse11 |c_~#drvlist~0.base|) |c_~#drvlist~0.offset| |c_ULTIMATE.start_foo_~me~0#1.base|))))) (select .cse10 (select (select .cse10 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (+ .cse9 (- 4))) |c_ULTIMATE.start_foo_~me~0#1.base|)))))))) is different from false [2025-03-16 17:34:10,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115946285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:34:10,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:34:10,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2025-03-16 17:34:10,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437415653] [2025-03-16 17:34:10,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:34:10,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 17:34:10,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:34:10,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 17:34:10,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1227, Unknown=3, NotChecked=72, Total=1482 [2025-03-16 17:34:10,687 INFO L87 Difference]: Start difference. First operand 112 states and 138 transitions. Second operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 24 states have internal predecessors, (41), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-16 17:34:34,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:34:34,025 INFO L93 Difference]: Finished difference Result 277 states and 350 transitions. [2025-03-16 17:34:34,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-16 17:34:34,026 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 24 states have internal predecessors, (41), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 30 [2025-03-16 17:34:34,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:34:34,027 INFO L225 Difference]: With dead ends: 277 [2025-03-16 17:34:34,027 INFO L226 Difference]: Without dead ends: 180 [2025-03-16 17:34:34,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=556, Invalid=3847, Unknown=23, NotChecked=130, Total=4556 [2025-03-16 17:34:34,029 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 184 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 90 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2025-03-16 17:34:34,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 591 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1399 Invalid, 9 Unknown, 0 Unchecked, 18.5s Time] [2025-03-16 17:34:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-16 17:34:34,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 149. [2025-03-16 17:34:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 113 states have internal predecessors, (131), 23 states have call successors, (23), 14 states have call predecessors, (23), 17 states have return successors, (29), 21 states have call predecessors, (29), 23 states have call successors, (29) [2025-03-16 17:34:34,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 183 transitions. [2025-03-16 17:34:34,052 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 183 transitions. Word has length 30 [2025-03-16 17:34:34,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:34:34,053 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 183 transitions. [2025-03-16 17:34:34,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 24 states have internal predecessors, (41), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-16 17:34:34,053 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 183 transitions. [2025-03-16 17:34:34,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 17:34:34,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:34:34,054 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:34:34,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 17:34:34,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:34:34,254 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:34:34,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:34:34,255 INFO L85 PathProgramCache]: Analyzing trace with hash 457241993, now seen corresponding path program 2 times [2025-03-16 17:34:34,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:34:34,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067603090] [2025-03-16 17:34:34,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:34:34,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:34:34,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-16 17:34:34,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 17:34:34,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:34:34,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:34:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 17:34:37,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:34:37,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067603090] [2025-03-16 17:34:37,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067603090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:34:37,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016830159] [2025-03-16 17:34:37,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:34:37,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:34:37,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:34:37,113 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:34:37,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 17:34:37,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-16 17:34:37,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 17:34:37,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:34:37,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:34:37,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 151 conjuncts are in the unsatisfiable core [2025-03-16 17:34:37,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:34:37,504 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-16 17:34:37,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-16 17:34:40,253 INFO L349 Elim1Store]: treesize reduction 37, result has 2.6 percent of original size [2025-03-16 17:34:40,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 147 [2025-03-16 17:34:40,276 INFO L349 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2025-03-16 17:34:40,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 81 [2025-03-16 17:34:40,334 INFO L349 Elim1Store]: treesize reduction 85, result has 19.8 percent of original size [2025-03-16 17:34:40,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 93 [2025-03-16 17:34:40,350 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 43 treesize of output 16 [2025-03-16 17:34:40,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:34:40,414 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 101 treesize of output 71 [2025-03-16 17:34:40,542 INFO L349 Elim1Store]: treesize reduction 157, result has 25.2 percent of original size [2025-03-16 17:34:40,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 327 treesize of output 389 [2025-03-16 17:34:40,812 INFO L349 Elim1Store]: treesize reduction 95, result has 1.0 percent of original size [2025-03-16 17:34:40,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 13 [2025-03-16 17:34:42,766 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-16 17:34:42,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-16 17:34:44,621 INFO L349 Elim1Store]: treesize reduction 144, result has 24.2 percent of original size [2025-03-16 17:34:44,621 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 556 treesize of output 560 [2025-03-16 17:34:44,679 INFO L349 Elim1Store]: treesize reduction 98, result has 19.0 percent of original size [2025-03-16 17:34:44,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 564 treesize of output 509 [2025-03-16 17:34:44,711 INFO L349 Elim1Store]: treesize reduction 54, result has 19.4 percent of original size [2025-03-16 17:34:44,711 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 3 case distinctions, treesize of input 421 treesize of output 430 [2025-03-16 17:34:44,741 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:34:44,779 INFO L349 Elim1Store]: treesize reduction 88, result has 24.8 percent of original size [2025-03-16 17:34:44,780 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 705 treesize of output 680 [2025-03-16 17:34:44,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:34:44,834 INFO L349 Elim1Store]: treesize reduction 99, result has 26.1 percent of original size [2025-03-16 17:34:44,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 670 treesize of output 721 [2025-03-16 17:34:44,922 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-03-16 17:34:44,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 5 [2025-03-16 17:34:45,046 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 29 treesize of output 41 [2025-03-16 17:34:53,322 WARN L286 SmtUtils]: Spent 7.70s on a formula simplification. DAG size of input: 530 DAG size of output: 450 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-16 17:34:53,322 INFO L349 Elim1Store]: treesize reduction 408, result has 69.4 percent of original size [2025-03-16 17:34:53,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 13 select indices, 13 select index equivalence classes, 4 disjoint index pairs (out of 78 index pairs), introduced 15 new quantified variables, introduced 101 case distinctions, treesize of input 6733 treesize of output 7546