./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-wip.fs.cvc5-61a6796-m [2024-10-14 01:44:20,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 01:44:20,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 01:44:20,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 01:44:20,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 01:44:20,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 01:44:20,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 01:44:20,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 01:44:20,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 01:44:20,416 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 01:44:20,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 01:44:20,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 01:44:20,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 01:44:20,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 01:44:20,418 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 01:44:20,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 01:44:20,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 01:44:20,419 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 01:44:20,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 01:44:20,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 01:44:20,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 01:44:20,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 01:44:20,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 01:44:20,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 01:44:20,425 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 01:44:20,425 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 01:44:20,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 01:44:20,425 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 01:44:20,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 01:44:20,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 01:44:20,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 01:44:20,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 01:44:20,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:44:20,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 01:44:20,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 01:44:20,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 01:44:20,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 01:44:20,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 01:44:20,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 01:44:20,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 01:44:20,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 01:44:20,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 01:44:20,429 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-10-14 01:44:20,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 01:44:20,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 01:44:20,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 01:44:20,680 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 01:44:20,684 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 01:44:20,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i [2024-10-14 01:44:22,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 01:44:22,351 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 01:44:22,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i [2024-10-14 01:44:22,374 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1291f19e/e652b5fb5a7b4dd9839b70c2e7bc0e5a/FLAG9b09086d7 [2024-10-14 01:44:22,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1291f19e/e652b5fb5a7b4dd9839b70c2e7bc0e5a [2024-10-14 01:44:22,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 01:44:22,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 01:44:22,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 01:44:22,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 01:44:22,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 01:44:22,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:44:22" (1/1) ... [2024-10-14 01:44:22,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1886ae8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:22, skipping insertion in model container [2024-10-14 01:44:22,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:44:22" (1/1) ... [2024-10-14 01:44:22,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 01:44:22,752 WARN L248 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-10-14 01:44:22,762 WARN L248 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-10-14 01:44:22,764 WARN L248 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-10-14 01:44:22,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:44:22,789 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 01:44:22,831 WARN L248 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-10-14 01:44:22,832 WARN L248 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-10-14 01:44:22,833 WARN L248 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-10-14 01:44:22,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:44:22,917 INFO L204 MainTranslator]: Completed translation [2024-10-14 01:44:22,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:22 WrapperNode [2024-10-14 01:44:22,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 01:44:22,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 01:44:22,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 01:44:22,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 01:44:22,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:22" (1/1) ... [2024-10-14 01:44:22,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:22" (1/1) ... [2024-10-14 01:44:23,009 INFO L138 Inliner]: procedures = 142, calls = 63, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 187 [2024-10-14 01:44:23,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 01:44:23,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 01:44:23,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 01:44:23,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 01:44:23,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:22" (1/1) ... [2024-10-14 01:44:23,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:22" (1/1) ... [2024-10-14 01:44:23,023 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:22" (1/1) ... [2024-10-14 01:44:23,050 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-10-14 01:44:23,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:22" (1/1) ... [2024-10-14 01:44:23,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:22" (1/1) ... [2024-10-14 01:44:23,064 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:22" (1/1) ... [2024-10-14 01:44:23,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:22" (1/1) ... [2024-10-14 01:44:23,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:22" (1/1) ... [2024-10-14 01:44:23,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:22" (1/1) ... [2024-10-14 01:44:23,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 01:44:23,075 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 01:44:23,075 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 01:44:23,075 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 01:44:23,078 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:22" (1/1) ... [2024-10-14 01:44:23,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:44:23,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:23,118 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-10-14 01:44:23,120 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-10-14 01:44:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-10-14 01:44:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-10-14 01:44:23,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2024-10-14 01:44:23,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2024-10-14 01:44:23,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 01:44:23,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 01:44:23,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 01:44:23,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 01:44:23,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2024-10-14 01:44:23,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2024-10-14 01:44:23,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 01:44:23,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 01:44:23,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 01:44:23,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 01:44:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 01:44:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-10-14 01:44:23,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-10-14 01:44:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 01:44:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 01:44:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2024-10-14 01:44:23,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2024-10-14 01:44:23,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 01:44:23,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 01:44:23,321 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 01:44:23,323 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 01:44:23,533 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2024-10-14 01:44:23,533 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 01:44:23,594 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 01:44:23,594 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-14 01:44:23,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:44:23 BoogieIcfgContainer [2024-10-14 01:44:23,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 01:44:23,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 01:44:23,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 01:44:23,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 01:44:23,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:44:22" (1/3) ... [2024-10-14 01:44:23,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5416ee05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:44:23, skipping insertion in model container [2024-10-14 01:44:23,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:22" (2/3) ... [2024-10-14 01:44:23,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5416ee05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:44:23, skipping insertion in model container [2024-10-14 01:44:23,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:44:23" (3/3) ... [2024-10-14 01:44:23,601 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-2.i [2024-10-14 01:44:23,618 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 01:44:23,619 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-14 01:44:23,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 01:44:23,677 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;@76684b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 01:44:23,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-14 01:44:23,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 46 states have internal predecessors, (63), 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-10-14 01:44:23,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 01:44:23,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:23,689 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:23,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:23,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:23,695 INFO L85 PathProgramCache]: Analyzing trace with hash -196891397, now seen corresponding path program 1 times [2024-10-14 01:44:23,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:23,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687983680] [2024-10-14 01:44:23,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:23,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:23,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:23,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687983680] [2024-10-14 01:44:23,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687983680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:23,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:23,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 01:44:23,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034744885] [2024-10-14 01:44:23,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:23,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 01:44:23,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:23,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 01:44:23,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 01:44:23,916 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 46 states have internal predecessors, (63), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-10-14 01:44:23,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:23,965 INFO L93 Difference]: Finished difference Result 123 states and 170 transitions. [2024-10-14 01:44:23,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 01:44:23,967 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-10-14 01:44:23,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:23,972 INFO L225 Difference]: With dead ends: 123 [2024-10-14 01:44:23,973 INFO L226 Difference]: Without dead ends: 60 [2024-10-14 01:44:23,975 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-10-14 01:44:23,978 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:23,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:44:23,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-14 01:44:24,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-14 01:44:24,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 44 states have internal predecessors, (52), 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-10-14 01:44:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2024-10-14 01:44:24,010 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 9 [2024-10-14 01:44:24,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:24,011 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2024-10-14 01:44:24,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-10-14 01:44:24,011 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2024-10-14 01:44:24,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 01:44:24,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:24,013 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:24,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 01:44:24,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:24,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:24,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1391079186, now seen corresponding path program 1 times [2024-10-14 01:44:24,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:24,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538715797] [2024-10-14 01:44:24,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:24,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:24,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:24,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538715797] [2024-10-14 01:44:24,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538715797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:24,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:24,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 01:44:24,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469134778] [2024-10-14 01:44:24,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:24,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 01:44:24,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:24,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 01:44:24,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:44:24,145 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-10-14 01:44:24,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:24,314 INFO L93 Difference]: Finished difference Result 110 states and 136 transitions. [2024-10-14 01:44:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 01:44:24,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-10-14 01:44:24,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:24,318 INFO L225 Difference]: With dead ends: 110 [2024-10-14 01:44:24,318 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 01:44:24,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:44:24,319 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 50 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:24,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 142 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:44:24,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 01:44:24,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 84. [2024-10-14 01:44:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 65 states have internal predecessors, (80), 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-10-14 01:44:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2024-10-14 01:44:24,333 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 9 [2024-10-14 01:44:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:24,333 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2024-10-14 01:44:24,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-10-14 01:44:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2024-10-14 01:44:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 01:44:24,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:24,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:24,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 01:44:24,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:24,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:24,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1792827328, now seen corresponding path program 1 times [2024-10-14 01:44:24,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:24,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061987841] [2024-10-14 01:44:24,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:24,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:24,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 01:44:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:24,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:24,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061987841] [2024-10-14 01:44:24,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061987841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:24,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:24,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 01:44:24,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475111000] [2024-10-14 01:44:24,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:24,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 01:44:24,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:24,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 01:44:24,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:44:24,487 INFO L87 Difference]: Start difference. First operand 84 states and 106 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-10-14 01:44:24,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:24,581 INFO L93 Difference]: Finished difference Result 148 states and 181 transitions. [2024-10-14 01:44:24,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 01:44:24,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 13 [2024-10-14 01:44:24,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:24,583 INFO L225 Difference]: With dead ends: 148 [2024-10-14 01:44:24,583 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 01:44:24,584 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-10-14 01:44:24,585 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 13 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:24,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 151 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:44:24,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 01:44:24,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2024-10-14 01:44:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 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-10-14 01:44:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2024-10-14 01:44:24,593 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 13 [2024-10-14 01:44:24,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:24,593 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2024-10-14 01:44:24,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-10-14 01:44:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2024-10-14 01:44:24,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 01:44:24,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:24,594 INFO L215 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] [2024-10-14 01:44:24,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 01:44:24,595 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:24,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:24,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1995733173, now seen corresponding path program 1 times [2024-10-14 01:44:24,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:24,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445841211] [2024-10-14 01:44:24,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:24,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:25,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:44:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:25,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 01:44:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:25,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:44:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:25,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:25,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445841211] [2024-10-14 01:44:25,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445841211] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:25,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483274140] [2024-10-14 01:44:25,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:25,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:25,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:25,347 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-10-14 01:44:25,350 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-10-14 01:44:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:25,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-14 01:44:25,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:25,643 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:44:25,644 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-10-14 01:44:25,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2024-10-14 01:44:25,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-10-14 01:44:25,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-10-14 01:44:25,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-10-14 01:44:25,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2024-10-14 01:44:25,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-10-14 01:44:25,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 44 [2024-10-14 01:44:25,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-10-14 01:44:25,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:25,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-14 01:44:25,836 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-10-14 01:44:26,136 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-10-14 01:44:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:26,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:26,435 INFO L349 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2024-10-14 01:44:26,436 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 2 case distinctions, treesize of input 394 treesize of output 337 [2024-10-14 01:44:26,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:26,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 231 [2024-10-14 01:44:26,473 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 248 treesize of output 236 [2024-10-14 01:44:26,496 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 196 treesize of output 194 [2024-10-14 01:44:26,662 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-10-14 01:44:26,765 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:44:26,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:26,770 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-10-14 01:44:26,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 1 [2024-10-14 01:44:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:26,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483274140] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:26,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:26,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-10-14 01:44:26,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446934418] [2024-10-14 01:44:26,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:26,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-14 01:44:26,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:26,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-14 01:44:26,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2024-10-14 01:44:26,920 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 32 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 24 states have internal predecessors, (37), 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-10-14 01:44:28,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:28,388 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2024-10-14 01:44:28,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 01:44:28,389 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 24 states have internal predecessors, (37), 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 24 [2024-10-14 01:44:28,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:28,391 INFO L225 Difference]: With dead ends: 152 [2024-10-14 01:44:28,391 INFO L226 Difference]: Without dead ends: 126 [2024-10-14 01:44:28,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 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-10-14 01:44:28,393 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 441 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:28,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 546 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 01:44:28,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-14 01:44:28,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 103. [2024-10-14 01:44:28,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 79 states have internal predecessors, (94), 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-10-14 01:44:28,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2024-10-14 01:44:28,408 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 24 [2024-10-14 01:44:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:28,409 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2024-10-14 01:44:28,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 24 states have internal predecessors, (37), 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-10-14 01:44:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2024-10-14 01:44:28,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 01:44:28,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:28,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:28,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 01:44:28,614 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-10-14 01:44:28,615 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:28,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:28,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1375980551, now seen corresponding path program 1 times [2024-10-14 01:44:28,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:28,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394438238] [2024-10-14 01:44:28,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:28,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:28,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:44:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:28,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 01:44:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:28,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:44:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:28,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 01:44:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:28,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:28,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394438238] [2024-10-14 01:44:28,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394438238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:28,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:28,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 01:44:28,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274079148] [2024-10-14 01:44:28,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:28,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 01:44:28,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:28,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 01:44:28,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 01:44:28,740 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 4 states have internal predecessors, (20), 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-10-14 01:44:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:28,920 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2024-10-14 01:44:28,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 01:44:28,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 4 states have internal predecessors, (20), 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 28 [2024-10-14 01:44:28,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:28,922 INFO L225 Difference]: With dead ends: 115 [2024-10-14 01:44:28,922 INFO L226 Difference]: Without dead ends: 113 [2024-10-14 01:44:28,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-10-14 01:44:28,923 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:28,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 181 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:44:28,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-14 01:44:28,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2024-10-14 01:44:28,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 80 states have (on average 1.25) internal successors, (100), 85 states have internal predecessors, (100), 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-10-14 01:44:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 137 transitions. [2024-10-14 01:44:28,971 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 137 transitions. Word has length 28 [2024-10-14 01:44:28,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:28,971 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 137 transitions. [2024-10-14 01:44:28,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 4 states have internal predecessors, (20), 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-10-14 01:44:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2024-10-14 01:44:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 01:44:28,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:28,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:28,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 01:44:28,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:28,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:28,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1344383440, now seen corresponding path program 1 times [2024-10-14 01:44:28,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:28,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710264433] [2024-10-14 01:44:28,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:28,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:29,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:44:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:29,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 01:44:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:30,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:44:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:31,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 01:44:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:31,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:31,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:31,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710264433] [2024-10-14 01:44:31,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710264433] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:31,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114583338] [2024-10-14 01:44:31,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:31,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:31,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:31,946 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) [2024-10-14 01:44:31,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 01:44:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:32,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-10-14 01:44:32,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:32,335 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-14 01:44:32,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-14 01:44:37,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:37,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2024-10-14 01:44:37,234 INFO L349 Elim1Store]: treesize reduction 98, result has 15.5 percent of original size [2024-10-14 01:44:37,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 140 treesize of output 125 [2024-10-14 01:44:37,314 INFO L349 Elim1Store]: treesize reduction 87, result has 29.8 percent of original size [2024-10-14 01:44:37,316 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 109 [2024-10-14 01:44:37,377 INFO L349 Elim1Store]: treesize reduction 60, result has 27.7 percent of original size [2024-10-14 01:44:37,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 141 treesize of output 129 [2024-10-14 01:44:37,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 66 treesize of output 36 [2024-10-14 01:44:37,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2024-10-14 01:44:37,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2024-10-14 01:44:37,530 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 49 treesize of output 25 [2024-10-14 01:44:37,547 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 01:44:37,548 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 180 [2024-10-14 01:44:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:39,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:40,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114583338] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:40,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 01:44:40,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2024-10-14 01:44:40,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471496642] [2024-10-14 01:44:40,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:40,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 01:44:40,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:40,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 01:44:40,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=831, Unknown=8, NotChecked=0, Total=930 [2024-10-14 01:44:40,557 INFO L87 Difference]: Start difference. First operand 111 states and 137 transitions. Second operand has 28 states, 20 states have (on average 1.85) internal successors, (37), 21 states have internal predecessors, (37), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 01:44:44,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:44:47,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:44:51,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:44:56,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:45:04,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:45:11,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 01:45:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:45:15,191 INFO L93 Difference]: Finished difference Result 277 states and 350 transitions. [2024-10-14 01:45:15,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-14 01:45:15,192 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 20 states have (on average 1.85) internal successors, (37), 21 states have internal predecessors, (37), 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 28 [2024-10-14 01:45:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:45:15,194 INFO L225 Difference]: With dead ends: 277 [2024-10-14 01:45:15,194 INFO L226 Difference]: Without dead ends: 181 [2024-10-14 01:45:15,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=330, Invalid=2738, Unknown=12, NotChecked=0, Total=3080 [2024-10-14 01:45:15,197 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 155 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 68 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:45:15,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 513 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1242 Invalid, 14 Unknown, 0 Unchecked, 25.1s Time] [2024-10-14 01:45:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-14 01:45:15,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 138. [2024-10-14 01:45:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 105 states have internal predecessors, (123), 20 states have call successors, (20), 13 states have call predecessors, (20), 16 states have return successors, (26), 19 states have call predecessors, (26), 20 states have call successors, (26) [2024-10-14 01:45:15,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 169 transitions. [2024-10-14 01:45:15,229 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 169 transitions. Word has length 28 [2024-10-14 01:45:15,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:45:15,230 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 169 transitions. [2024-10-14 01:45:15,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 20 states have (on average 1.85) internal successors, (37), 21 states have internal predecessors, (37), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 01:45:15,230 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 169 transitions. [2024-10-14 01:45:15,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 01:45:15,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:45:15,232 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:45:15,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 01:45:15,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 01:45:15,433 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:45:15,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:45:15,434 INFO L85 PathProgramCache]: Analyzing trace with hash -823790839, now seen corresponding path program 2 times [2024-10-14 01:45:15,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:45:15,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440491745] [2024-10-14 01:45:15,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:45:15,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:45:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:16,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 01:45:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:16,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 01:45:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:16,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:45:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:16,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 01:45:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:16,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 01:45:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:17,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:45:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:18,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 01:45:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:18,758 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:45:18,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:45:18,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440491745] [2024-10-14 01:45:18,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440491745] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:45:18,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933011061] [2024-10-14 01:45:18,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:45:18,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:45:18,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:45:18,761 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) [2024-10-14 01:45:18,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 01:45:18,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:45:18,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:45:18,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-10-14 01:45:18,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:45:19,327 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 01:45:19,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-14 01:45:19,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 59 [2024-10-14 01:45:19,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2024-10-14 01:45:19,983 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-14 01:45:19,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2024-10-14 01:45:20,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2024-10-14 01:45:20,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-14 01:45:20,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 01:45:20,761 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:45:20,761 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-10-14 01:45:21,643 INFO L349 Elim1Store]: treesize reduction 262, result has 22.3 percent of original size [2024-10-14 01:45:21,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 17 case distinctions, treesize of input 254 treesize of output 301 [2024-10-14 01:45:21,696 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-10-14 01:45:21,696 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 168 treesize of output 153 [2024-10-14 01:45:21,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 131 [2024-10-14 01:45:21,761 INFO L349 Elim1Store]: treesize reduction 104, result has 4.6 percent of original size [2024-10-14 01:45:21,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 114 [2024-10-14 01:45:21,962 INFO L349 Elim1Store]: treesize reduction 422, result has 19.6 percent of original size [2024-10-14 01:45:21,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 253 treesize of output 358 [2024-10-14 01:45:22,867 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 130 treesize of output 118 [2024-10-14 01:45:22,986 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 349 treesize of output 327 [2024-10-14 01:45:23,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:23,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-10-14 01:45:23,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:23,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-10-14 01:45:24,010 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 469 treesize of output 453 [2024-10-14 01:45:29,665 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-10-14 01:45:29,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 17 [2024-10-14 01:45:29,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:29,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:29,739 INFO L349 Elim1Store]: treesize reduction 70, result has 1.4 percent of original size [2024-10-14 01:45:29,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 59 [2024-10-14 01:45:29,884 INFO L349 Elim1Store]: treesize reduction 85, result has 21.3 percent of original size [2024-10-14 01:45:29,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 84 [2024-10-14 01:45:30,092 INFO L349 Elim1Store]: treesize reduction 83, result has 20.2 percent of original size [2024-10-14 01:45:30,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 74 [2024-10-14 01:45:30,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:30,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:30,313 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2024-10-14 01:45:30,314 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 1 case distinctions, treesize of input 42 treesize of output 56 [2024-10-14 01:45:30,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:30,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:30,522 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2024-10-14 01:45:30,522 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 1 case distinctions, treesize of input 32 treesize of output 49 [2024-10-14 01:45:30,582 INFO L349 Elim1Store]: treesize reduction 85, result has 21.3 percent of original size [2024-10-14 01:45:30,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 75 [2024-10-14 01:45:30,954 INFO L349 Elim1Store]: treesize reduction 30, result has 43.4 percent of original size [2024-10-14 01:45:30,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 136 [2024-10-14 01:45:31,542 INFO L349 Elim1Store]: treesize reduction 366, result has 22.1 percent of original size [2024-10-14 01:45:31,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 23 case distinctions, treesize of input 221 treesize of output 488 [2024-10-14 01:45:38,925 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:38,949 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-14 01:45:38,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 12 [2024-10-14 01:45:40,072 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:40,121 INFO L349 Elim1Store]: treesize reduction 61, result has 18.7 percent of original size [2024-10-14 01:45:40,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 33 [2024-10-14 01:45:40,230 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:40,264 INFO L349 Elim1Store]: treesize reduction 62, result has 17.3 percent of original size [2024-10-14 01:45:40,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 30 [2024-10-14 01:45:50,134 INFO L349 Elim1Store]: treesize reduction 221, result has 8.7 percent of original size [2024-10-14 01:45:50,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 199 treesize of output 210 [2024-10-14 01:45:53,577 INFO L349 Elim1Store]: treesize reduction 1079, result has 16.8 percent of original size [2024-10-14 01:45:53,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 47 case distinctions, treesize of input 751 treesize of output 1123