./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:24:17,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:24:17,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:24:17,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:24:17,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:24:17,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:24:17,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:24:17,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:24:17,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:24:17,310 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:24:17,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:24:17,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:24:17,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:24:17,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:24:17,312 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:24:17,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:24:17,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:24:17,314 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:24:17,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:24:17,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:24:17,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:24:17,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:24:17,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:24:17,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:24:17,317 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:24:17,317 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:24:17,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:24:17,318 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:24:17,318 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:24:17,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:24:17,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:24:17,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:24:17,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:24:17,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:24:17,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:24:17,319 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:24:17,319 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:24:17,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:24:17,319 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:24:17,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:24:17,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:24:17,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:24:17,321 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 [2024-11-10 10:24:17,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:24:17,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:24:17,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:24:17,557 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:24:17,558 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:24:17,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2024-11-10 10:24:18,777 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:24:18,996 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:24:18,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2024-11-10 10:24:19,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7e69308b/dce538cf77d9470684baf16287cf9316/FLAGeb7ae48c8 [2024-11-10 10:24:19,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7e69308b/dce538cf77d9470684baf16287cf9316 [2024-11-10 10:24:19,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:24:19,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:24:19,339 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:24:19,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:24:19,344 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:24:19,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:24:19" (1/1) ... [2024-11-10 10:24:19,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f927420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:19, skipping insertion in model container [2024-11-10 10:24:19,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:24:19" (1/1) ... [2024-11-10 10:24:19,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:24:19,779 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2024-11-10 10:24:19,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:24:19,851 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:24:19,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2024-11-10 10:24:19,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:24:19,939 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:24:19,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:19 WrapperNode [2024-11-10 10:24:19,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:24:19,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:24:19,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:24:19,941 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:24:19,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:19" (1/1) ... [2024-11-10 10:24:19,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:19" (1/1) ... [2024-11-10 10:24:20,009 INFO L138 Inliner]: procedures = 272, calls = 109, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 324 [2024-11-10 10:24:20,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:24:20,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:24:20,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:24:20,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:24:20,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:19" (1/1) ... [2024-11-10 10:24:20,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:19" (1/1) ... [2024-11-10 10:24:20,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:19" (1/1) ... [2024-11-10 10:24:20,049 INFO L175 MemorySlicer]: Split 84 memory accesses to 4 slices as follows [2, 5, 2, 75]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 0, 60]. The 7 writes are split as follows [0, 0, 1, 6]. [2024-11-10 10:24:20,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:19" (1/1) ... [2024-11-10 10:24:20,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:19" (1/1) ... [2024-11-10 10:24:20,056 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:19" (1/1) ... [2024-11-10 10:24:20,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:19" (1/1) ... [2024-11-10 10:24:20,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:19" (1/1) ... [2024-11-10 10:24:20,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:19" (1/1) ... [2024-11-10 10:24:20,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:24:20,062 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:24:20,062 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:24:20,062 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:24:20,063 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:19" (1/1) ... [2024-11-10 10:24:20,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:24:20,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:24:20,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 10:24:20,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 10:24:20,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 10:24:20,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 10:24:20,128 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 10:24:20,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 10:24:20,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 10:24:20,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 10:24:20,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 10:24:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 10:24:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 10:24:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 10:24:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 10:24:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 10:24:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:24:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 10:24:20,130 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 10:24:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:24:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 10:24:20,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 10:24:20,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 10:24:20,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:24:20,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:24:20,132 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:24:20,248 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:24:20,250 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:24:20,512 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L953: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2024-11-10 10:24:20,512 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L953-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2024-11-10 10:24:20,577 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:24:20,577 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:24:20,853 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:24:20,854 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:24:20,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:24:20 BoogieIcfgContainer [2024-11-10 10:24:20,854 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:24:20,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:24:20,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:24:20,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:24:20,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:24:19" (1/3) ... [2024-11-10 10:24:20,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28af723a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:24:20, skipping insertion in model container [2024-11-10 10:24:20,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:19" (2/3) ... [2024-11-10 10:24:20,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28af723a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:24:20, skipping insertion in model container [2024-11-10 10:24:20,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:24:20" (3/3) ... [2024-11-10 10:24:20,860 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2024-11-10 10:24:20,873 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:24:20,873 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 10:24:20,873 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:24:20,911 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 10:24:20,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 160 transitions, 327 flow [2024-11-10 10:24:21,028 INFO L124 PetriNetUnfolderBase]: 73/260 cut-off events. [2024-11-10 10:24:21,030 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 10:24:21,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 260 events. 73/260 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1206 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 150. Up to 8 conditions per place. [2024-11-10 10:24:21,035 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 160 transitions, 327 flow [2024-11-10 10:24:21,040 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 158 transitions, 320 flow [2024-11-10 10:24:21,047 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:24:21,052 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;@3312fe6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:24:21,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 10:24:21,061 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:24:21,061 INFO L124 PetriNetUnfolderBase]: 6/34 cut-off events. [2024-11-10 10:24:21,061 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:24:21,061 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:21,062 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:21,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:24:21,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:21,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1083752759, now seen corresponding path program 1 times [2024-11-10 10:24:21,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:21,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779624458] [2024-11-10 10:24:21,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:21,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:24:21,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:21,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779624458] [2024-11-10 10:24:21,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779624458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:24:21,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:24:21,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:24:21,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126710065] [2024-11-10 10:24:21,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:24:21,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:24:21,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:21,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:24:21,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:24:21,314 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 160 [2024-11-10 10:24:21,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 158 transitions, 320 flow. Second operand has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:21,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:21,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 160 [2024-11-10 10:24:21,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:21,660 INFO L124 PetriNetUnfolderBase]: 885/2553 cut-off events. [2024-11-10 10:24:21,660 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:24:21,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4220 conditions, 2553 events. 885/2553 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 20249 event pairs, 741 based on Foata normal form. 909/3337 useless extension candidates. Maximal degree in co-relation 4087. Up to 1663 conditions per place. [2024-11-10 10:24:21,677 INFO L140 encePairwiseOnDemand]: 122/160 looper letters, 64 selfloop transitions, 0 changer transitions 0/120 dead transitions. [2024-11-10 10:24:21,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 120 transitions, 372 flow [2024-11-10 10:24:21,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:24:21,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:24:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 214 transitions. [2024-11-10 10:24:21,690 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.66875 [2024-11-10 10:24:21,692 INFO L175 Difference]: Start difference. First operand has 117 places, 158 transitions, 320 flow. Second operand 2 states and 214 transitions. [2024-11-10 10:24:21,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 120 transitions, 372 flow [2024-11-10 10:24:21,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 120 transitions, 372 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:24:21,699 INFO L231 Difference]: Finished difference. Result has 118 places, 120 transitions, 244 flow [2024-11-10 10:24:21,701 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=244, PETRI_PLACES=118, PETRI_TRANSITIONS=120} [2024-11-10 10:24:21,704 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 1 predicate places. [2024-11-10 10:24:21,705 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 120 transitions, 244 flow [2024-11-10 10:24:21,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:21,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:21,706 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:21,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:24:21,706 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:24:21,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:21,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1086578055, now seen corresponding path program 1 times [2024-11-10 10:24:21,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:21,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723550442] [2024-11-10 10:24:21,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:21,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:21,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:24:21,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:21,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723550442] [2024-11-10 10:24:21,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723550442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:24:21,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:24:21,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:24:21,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746994153] [2024-11-10 10:24:21,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:24:21,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:24:21,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:21,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:24:21,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:24:21,821 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 160 [2024-11-10 10:24:21,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 120 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:21,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:21,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 160 [2024-11-10 10:24:21,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:22,085 INFO L124 PetriNetUnfolderBase]: 885/2555 cut-off events. [2024-11-10 10:24:22,085 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:24:22,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4225 conditions, 2555 events. 885/2555 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 20228 event pairs, 741 based on Foata normal form. 0/2429 useless extension candidates. Maximal degree in co-relation 4221. Up to 1664 conditions per place. [2024-11-10 10:24:22,094 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 64 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2024-11-10 10:24:22,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 121 transitions, 378 flow [2024-11-10 10:24:22,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:24:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:24:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2024-11-10 10:24:22,096 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-11-10 10:24:22,096 INFO L175 Difference]: Start difference. First operand has 118 places, 120 transitions, 244 flow. Second operand 3 states and 232 transitions. [2024-11-10 10:24:22,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 121 transitions, 378 flow [2024-11-10 10:24:22,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 121 transitions, 378 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:24:22,100 INFO L231 Difference]: Finished difference. Result has 121 places, 121 transitions, 256 flow [2024-11-10 10:24:22,100 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=121, PETRI_TRANSITIONS=121} [2024-11-10 10:24:22,101 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 4 predicate places. [2024-11-10 10:24:22,101 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 121 transitions, 256 flow [2024-11-10 10:24:22,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:22,101 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:22,101 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:22,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:24:22,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:24:22,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:22,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1924136637, now seen corresponding path program 1 times [2024-11-10 10:24:22,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:22,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97429537] [2024-11-10 10:24:22,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:22,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:24:22,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:22,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97429537] [2024-11-10 10:24:22,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97429537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:24:22,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97797312] [2024-11-10 10:24:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:22,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:24:22,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:24:22,175 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:24:22,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 10:24:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:22,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 10:24:22,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:24:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:24:22,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:24:22,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:24:22,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97797312] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:24:22,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:24:22,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-10 10:24:22,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210983104] [2024-11-10 10:24:22,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:24:22,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:24:22,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:22,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:24:22,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:24:22,340 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 160 [2024-11-10 10:24:22,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 121 transitions, 256 flow. Second operand has 7 states, 7 states have (on average 56.714285714285715) internal successors, (397), 7 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:22,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:22,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 160 [2024-11-10 10:24:22,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:22,643 INFO L124 PetriNetUnfolderBase]: 885/2561 cut-off events. [2024-11-10 10:24:22,643 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-10 10:24:22,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4244 conditions, 2561 events. 885/2561 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 20217 event pairs, 741 based on Foata normal form. 0/2435 useless extension candidates. Maximal degree in co-relation 4238. Up to 1664 conditions per place. [2024-11-10 10:24:22,654 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 64 selfloop transitions, 5 changer transitions 0/124 dead transitions. [2024-11-10 10:24:22,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 124 transitions, 406 flow [2024-11-10 10:24:22,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:24:22,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:24:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 402 transitions. [2024-11-10 10:24:22,659 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-11-10 10:24:22,659 INFO L175 Difference]: Start difference. First operand has 121 places, 121 transitions, 256 flow. Second operand 6 states and 402 transitions. [2024-11-10 10:24:22,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 124 transitions, 406 flow [2024-11-10 10:24:22,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 124 transitions, 404 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:24:22,662 INFO L231 Difference]: Finished difference. Result has 128 places, 124 transitions, 290 flow [2024-11-10 10:24:22,663 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=290, PETRI_PLACES=128, PETRI_TRANSITIONS=124} [2024-11-10 10:24:22,664 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 11 predicate places. [2024-11-10 10:24:22,664 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 124 transitions, 290 flow [2024-11-10 10:24:22,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.714285714285715) internal successors, (397), 7 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:22,664 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:22,664 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:22,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 10:24:22,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:24:22,869 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:24:22,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:22,869 INFO L85 PathProgramCache]: Analyzing trace with hash 249224865, now seen corresponding path program 2 times [2024-11-10 10:24:22,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:22,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592352291] [2024-11-10 10:24:22,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:22,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:22,983 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:24:22,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:22,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592352291] [2024-11-10 10:24:22,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592352291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:24:22,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004995952] [2024-11-10 10:24:22,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:24:22,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:24:22,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:24:22,987 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:24:22,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 10:24:23,065 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 10:24:23,065 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:24:23,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 10:24:23,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:24:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:24:23,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:24:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 10:24:23,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004995952] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:24:23,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:24:23,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-10 10:24:23,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881100641] [2024-11-10 10:24:23,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:24:23,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:24:23,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:23,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:24:23,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:24:23,158 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 160 [2024-11-10 10:24:23,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 124 transitions, 290 flow. Second operand has 13 states, 13 states have (on average 56.38461538461539) internal successors, (733), 13 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:23,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:23,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 160 [2024-11-10 10:24:23,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:23,532 INFO L124 PetriNetUnfolderBase]: 885/2573 cut-off events. [2024-11-10 10:24:23,532 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-11-10 10:24:23,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4288 conditions, 2573 events. 885/2573 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 20177 event pairs, 741 based on Foata normal form. 6/2454 useless extension candidates. Maximal degree in co-relation 4279. Up to 1664 conditions per place. [2024-11-10 10:24:23,543 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 64 selfloop transitions, 11 changer transitions 0/130 dead transitions. [2024-11-10 10:24:23,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 130 transitions, 476 flow [2024-11-10 10:24:23,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 10:24:23,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 10:24:23,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 741 transitions. [2024-11-10 10:24:23,546 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3859375 [2024-11-10 10:24:23,546 INFO L175 Difference]: Start difference. First operand has 128 places, 124 transitions, 290 flow. Second operand 12 states and 741 transitions. [2024-11-10 10:24:23,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 130 transitions, 476 flow [2024-11-10 10:24:23,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 130 transitions, 468 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-10 10:24:23,549 INFO L231 Difference]: Finished difference. Result has 144 places, 130 transitions, 366 flow [2024-11-10 10:24:23,550 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=366, PETRI_PLACES=144, PETRI_TRANSITIONS=130} [2024-11-10 10:24:23,550 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 27 predicate places. [2024-11-10 10:24:23,550 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 130 transitions, 366 flow [2024-11-10 10:24:23,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 56.38461538461539) internal successors, (733), 13 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:23,551 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:23,551 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:23,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 10:24:23,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-10 10:24:23,752 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 10:24:23,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:23,753 INFO L85 PathProgramCache]: Analyzing trace with hash 567901661, now seen corresponding path program 3 times [2024-11-10 10:24:23,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:23,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631273198] [2024-11-10 10:24:23,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:23,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:24:23,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:24:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:24:23,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:24:23,820 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:24:23,821 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-10 10:24:23,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-10 10:24:23,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-11-10 10:24:23,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-11-10 10:24:23,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-10 10:24:23,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:24:23,823 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2024-11-10 10:24:23,825 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:24:23,825 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 10:24:23,848 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 10:24:23,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 211 transitions, 438 flow [2024-11-10 10:24:23,871 INFO L124 PetriNetUnfolderBase]: 118/421 cut-off events. [2024-11-10 10:24:23,871 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 10:24:23,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 421 events. 118/421 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2239 event pairs, 0 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2024-11-10 10:24:23,873 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 211 transitions, 438 flow [2024-11-10 10:24:23,876 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 211 transitions, 438 flow [2024-11-10 10:24:23,877 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:24:23,877 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;@3312fe6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:24:23,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 10:24:23,883 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:24:23,883 INFO L124 PetriNetUnfolderBase]: 23/111 cut-off events. [2024-11-10 10:24:23,883 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:24:23,883 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:23,883 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:23,883 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:24:23,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:23,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1761745474, now seen corresponding path program 1 times [2024-11-10 10:24:23,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:23,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217057598] [2024-11-10 10:24:23,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:23,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:23,898 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 10:24:23,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:23,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217057598] [2024-11-10 10:24:23,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217057598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:24:23,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:24:23,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:24:23,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333977626] [2024-11-10 10:24:23,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:24:23,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:24:23,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:23,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:24:23,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:24:23,900 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 211 [2024-11-10 10:24:23,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 211 transitions, 438 flow. Second operand has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:23,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:23,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 211 [2024-11-10 10:24:23,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:28,804 INFO L124 PetriNetUnfolderBase]: 35432/70720 cut-off events. [2024-11-10 10:24:28,804 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2024-11-10 10:24:28,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121898 conditions, 70720 events. 35432/70720 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 2107. Compared 762476 event pairs, 30856 based on Foata normal form. 27503/93860 useless extension candidates. Maximal degree in co-relation 100093. Up to 51071 conditions per place. [2024-11-10 10:24:29,221 INFO L140 encePairwiseOnDemand]: 161/211 looper letters, 88 selfloop transitions, 0 changer transitions 0/161 dead transitions. [2024-11-10 10:24:29,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 161 transitions, 514 flow [2024-11-10 10:24:29,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:24:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:24:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 284 transitions. [2024-11-10 10:24:29,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6729857819905213 [2024-11-10 10:24:29,223 INFO L175 Difference]: Start difference. First operand has 156 places, 211 transitions, 438 flow. Second operand 2 states and 284 transitions. [2024-11-10 10:24:29,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 161 transitions, 514 flow [2024-11-10 10:24:29,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 161 transitions, 514 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:24:29,228 INFO L231 Difference]: Finished difference. Result has 157 places, 161 transitions, 338 flow [2024-11-10 10:24:29,228 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=338, PETRI_PLACES=157, PETRI_TRANSITIONS=161} [2024-11-10 10:24:29,230 INFO L277 CegarLoopForPetriNet]: 156 programPoint places, 1 predicate places. [2024-11-10 10:24:29,231 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 161 transitions, 338 flow [2024-11-10 10:24:29,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:29,231 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:29,232 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:29,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:24:29,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:24:29,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:29,232 INFO L85 PathProgramCache]: Analyzing trace with hash 624035073, now seen corresponding path program 1 times [2024-11-10 10:24:29,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:29,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292046906] [2024-11-10 10:24:29,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:29,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 10:24:29,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:29,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292046906] [2024-11-10 10:24:29,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292046906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:24:29,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:24:29,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:24:29,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328191152] [2024-11-10 10:24:29,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:24:29,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:24:29,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:29,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:24:29,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:24:29,278 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 211 [2024-11-10 10:24:29,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 161 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:29,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:29,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 211 [2024-11-10 10:24:29,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:33,799 INFO L124 PetriNetUnfolderBase]: 35432/70722 cut-off events. [2024-11-10 10:24:33,800 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2024-11-10 10:24:33,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121903 conditions, 70722 events. 35432/70722 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 2107. Compared 762488 event pairs, 30856 based on Foata normal form. 0/66358 useless extension candidates. Maximal degree in co-relation 121898. Up to 51072 conditions per place. [2024-11-10 10:24:34,181 INFO L140 encePairwiseOnDemand]: 208/211 looper letters, 88 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2024-11-10 10:24:34,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 162 transitions, 520 flow [2024-11-10 10:24:34,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:24:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:24:34,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2024-11-10 10:24:34,183 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4849921011058452 [2024-11-10 10:24:34,183 INFO L175 Difference]: Start difference. First operand has 157 places, 161 transitions, 338 flow. Second operand 3 states and 307 transitions. [2024-11-10 10:24:34,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 162 transitions, 520 flow [2024-11-10 10:24:34,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 162 transitions, 520 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:24:34,189 INFO L231 Difference]: Finished difference. Result has 160 places, 162 transitions, 350 flow [2024-11-10 10:24:34,189 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=160, PETRI_TRANSITIONS=162} [2024-11-10 10:24:34,190 INFO L277 CegarLoopForPetriNet]: 156 programPoint places, 4 predicate places. [2024-11-10 10:24:34,190 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 162 transitions, 350 flow [2024-11-10 10:24:34,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:34,191 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:34,191 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:34,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:24:34,191 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:24:34,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:34,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1551976555, now seen corresponding path program 1 times [2024-11-10 10:24:34,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:34,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923576701] [2024-11-10 10:24:34,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:34,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:34,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 10:24:34,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:34,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923576701] [2024-11-10 10:24:34,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923576701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:24:34,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090636204] [2024-11-10 10:24:34,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:34,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:24:34,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:24:34,256 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:24:34,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 10:24:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:34,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 10:24:34,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:24:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 10:24:34,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:24:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 10:24:34,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090636204] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:24:34,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:24:34,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-10 10:24:34,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909182646] [2024-11-10 10:24:34,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:24:34,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:24:34,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:34,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:24:34,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:24:34,371 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 211 [2024-11-10 10:24:34,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 162 transitions, 350 flow. Second operand has 7 states, 7 states have (on average 73.85714285714286) internal successors, (517), 7 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:34,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:34,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 211 [2024-11-10 10:24:34,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:39,234 INFO L124 PetriNetUnfolderBase]: 35432/70728 cut-off events. [2024-11-10 10:24:39,234 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2024-11-10 10:24:39,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121922 conditions, 70728 events. 35432/70728 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 2107. Compared 762291 event pairs, 30856 based on Foata normal form. 0/66364 useless extension candidates. Maximal degree in co-relation 121915. Up to 51072 conditions per place. [2024-11-10 10:24:39,620 INFO L140 encePairwiseOnDemand]: 208/211 looper letters, 88 selfloop transitions, 5 changer transitions 0/165 dead transitions. [2024-11-10 10:24:39,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 165 transitions, 548 flow [2024-11-10 10:24:39,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:24:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:24:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 528 transitions. [2024-11-10 10:24:39,622 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41706161137440756 [2024-11-10 10:24:39,622 INFO L175 Difference]: Start difference. First operand has 160 places, 162 transitions, 350 flow. Second operand 6 states and 528 transitions. [2024-11-10 10:24:39,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 165 transitions, 548 flow [2024-11-10 10:24:39,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 165 transitions, 546 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:24:39,625 INFO L231 Difference]: Finished difference. Result has 167 places, 165 transitions, 384 flow [2024-11-10 10:24:39,625 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=167, PETRI_TRANSITIONS=165} [2024-11-10 10:24:39,626 INFO L277 CegarLoopForPetriNet]: 156 programPoint places, 11 predicate places. [2024-11-10 10:24:39,626 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 165 transitions, 384 flow [2024-11-10 10:24:39,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.85714285714286) internal successors, (517), 7 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:39,626 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:39,626 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:39,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 10:24:39,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:24:39,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:24:39,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:39,828 INFO L85 PathProgramCache]: Analyzing trace with hash 331244457, now seen corresponding path program 2 times [2024-11-10 10:24:39,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:39,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964270335] [2024-11-10 10:24:39,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:39,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 10:24:39,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:39,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964270335] [2024-11-10 10:24:39,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964270335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:24:39,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440590208] [2024-11-10 10:24:39,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:24:39,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:24:39,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:24:39,925 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:24:39,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 10:24:40,017 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 10:24:40,017 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:24:40,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 10:24:40,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:24:40,046 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 10:24:40,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:24:40,102 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 10:24:40,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440590208] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:24:40,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:24:40,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-10 10:24:40,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426096173] [2024-11-10 10:24:40,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:24:40,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:24:40,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:40,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:24:40,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:24:40,107 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 211 [2024-11-10 10:24:40,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 165 transitions, 384 flow. Second operand has 13 states, 13 states have (on average 73.46153846153847) internal successors, (955), 13 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:40,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:40,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 211 [2024-11-10 10:24:40,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:45,128 INFO L124 PetriNetUnfolderBase]: 35432/70740 cut-off events. [2024-11-10 10:24:45,129 INFO L125 PetriNetUnfolderBase]: For 218/218 co-relation queries the response was YES. [2024-11-10 10:24:45,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121966 conditions, 70740 events. 35432/70740 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 2107. Compared 762379 event pairs, 30856 based on Foata normal form. 6/66383 useless extension candidates. Maximal degree in co-relation 121956. Up to 51072 conditions per place. [2024-11-10 10:24:45,664 INFO L140 encePairwiseOnDemand]: 208/211 looper letters, 88 selfloop transitions, 11 changer transitions 0/171 dead transitions. [2024-11-10 10:24:45,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 171 transitions, 618 flow [2024-11-10 10:24:45,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 10:24:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 10:24:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 969 transitions. [2024-11-10 10:24:45,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38270142180094785 [2024-11-10 10:24:45,668 INFO L175 Difference]: Start difference. First operand has 167 places, 165 transitions, 384 flow. Second operand 12 states and 969 transitions. [2024-11-10 10:24:45,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 171 transitions, 618 flow [2024-11-10 10:24:45,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 171 transitions, 610 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-10 10:24:45,673 INFO L231 Difference]: Finished difference. Result has 183 places, 171 transitions, 460 flow [2024-11-10 10:24:45,674 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=460, PETRI_PLACES=183, PETRI_TRANSITIONS=171} [2024-11-10 10:24:45,675 INFO L277 CegarLoopForPetriNet]: 156 programPoint places, 27 predicate places. [2024-11-10 10:24:45,675 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 171 transitions, 460 flow [2024-11-10 10:24:45,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 73.46153846153847) internal successors, (955), 13 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:45,676 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:45,676 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:45,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 10:24:45,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:24:45,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:24:45,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:45,878 INFO L85 PathProgramCache]: Analyzing trace with hash 442877605, now seen corresponding path program 3 times [2024-11-10 10:24:45,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:45,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423945675] [2024-11-10 10:24:45,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:45,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:24:45,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:24:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:24:45,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:24:45,934 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:24:45,934 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-11-10 10:24:45,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-10 10:24:45,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-11-10 10:24:45,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-11-10 10:24:45,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-11-10 10:24:45,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-10 10:24:45,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 10:24:45,936 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2024-11-10 10:24:45,937 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:24:45,937 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 10:24:45,968 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 10:24:45,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 262 transitions, 551 flow [2024-11-10 10:24:46,006 INFO L124 PetriNetUnfolderBase]: 168/599 cut-off events. [2024-11-10 10:24:46,007 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-10 10:24:46,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 599 events. 168/599 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3383 event pairs, 1 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 429. Up to 16 conditions per place. [2024-11-10 10:24:46,016 INFO L82 GeneralOperation]: Start removeDead. Operand has 194 places, 262 transitions, 551 flow [2024-11-10 10:24:46,023 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 194 places, 262 transitions, 551 flow [2024-11-10 10:24:46,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:24:46,024 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;@3312fe6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:24:46,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 10:24:46,032 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:24:46,032 INFO L124 PetriNetUnfolderBase]: 33/159 cut-off events. [2024-11-10 10:24:46,032 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 10:24:46,032 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:46,032 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:46,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 10:24:46,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:46,033 INFO L85 PathProgramCache]: Analyzing trace with hash 649190093, now seen corresponding path program 1 times [2024-11-10 10:24:46,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:46,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159365421] [2024-11-10 10:24:46,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:46,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:24:46,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:46,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159365421] [2024-11-10 10:24:46,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159365421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:24:46,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:24:46,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:24:46,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216007695] [2024-11-10 10:24:46,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:24:46,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:24:46,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:46,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:24:46,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:24:46,052 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 262 [2024-11-10 10:24:46,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 262 transitions, 551 flow. Second operand has 2 states, 2 states have (on average 96.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:46,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:46,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 262 [2024-11-10 10:24:46,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand