./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 01:34:38,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:34:38,346 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:34:38,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:34:38,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:34:38,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:34:38,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:34:38,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:34:38,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:34:38,377 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:34:38,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:34:38,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:34:38,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:34:38,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:34:38,379 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:34:38,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:34:38,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:34:38,379 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:34:38,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:34:38,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:34:38,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:34:38,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:34:38,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:34:38,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:34:38,381 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:34:38,382 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:34:38,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:34:38,382 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:34:38,382 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:34:38,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:34:38,383 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:34:38,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:34:38,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:34:38,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:34:38,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:34:38,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:34:38,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:34:38,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:34:38,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:34:38,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:34:38,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:34:38,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:34:38,385 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-clean/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-clean/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-11 01:34:38,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:34:38,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:34:38,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:34:38,607 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:34:38,607 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:34:38,608 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-11 01:34:39,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:34:40,008 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:34:40,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i [2024-10-11 01:34:40,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7d7979408/0b2a7a68b5f64fee97842387d59d67b6/FLAGa885b7374 [2024-10-11 01:34:40,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7d7979408/0b2a7a68b5f64fee97842387d59d67b6 [2024-10-11 01:34:40,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:34:40,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:34:40,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:34:40,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:34:40,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:34:40,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6774bd99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40, skipping insertion in model container [2024-10-11 01:34:40,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,433 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:34:40,706 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-11 01:34:40,709 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-11 01:34:40,710 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-11 01:34:40,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:34:40,724 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:34:40,770 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-11 01:34:40,771 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-11 01:34:40,771 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-11 01:34:40,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:34:40,808 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:34:40,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40 WrapperNode [2024-10-11 01:34:40,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:34:40,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:34:40,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:34:40,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:34:40,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,844 INFO L138 Inliner]: procedures = 142, calls = 63, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 187 [2024-10-11 01:34:40,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:34:40,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:34:40,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:34:40,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:34:40,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,888 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-11 01:34:40,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,897 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:34:40,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:34:40,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:34:40,908 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:34:40,908 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:34:40,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:34:40,932 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:34:40,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:34:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-10-11 01:34:40,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-10-11 01:34:40,971 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2024-10-11 01:34:40,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2024-10-11 01:34:40,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:34:40,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:34:40,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:34:40,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:34:40,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2024-10-11 01:34:40,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2024-10-11 01:34:40,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:34:40,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:34:40,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:34:40,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 01:34:40,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 01:34:40,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-10-11 01:34:40,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-10-11 01:34:40,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:34:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:34:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2024-10-11 01:34:40,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2024-10-11 01:34:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:34:40,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:34:41,079 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:34:41,080 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:34:41,313 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2024-10-11 01:34:41,314 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:34:41,353 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:34:41,353 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 01:34:41,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:34:41 BoogieIcfgContainer [2024-10-11 01:34:41,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:34:41,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:34:41,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:34:41,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:34:41,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:34:40" (1/3) ... [2024-10-11 01:34:41,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a877fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:34:41, skipping insertion in model container [2024-10-11 01:34:41,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (2/3) ... [2024-10-11 01:34:41,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a877fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:34:41, skipping insertion in model container [2024-10-11 01:34:41,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:34:41" (3/3) ... [2024-10-11 01:34:41,360 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-2.i [2024-10-11 01:34:41,376 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:34:41,376 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-11 01:34:41,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:34:41,418 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;@2056c270, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:34:41,418 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-11 01:34:41,421 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-11 01:34:41,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 01:34:41,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:41,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:34:41,427 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:41,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:41,433 INFO L85 PathProgramCache]: Analyzing trace with hash -196891397, now seen corresponding path program 1 times [2024-10-11 01:34:41,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:41,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415428615] [2024-10-11 01:34:41,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:41,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:41,561 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-11 01:34:41,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:41,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415428615] [2024-10-11 01:34:41,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415428615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:34:41,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:34:41,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:34:41,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680293168] [2024-10-11 01:34:41,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:34:41,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 01:34:41,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:34:41,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 01:34:41,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:34:41,582 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-11 01:34:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:34:41,622 INFO L93 Difference]: Finished difference Result 123 states and 170 transitions. [2024-10-11 01:34:41,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 01:34:41,624 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-11 01:34:41,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:34:41,630 INFO L225 Difference]: With dead ends: 123 [2024-10-11 01:34:41,630 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 01:34:41,632 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-11 01:34:41,634 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-11 01:34:41,635 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-11 01:34:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 01:34:41,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-11 01:34:41,662 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-11 01:34:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2024-10-11 01:34:41,665 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 9 [2024-10-11 01:34:41,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:34:41,665 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2024-10-11 01:34:41,665 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-11 01:34:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2024-10-11 01:34:41,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 01:34:41,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:41,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:34:41,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:34:41,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:41,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:41,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1391079186, now seen corresponding path program 1 times [2024-10-11 01:34:41,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:41,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603624188] [2024-10-11 01:34:41,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:41,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:41,807 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-11 01:34:41,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:41,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603624188] [2024-10-11 01:34:41,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603624188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:34:41,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:34:41,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:34:41,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624440730] [2024-10-11 01:34:41,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:34:41,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:34:41,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:34:41,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:34:41,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:34:41,809 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-11 01:34:41,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:34:41,969 INFO L93 Difference]: Finished difference Result 110 states and 136 transitions. [2024-10-11 01:34:41,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:34:41,969 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-11 01:34:41,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:34:41,972 INFO L225 Difference]: With dead ends: 110 [2024-10-11 01:34:41,972 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 01:34:41,972 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-11 01:34:41,973 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-11 01:34:41,973 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-11 01:34:41,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 01:34:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 84. [2024-10-11 01:34:41,986 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-11 01:34:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2024-10-11 01:34:41,987 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 9 [2024-10-11 01:34:41,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:34:41,987 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2024-10-11 01:34:41,987 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-11 01:34:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2024-10-11 01:34:41,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 01:34:41,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:41,988 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:34:41,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:34:41,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:41,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:41,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1792827328, now seen corresponding path program 1 times [2024-10-11 01:34:41,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:41,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460416252] [2024-10-11 01:34:41,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:41,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:42,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 01:34:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:42,139 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-11 01:34:42,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:42,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460416252] [2024-10-11 01:34:42,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460416252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:34:42,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:34:42,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:34:42,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495954004] [2024-10-11 01:34:42,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:34:42,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:34:42,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:34:42,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:34:42,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:34:42,142 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-11 01:34:42,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:34:42,254 INFO L93 Difference]: Finished difference Result 148 states and 181 transitions. [2024-10-11 01:34:42,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:34:42,254 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-11 01:34:42,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:34:42,255 INFO L225 Difference]: With dead ends: 148 [2024-10-11 01:34:42,257 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 01:34:42,257 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-11 01:34:42,258 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-11 01:34:42,259 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-11 01:34:42,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 01:34:42,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2024-10-11 01:34:42,268 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-11 01:34:42,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2024-10-11 01:34:42,269 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 13 [2024-10-11 01:34:42,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:34:42,269 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2024-10-11 01:34:42,269 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-11 01:34:42,269 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2024-10-11 01:34:42,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 01:34:42,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:42,270 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-11 01:34:42,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:34:42,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:42,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:42,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1995733173, now seen corresponding path program 1 times [2024-10-11 01:34:42,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:42,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296859192] [2024-10-11 01:34:42,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:42,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:42,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:34:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:42,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:34:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:42,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:34:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:42,800 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-11 01:34:42,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:42,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296859192] [2024-10-11 01:34:42,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296859192] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:34:42,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19738347] [2024-10-11 01:34:42,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:42,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:34:42,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:34:42,803 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:34:42,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:34:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:42,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-11 01:34:42,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:34:43,055 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:34:43,057 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-11 01:34:43,182 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-11 01:34:43,193 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-11 01:34:43,207 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-11 01:34:43,213 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-11 01:34:43,223 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-11 01:34:43,229 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-11 01:34:43,238 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-11 01:34:43,248 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-11 01:34:43,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:43,269 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-11 01:34:43,272 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-11 01:34:43,535 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-11 01:34:43,556 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-11 01:34:43,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:34:43,725 INFO L349 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2024-10-11 01:34:43,725 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-11 01:34:43,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:43,743 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-11 01:34:43,753 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-11 01:34:43,767 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-11 01:34:43,886 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-11 01:34:43,956 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:43,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:43,960 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-10-11 01:34:43,960 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-11 01:34:44,072 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-11 01:34:44,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19738347] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:34:44,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:34:44,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-10-11 01:34:44,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906864590] [2024-10-11 01:34:44,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:34:44,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 01:34:44,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:34:44,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 01:34:44,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2024-10-11 01:34:44,077 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-11 01:34:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:34:45,337 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2024-10-11 01:34:45,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 01:34:45,338 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-11 01:34:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:34:45,339 INFO L225 Difference]: With dead ends: 152 [2024-10-11 01:34:45,341 INFO L226 Difference]: Without dead ends: 126 [2024-10-11 01:34:45,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=347, Invalid=2305, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 01:34:45,342 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 441 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 01:34:45,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 546 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 01:34:45,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-11 01:34:45,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 103. [2024-10-11 01:34:45,353 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-11 01:34:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2024-10-11 01:34:45,354 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 24 [2024-10-11 01:34:45,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:34:45,354 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2024-10-11 01:34:45,355 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-11 01:34:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2024-10-11 01:34:45,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 01:34:45,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:45,355 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-11 01:34:45,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 01:34:45,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:34:45,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:45,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:45,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1375980551, now seen corresponding path program 1 times [2024-10-11 01:34:45,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:45,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983588807] [2024-10-11 01:34:45,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:45,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:45,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:34:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:45,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:34:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:45,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:34:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:45,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 01:34:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:45,652 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-11 01:34:45,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:45,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983588807] [2024-10-11 01:34:45,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983588807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:34:45,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:34:45,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:34:45,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267545512] [2024-10-11 01:34:45,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:34:45,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:34:45,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:34:45,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:34:45,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:34:45,654 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-11 01:34:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:34:45,804 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2024-10-11 01:34:45,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:34:45,804 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-11 01:34:45,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:34:45,805 INFO L225 Difference]: With dead ends: 115 [2024-10-11 01:34:45,805 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 01:34:45,806 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-11 01:34:45,806 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-11 01:34:45,806 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-11 01:34:45,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 01:34:45,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2024-10-11 01:34:45,825 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-11 01:34:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 137 transitions. [2024-10-11 01:34:45,826 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 137 transitions. Word has length 28 [2024-10-11 01:34:45,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:34:45,826 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 137 transitions. [2024-10-11 01:34:45,826 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-11 01:34:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2024-10-11 01:34:45,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 01:34:45,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:45,827 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-11 01:34:45,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 01:34:45,829 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:45,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:45,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1344383440, now seen corresponding path program 1 times [2024-10-11 01:34:45,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:45,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303801511] [2024-10-11 01:34:45,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:45,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:46,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:34:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:46,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:34:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:46,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:34:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:47,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 01:34:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:47,823 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-11 01:34:47,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:47,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303801511] [2024-10-11 01:34:47,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303801511] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:34:47,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558986745] [2024-10-11 01:34:47,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:47,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:34:47,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:34:47,829 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:34:47,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 01:34:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:47,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-10-11 01:34:47,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:34:48,181 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-11 01:34:48,181 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-11 01:34:52,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:52,907 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-11 01:34:52,939 INFO L349 Elim1Store]: treesize reduction 98, result has 15.5 percent of original size [2024-10-11 01:34:52,939 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-11 01:34:52,991 INFO L349 Elim1Store]: treesize reduction 87, result has 29.8 percent of original size [2024-10-11 01:34:52,992 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-11 01:34:53,033 INFO L349 Elim1Store]: treesize reduction 60, result has 27.7 percent of original size [2024-10-11 01:34:53,034 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-11 01:34:53,122 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-11 01:34:53,138 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-11 01:34:53,152 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-11 01:34:53,163 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-11 01:34:53,178 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 01:34:53,178 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-11 01:34:54,454 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-11 01:34:54,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:35:07,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558986745] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:35:07,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:35:07,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2024-10-11 01:35:07,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448688984] [2024-10-11 01:35:07,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:35:07,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 01:35:07,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:35:07,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 01:35:07,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=830, Unknown=9, NotChecked=0, Total=930 [2024-10-11 01:35:07,112 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-11 01:35:15,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:35:19,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:35:26,735 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-11 01:35:37,004 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-11 01:35:41,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:35:41,649 INFO L93 Difference]: Finished difference Result 277 states and 350 transitions. [2024-10-11 01:35:41,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-11 01:35:41,650 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-11 01:35:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:35:41,652 INFO L225 Difference]: With dead ends: 277 [2024-10-11 01:35:41,652 INFO L226 Difference]: Without dead ends: 181 [2024-10-11 01:35:41,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=330, Invalid=2733, Unknown=17, NotChecked=0, Total=3080 [2024-10-11 01:35:41,654 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 155 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 68 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:35:41,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 520 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1238 Invalid, 9 Unknown, 0 Unchecked, 18.0s Time] [2024-10-11 01:35:41,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-11 01:35:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 138. [2024-10-11 01:35:41,678 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-11 01:35:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 169 transitions. [2024-10-11 01:35:41,679 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 169 transitions. Word has length 28 [2024-10-11 01:35:41,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:35:41,680 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 169 transitions. [2024-10-11 01:35:41,680 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-11 01:35:41,680 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 169 transitions. [2024-10-11 01:35:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 01:35:41,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:35:41,681 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-11 01:35:41,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 01:35:41,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:35:41,883 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:35:41,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:35:41,883 INFO L85 PathProgramCache]: Analyzing trace with hash -823790839, now seen corresponding path program 2 times [2024-10-11 01:35:41,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:35:41,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111003001] [2024-10-11 01:35:41,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:35:41,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:35:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:35:42,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:35:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:35:42,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:35:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:35:42,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:35:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:35:43,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 01:35:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:35:43,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 01:35:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:35:43,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:35:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:35:44,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 01:35:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:35:44,603 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-11 01:35:44,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:35:44,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111003001] [2024-10-11 01:35:44,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111003001] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:35:44,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914726064] [2024-10-11 01:35:44,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:35:44,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:35:44,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:35:44,605 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:35:44,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 01:35:44,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:35:44,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:35:44,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-10-11 01:35:44,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:35:45,086 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 01:35:45,087 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-11 01:35:45,710 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-11 01:35:45,722 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-11 01:35:45,745 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-11 01:35:45,746 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-11 01:35:45,791 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-11 01:35:45,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 8 treesize of output 7 [2024-10-11 01:35:45,804 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-11 01:35:46,817 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:35:46,817 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-11 01:35:47,694 INFO L349 Elim1Store]: treesize reduction 262, result has 22.3 percent of original size [2024-10-11 01:35:47,695 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-11 01:35:47,742 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-10-11 01:35:47,743 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-11 01:35:47,759 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-11 01:35:47,794 INFO L349 Elim1Store]: treesize reduction 104, result has 4.6 percent of original size [2024-10-11 01:35:47,795 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-11 01:35:47,987 INFO L349 Elim1Store]: treesize reduction 422, result has 19.6 percent of original size [2024-10-11 01:35:47,988 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-11 01:35:48,884 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-11 01:35:48,965 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-11 01:35:49,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:35:49,755 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-11 01:35:49,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:35:49,798 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-11 01:35:49,927 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-11 01:35:55,454 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-10-11 01:35:55,454 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-11 01:35:55,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:35:55,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:35:55,531 INFO L349 Elim1Store]: treesize reduction 70, result has 1.4 percent of original size [2024-10-11 01:35:55,531 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-11 01:35:55,687 INFO L349 Elim1Store]: treesize reduction 85, result has 21.3 percent of original size [2024-10-11 01:35:55,688 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-11 01:35:55,951 INFO L349 Elim1Store]: treesize reduction 83, result has 20.2 percent of original size [2024-10-11 01:35:55,952 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-11 01:35:56,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:35:56,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:35:56,180 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2024-10-11 01:35:56,180 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-11 01:35:56,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:35:56,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:35:56,399 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2024-10-11 01:35:56,400 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-11 01:35:56,485 INFO L349 Elim1Store]: treesize reduction 85, result has 21.3 percent of original size [2024-10-11 01:35:56,486 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-11 01:35:56,885 INFO L349 Elim1Store]: treesize reduction 30, result has 43.4 percent of original size [2024-10-11 01:35:56,886 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-11 01:35:57,466 INFO L349 Elim1Store]: treesize reduction 366, result has 22.1 percent of original size [2024-10-11 01:35:57,467 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-11 01:36:04,198 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:36:04,225 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-11 01:36:04,225 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-11 01:36:05,393 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:36:05,444 INFO L349 Elim1Store]: treesize reduction 61, result has 18.7 percent of original size [2024-10-11 01:36:05,445 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-11 01:36:05,559 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:36:05,599 INFO L349 Elim1Store]: treesize reduction 62, result has 17.3 percent of original size [2024-10-11 01:36:05,599 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-11 01:36:14,822 INFO L349 Elim1Store]: treesize reduction 221, result has 8.7 percent of original size [2024-10-11 01:36:14,822 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