./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 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 21:59:28,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 21:59:28,480 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 21:59:28,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 21:59:28,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 21:59:28,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 21:59:28,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 21:59:28,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 21:59:28,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 21:59:28,527 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 21:59:28,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 21:59:28,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 21:59:28,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 21:59:28,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 21:59:28,530 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 21:59:28,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 21:59:28,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 21:59:28,531 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 21:59:28,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 21:59:28,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 21:59:28,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 21:59:28,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 21:59:28,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 21:59:28,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 21:59:28,536 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 21:59:28,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 21:59:28,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 21:59:28,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 21:59:28,537 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 21:59:28,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 21:59:28,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 21:59:28,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 21:59:28,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:59:28,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 21:59:28,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 21:59:28,539 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 21:59:28,539 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 21:59:28,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 21:59:28,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 21:59:28,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 21:59:28,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 21:59:28,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 21:59:28,541 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.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 [2024-11-09 21:59:28,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 21:59:28,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 21:59:28,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 21:59:28,842 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 21:59:28,843 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 21:59:28,844 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 [2024-11-09 21:59:30,284 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 21:59:30,535 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 21:59:30,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i [2024-11-09 21:59:30,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e4b82aa/0058d1b325124d4b883660939eaf424f/FLAG94d21b234 [2024-11-09 21:59:30,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e4b82aa/0058d1b325124d4b883660939eaf424f [2024-11-09 21:59:30,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 21:59:30,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 21:59:30,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 21:59:30,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 21:59:30,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 21:59:30,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:59:30" (1/1) ... [2024-11-09 21:59:30,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@579a0edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:30, skipping insertion in model container [2024-11-09 21:59:30,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:59:30" (1/1) ... [2024-11-09 21:59:30,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 21:59:30,943 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] [2024-11-09 21:59:30,950 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] [2024-11-09 21:59:30,953 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] [2024-11-09 21:59:30,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 21:59:30,984 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 21:59:31,026 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] [2024-11-09 21:59:31,028 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] [2024-11-09 21:59:31,028 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] [2024-11-09 21:59:31,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 21:59:31,079 INFO L204 MainTranslator]: Completed translation [2024-11-09 21:59:31,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:31 WrapperNode [2024-11-09 21:59:31,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 21:59:31,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 21:59:31,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 21:59:31,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 21:59:31,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:31" (1/1) ... [2024-11-09 21:59:31,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:31" (1/1) ... [2024-11-09 21:59:31,144 INFO L138 Inliner]: procedures = 142, calls = 63, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 183 [2024-11-09 21:59:31,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 21:59:31,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 21:59:31,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 21:59:31,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 21:59:31,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:31" (1/1) ... [2024-11-09 21:59:31,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:31" (1/1) ... [2024-11-09 21:59:31,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:31" (1/1) ... [2024-11-09 21:59:31,206 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 7 writes are split as follows [0, 7]. [2024-11-09 21:59:31,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:31" (1/1) ... [2024-11-09 21:59:31,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:31" (1/1) ... [2024-11-09 21:59:31,229 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:31" (1/1) ... [2024-11-09 21:59:31,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:31" (1/1) ... [2024-11-09 21:59:31,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:31" (1/1) ... [2024-11-09 21:59:31,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:31" (1/1) ... [2024-11-09 21:59:31,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 21:59:31,239 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 21:59:31,239 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 21:59:31,239 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 21:59:31,245 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:31" (1/1) ... [2024-11-09 21:59:31,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:59:31,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:31,280 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) [2024-11-09 21:59:31,282 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 [2024-11-09 21:59:31,330 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-09 21:59:31,331 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-09 21:59:31,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2024-11-09 21:59:31,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2024-11-09 21:59:31,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 21:59:31,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 21:59:31,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 21:59:31,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 21:59:31,334 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2024-11-09 21:59:31,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2024-11-09 21:59:31,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 21:59:31,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 21:59:31,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 21:59:31,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 21:59:31,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 21:59:31,335 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-11-09 21:59:31,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-11-09 21:59:31,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 21:59:31,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 21:59:31,336 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2024-11-09 21:59:31,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2024-11-09 21:59:31,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 21:59:31,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 21:59:31,492 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 21:59:31,494 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 21:59:31,730 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L667: havoc ldv_set_empty_#t~ret31#1; [2024-11-09 21:59:31,730 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: havoc ldv_list_empty_#t~mem10#1.base, ldv_list_empty_#t~mem10#1.offset; [2024-11-09 21:59:31,798 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2024-11-09 21:59:31,798 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 21:59:31,816 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 21:59:31,816 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 21:59:31,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:59:31 BoogieIcfgContainer [2024-11-09 21:59:31,817 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 21:59:31,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 21:59:31,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 21:59:31,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 21:59:31,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:59:30" (1/3) ... [2024-11-09 21:59:31,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649b78f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:59:31, skipping insertion in model container [2024-11-09 21:59:31,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:31" (2/3) ... [2024-11-09 21:59:31,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649b78f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:59:31, skipping insertion in model container [2024-11-09 21:59:31,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:59:31" (3/3) ... [2024-11-09 21:59:31,832 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-2.i [2024-11-09 21:59:31,849 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 21:59:31,849 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 21:59:31,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 21:59:31,904 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;@1af953dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 21:59:31,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-09 21:59:31,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 68 states have internal predecessors, (85), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 21:59:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 21:59:31,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:31,916 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:31,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:31,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1776360260, now seen corresponding path program 1 times [2024-11-09 21:59:31,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:31,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894002167] [2024-11-09 21:59:31,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:31,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:32,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:32,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:32,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894002167] [2024-11-09 21:59:32,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894002167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:59:32,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:59:32,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 21:59:32,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807265476] [2024-11-09 21:59:32,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:59:32,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 21:59:32,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:32,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 21:59:32,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 21:59:32,127 INFO L87 Difference]: Start difference. First operand has 84 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 68 states have internal predecessors, (85), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:32,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:32,162 INFO L93 Difference]: Finished difference Result 162 states and 209 transitions. [2024-11-09 21:59:32,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 21:59:32,165 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 21:59:32,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:32,173 INFO L225 Difference]: With dead ends: 162 [2024-11-09 21:59:32,173 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 21:59:32,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 21:59:32,184 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:32,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:59:32,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 21:59:32,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-09 21:59:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 60 states have internal predecessors, (68), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 21:59:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2024-11-09 21:59:32,226 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 13 [2024-11-09 21:59:32,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:32,227 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2024-11-09 21:59:32,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:32,227 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2024-11-09 21:59:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 21:59:32,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:32,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:32,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 21:59:32,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:32,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:32,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1005450745, now seen corresponding path program 1 times [2024-11-09 21:59:32,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:32,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651330599] [2024-11-09 21:59:32,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:32,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:32,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:32,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651330599] [2024-11-09 21:59:32,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651330599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:59:32,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:59:32,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 21:59:32,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22926098] [2024-11-09 21:59:32,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:59:32,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 21:59:32,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:32,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 21:59:32,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 21:59:32,620 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:32,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:32,919 INFO L93 Difference]: Finished difference Result 136 states and 162 transitions. [2024-11-09 21:59:32,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 21:59:32,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2024-11-09 21:59:32,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:32,924 INFO L225 Difference]: With dead ends: 136 [2024-11-09 21:59:32,927 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 21:59:32,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 21:59:32,929 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 57 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:32,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 337 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 21:59:32,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 21:59:32,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 106. [2024-11-09 21:59:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 87 states have internal predecessors, (102), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 21:59:32,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2024-11-09 21:59:32,955 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 16 [2024-11-09 21:59:32,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:32,956 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2024-11-09 21:59:32,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2024-11-09 21:59:32,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 21:59:32,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:32,957 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:32,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 21:59:32,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:32,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:32,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1972767455, now seen corresponding path program 1 times [2024-11-09 21:59:32,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:32,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225210754] [2024-11-09 21:59:32,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:32,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:33,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 21:59:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:33,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:33,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225210754] [2024-11-09 21:59:33,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225210754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:59:33,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:59:33,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 21:59:33,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218814455] [2024-11-09 21:59:33,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:59:33,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 21:59:33,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:33,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 21:59:33,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:59:33,073 INFO L87 Difference]: Start difference. First operand 106 states and 128 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 21:59:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:33,200 INFO L93 Difference]: Finished difference Result 185 states and 218 transitions. [2024-11-09 21:59:33,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 21:59:33,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 18 [2024-11-09 21:59:33,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:33,202 INFO L225 Difference]: With dead ends: 185 [2024-11-09 21:59:33,203 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 21:59:33,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 21:59:33,205 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 17 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:33,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 216 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 21:59:33,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 21:59:33,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2024-11-09 21:59:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 21:59:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2024-11-09 21:59:33,220 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 18 [2024-11-09 21:59:33,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:33,220 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2024-11-09 21:59:33,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 21:59:33,221 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2024-11-09 21:59:33,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 21:59:33,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:33,223 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:33,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 21:59:33,223 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:33,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:33,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1060217284, now seen corresponding path program 1 times [2024-11-09 21:59:33,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:33,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306703855] [2024-11-09 21:59:33,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:33,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:33,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 21:59:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:33,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 21:59:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:33,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 21:59:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:33,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:33,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306703855] [2024-11-09 21:59:33,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306703855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:59:33,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952237691] [2024-11-09 21:59:33,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:33,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:33,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:33,968 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) [2024-11-09 21:59:33,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 21:59:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:34,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 21:59:34,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:59:34,332 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 21:59:34,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 21:59:34,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2024-11-09 21:59:34,520 INFO L349 Elim1Store]: treesize reduction 44, result has 29.0 percent of original size [2024-11-09 21:59:34,521 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 28 treesize of output 18 [2024-11-09 21:59:34,528 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 0 case distinctions, treesize of input 42 treesize of output 25 [2024-11-09 21:59:34,550 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-09 21:59:34,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 35 [2024-11-09 21:59:34,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2024-11-09 21:59:34,602 INFO L349 Elim1Store]: treesize reduction 44, result has 29.0 percent of original size [2024-11-09 21:59:34,603 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 28 treesize of output 18 [2024-11-09 21:59:34,611 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 42 treesize of output 25 [2024-11-09 21:59:34,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 21:59:34,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-09 21:59:34,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-09 21:59:34,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-09 21:59:34,672 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2024-11-09 21:59:34,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2024-11-09 21:59:34,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 34 [2024-11-09 21:59:34,701 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-11-09 21:59:34,702 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 1 case distinctions, treesize of input 13 treesize of output 1 [2024-11-09 21:59:34,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2024-11-09 21:59:34,740 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 62 treesize of output 54 [2024-11-09 21:59:34,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-09 21:59:34,772 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 74 [2024-11-09 21:59:34,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 21:59:34,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:34,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:59:35,269 INFO L349 Elim1Store]: treesize reduction 125, result has 41.9 percent of original size [2024-11-09 21:59:35,270 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 372 [2024-11-09 21:59:35,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 132 [2024-11-09 21:59:35,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:35,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 204 treesize of output 216 [2024-11-09 21:59:35,335 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 124 treesize of output 122 [2024-11-09 21:59:35,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 21:59:35,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 21:59:35,594 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 20 treesize of output 18 [2024-11-09 21:59:35,697 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 21:59:35,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 21:59:35,709 INFO L349 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2024-11-09 21:59:35,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 1 [2024-11-09 21:59:35,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:35,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952237691] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:59:35,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:59:35,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-11-09 21:59:35,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773802487] [2024-11-09 21:59:35,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:59:35,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 21:59:35,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:35,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 21:59:35,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2024-11-09 21:59:35,863 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand has 32 states, 27 states have (on average 2.185185185185185) internal successors, (59), 24 states have internal predecessors, (59), 7 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-09 21:59:37,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:37,366 INFO L93 Difference]: Finished difference Result 191 states and 221 transitions. [2024-11-09 21:59:37,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 21:59:37,366 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 2.185185185185185) internal successors, (59), 24 states have internal predecessors, (59), 7 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 35 [2024-11-09 21:59:37,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:37,368 INFO L225 Difference]: With dead ends: 191 [2024-11-09 21:59:37,368 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 21:59:37,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=347, Invalid=2305, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 21:59:37,370 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 294 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:37,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 903 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 21:59:37,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 21:59:37,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 130. [2024-11-09 21:59:37,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 101 states have (on average 1.198019801980198) internal successors, (121), 106 states have internal predecessors, (121), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 21:59:37,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 153 transitions. [2024-11-09 21:59:37,397 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 153 transitions. Word has length 35 [2024-11-09 21:59:37,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:37,397 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 153 transitions. [2024-11-09 21:59:37,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 2.185185185185185) internal successors, (59), 24 states have internal predecessors, (59), 7 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-09 21:59:37,398 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 153 transitions. [2024-11-09 21:59:37,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 21:59:37,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:37,399 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:37,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 21:59:37,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:37,608 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:37,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:37,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1140682338, now seen corresponding path program 1 times [2024-11-09 21:59:37,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:37,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259818130] [2024-11-09 21:59:37,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:37,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:37,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 21:59:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:37,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 21:59:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:37,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 21:59:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:37,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 21:59:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 21:59:37,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:37,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259818130] [2024-11-09 21:59:37,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259818130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:59:37,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:59:37,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 21:59:37,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308622677] [2024-11-09 21:59:37,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:59:37,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 21:59:37,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:37,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 21:59:37,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 21:59:37,746 INFO L87 Difference]: Start difference. First operand 130 states and 153 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:59:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:37,919 INFO L93 Difference]: Finished difference Result 142 states and 169 transitions. [2024-11-09 21:59:37,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 21:59:37,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 3 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 37 [2024-11-09 21:59:37,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:37,922 INFO L225 Difference]: With dead ends: 142 [2024-11-09 21:59:37,922 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 21:59:37,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 21:59:37,923 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 31 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:37,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 251 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 21:59:37,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 21:59:37,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2024-11-09 21:59:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 107 states have (on average 1.1869158878504673) internal successors, (127), 112 states have internal predecessors, (127), 16 states have call successors, (16), 10 states have call predecessors, (16), 12 states have return successors, (21), 15 states have call predecessors, (21), 16 states have call successors, (21) [2024-11-09 21:59:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2024-11-09 21:59:37,944 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 37 [2024-11-09 21:59:37,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:37,945 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2024-11-09 21:59:37,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:59:37,945 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2024-11-09 21:59:37,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 21:59:37,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:37,946 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:37,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 21:59:37,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:37,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:37,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1322019294, now seen corresponding path program 1 times [2024-11-09 21:59:37,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:37,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248391347] [2024-11-09 21:59:37,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:37,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:38,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 21:59:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:38,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 21:59:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:39,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 21:59:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat