./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 448d4d75 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/29_conditionals_vs.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 c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-448d4d7-m [2024-02-20 11:29:23,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 11:29:23,143 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 11:29:23,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 11:29:23,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 11:29:23,178 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 11:29:23,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 11:29:23,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 11:29:23,180 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 11:29:23,183 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 11:29:23,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 11:29:23,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 11:29:23,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 11:29:23,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 11:29:23,185 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 11:29:23,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 11:29:23,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 11:29:23,186 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 11:29:23,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 11:29:23,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 11:29:23,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 11:29:23,187 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 11:29:23,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 11:29:23,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 11:29:23,188 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 11:29:23,188 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 11:29:23,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 11:29:23,189 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 11:29:23,189 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 11:29:23,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 11:29:23,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 11:29:23,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 11:29:23,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:29:23,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 11:29:23,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 11:29:23,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 11:29:23,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 11:29:23,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 11:29:23,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 11:29:23,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 11:29:23,192 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 11:29:23,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 11:29:23,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 11:29:23,193 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 -> c3f647420f42d7fdb333957b618cdd528a4c5a4cecdb35105a1a2630df70b3d6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 11:29:23,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 11:29:23,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 11:29:23,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 11:29:23,424 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 11:29:23,424 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 11:29:23,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i [2024-02-20 11:29:24,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 11:29:24,669 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 11:29:24,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i [2024-02-20 11:29:24,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d26b6425/9e65ef2083294aef92890f643bffd338/FLAGc23206f56 [2024-02-20 11:29:24,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d26b6425/9e65ef2083294aef92890f643bffd338 [2024-02-20 11:29:24,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 11:29:24,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 11:29:24,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 11:29:24,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 11:29:24,707 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 11:29:24,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:29:24" (1/1) ... [2024-02-20 11:29:24,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b33420b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:29:24, skipping insertion in model container [2024-02-20 11:29:24,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:29:24" (1/1) ... [2024-02-20 11:29:24,737 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 11:29:24,949 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i[30422,30435] [2024-02-20 11:29:24,960 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:29:24,967 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 11:29:25,011 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/29_conditionals_vs.i[30422,30435] [2024-02-20 11:29:25,014 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:29:25,050 INFO L206 MainTranslator]: Completed translation [2024-02-20 11:29:25,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:29:25 WrapperNode [2024-02-20 11:29:25,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 11:29:25,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 11:29:25,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 11:29:25,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 11:29:25,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:29:25" (1/1) ... [2024-02-20 11:29:25,080 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:29:25" (1/1) ... [2024-02-20 11:29:25,104 INFO L138 Inliner]: procedures = 170, calls = 14, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 60 [2024-02-20 11:29:25,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 11:29:25,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 11:29:25,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 11:29:25,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 11:29:25,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:29:25" (1/1) ... [2024-02-20 11:29:25,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:29:25" (1/1) ... [2024-02-20 11:29:25,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:29:25" (1/1) ... [2024-02-20 11:29:25,136 INFO L175 MemorySlicer]: Split 3 memory accesses to 2 slices as follows [2, 1]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-02-20 11:29:25,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:29:25" (1/1) ... [2024-02-20 11:29:25,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:29:25" (1/1) ... [2024-02-20 11:29:25,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:29:25" (1/1) ... [2024-02-20 11:29:25,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:29:25" (1/1) ... [2024-02-20 11:29:25,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:29:25" (1/1) ... [2024-02-20 11:29:25,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:29:25" (1/1) ... [2024-02-20 11:29:25,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 11:29:25,145 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 11:29:25,145 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 11:29:25,145 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 11:29:25,145 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:29:25" (1/1) ... [2024-02-20 11:29:25,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:29:25,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:29:25,182 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-02-20 11:29:25,196 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-02-20 11:29:25,215 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-02-20 11:29:25,216 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-02-20 11:29:25,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 11:29:25,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 11:29:25,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 11:29:25,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 11:29:25,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 11:29:25,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 11:29:25,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 11:29:25,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 11:29:25,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 11:29:25,218 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 11:29:25,357 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 11:29:25,358 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 11:29:25,462 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 11:29:25,462 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 11:29:25,523 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 11:29:25,523 INFO L320 CfgBuilder]: Removed 1 assume(true) statements. [2024-02-20 11:29:25,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:29:25 BoogieIcfgContainer [2024-02-20 11:29:25,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 11:29:25,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 11:29:25,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 11:29:25,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 11:29:25,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:29:24" (1/3) ... [2024-02-20 11:29:25,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596f514c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:29:25, skipping insertion in model container [2024-02-20 11:29:25,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:29:25" (2/3) ... [2024-02-20 11:29:25,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596f514c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:29:25, skipping insertion in model container [2024-02-20 11:29:25,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:29:25" (3/3) ... [2024-02-20 11:29:25,530 INFO L112 eAbstractionObserver]: Analyzing ICFG 29_conditionals_vs.i [2024-02-20 11:29:25,543 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 11:29:25,544 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 11:29:25,544 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 11:29:25,575 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-20 11:29:25,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 19 transitions, 42 flow [2024-02-20 11:29:25,625 INFO L124 PetriNetUnfolderBase]: 3/21 cut-off events. [2024-02-20 11:29:25,625 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-20 11:29:25,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 21 events. 3/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 16. Up to 3 conditions per place. [2024-02-20 11:29:25,627 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 19 transitions, 42 flow [2024-02-20 11:29:25,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 19 transitions, 42 flow [2024-02-20 11:29:25,644 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:29:25,651 INFO L369 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@7c699b9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:29:25,655 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-20 11:29:25,666 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:29:25,675 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2024-02-20 11:29:25,676 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-20 11:29:25,676 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:29:25,677 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-02-20 11:29:25,677 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-02-20 11:29:25,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:29:25,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1655626239, now seen corresponding path program 1 times [2024-02-20 11:29:25,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:29:25,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624313804] [2024-02-20 11:29:25,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:29:25,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:29:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-20 11:29:25,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-20 11:29:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-20 11:29:25,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-20 11:29:25,799 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-20 11:29:25,800 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-02-20 11:29:25,801 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-02-20 11:29:25,801 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-02-20 11:29:25,802 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 11:29:25,802 INFO L457 BasicCegarLoop]: Path program histogram: [1] [2024-02-20 11:29:25,805 WARN L345 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-20 11:29:25,805 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-02-20 11:29:25,822 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-20 11:29:25,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 76 flow [2024-02-20 11:29:25,831 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2024-02-20 11:29:25,836 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 11:29:25,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 38 events. 6/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2024-02-20 11:29:25,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 33 transitions, 76 flow [2024-02-20 11:29:25,839 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 33 transitions, 76 flow [2024-02-20 11:29:25,841 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:29:25,842 INFO L369 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@7c699b9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:29:25,843 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-20 11:29:25,848 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:29:25,852 INFO L124 PetriNetUnfolderBase]: 3/24 cut-off events. [2024-02-20 11:29:25,852 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 11:29:25,852 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:29:25,852 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2024-02-20 11:29:25,853 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-02-20 11:29:25,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:29:25,853 INFO L85 PathProgramCache]: Analyzing trace with hash 370936135, now seen corresponding path program 1 times [2024-02-20 11:29:25,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:29:25,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721494160] [2024-02-20 11:29:25,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:29:25,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:29:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-20 11:29:25,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-20 11:29:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-20 11:29:25,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-20 11:29:25,914 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-20 11:29:25,915 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-02-20 11:29:25,915 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-02-20 11:29:25,916 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-02-20 11:29:25,916 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-02-20 11:29:25,917 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 11:29:25,917 INFO L457 BasicCegarLoop]: Path program histogram: [1] [2024-02-20 11:29:25,919 WARN L345 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-20 11:29:25,920 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-02-20 11:29:25,952 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-20 11:29:25,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 47 transitions, 112 flow [2024-02-20 11:29:25,975 INFO L124 PetriNetUnfolderBase]: 9/55 cut-off events. [2024-02-20 11:29:25,983 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-02-20 11:29:25,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 9/55 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2024-02-20 11:29:25,997 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 47 transitions, 112 flow [2024-02-20 11:29:26,000 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 47 transitions, 112 flow [2024-02-20 11:29:26,002 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:29:26,007 INFO L369 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@7c699b9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:29:26,007 INFO L370 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-02-20 11:29:26,016 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:29:26,016 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2024-02-20 11:29:26,017 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-20 11:29:26,017 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:29:26,017 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:29:26,018 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-02-20 11:29:26,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:29:26,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1050246315, now seen corresponding path program 1 times [2024-02-20 11:29:26,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:29:26,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961474951] [2024-02-20 11:29:26,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:29:26,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:29:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:29:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:29:26,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:29:26,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961474951] [2024-02-20 11:29:26,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961474951] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:29:26,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:29:26,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:29:26,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301007112] [2024-02-20 11:29:26,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:29:26,265 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:29:26,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:29:26,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:29:26,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:29:26,309 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-02-20 11:29:26,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-02-20 11:29:26,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:29:26,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-02-20 11:29:26,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:29:26,857 INFO L124 PetriNetUnfolderBase]: 3454/5586 cut-off events. [2024-02-20 11:29:26,857 INFO L125 PetriNetUnfolderBase]: For 484/484 co-relation queries the response was YES. [2024-02-20 11:29:26,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10795 conditions, 5586 events. 3454/5586 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 34786 event pairs, 736 based on Foata normal form. 564/5799 useless extension candidates. Maximal degree in co-relation 4764. Up to 2085 conditions per place. [2024-02-20 11:29:26,894 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 52 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2024-02-20 11:29:26,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 296 flow [2024-02-20 11:29:26,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:29:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:29:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-02-20 11:29:26,904 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7127659574468085 [2024-02-20 11:29:26,907 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2024-02-20 11:29:26,907 INFO L507 AbstractCegarLoop]: Abstraction has has 47 places, 72 transitions, 296 flow [2024-02-20 11:29:26,907 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-02-20 11:29:26,907 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:29:26,908 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:29:26,908 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 11:29:26,908 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-02-20 11:29:26,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:29:26,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1050247338, now seen corresponding path program 1 times [2024-02-20 11:29:26,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:29:26,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641179824] [2024-02-20 11:29:26,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:29:26,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:29:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:29:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:29:26,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:29:26,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641179824] [2024-02-20 11:29:26,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641179824] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:29:26,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:29:26,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:29:26,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597888737] [2024-02-20 11:29:26,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:29:26,952 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:29:26,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:29:26,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:29:26,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:29:26,961 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2024-02-20 11:29:26,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 72 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-02-20 11:29:26,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:29:26,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2024-02-20 11:29:26,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:29:27,380 INFO L124 PetriNetUnfolderBase]: 3454/5328 cut-off events. [2024-02-20 11:29:27,381 INFO L125 PetriNetUnfolderBase]: For 930/1275 co-relation queries the response was YES. [2024-02-20 11:29:27,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15287 conditions, 5328 events. 3454/5328 cut-off events. For 930/1275 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 30970 event pairs, 736 based on Foata normal form. 105/5211 useless extension candidates. Maximal degree in co-relation 6816. Up to 2085 conditions per place. [2024-02-20 11:29:27,416 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 67 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2024-02-20 11:29:27,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 84 transitions, 496 flow [2024-02-20 11:29:27,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:29:27,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:29:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2024-02-20 11:29:27,418 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6382978723404256 [2024-02-20 11:29:27,419 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2024-02-20 11:29:27,419 INFO L507 AbstractCegarLoop]: Abstraction has has 48 places, 84 transitions, 496 flow [2024-02-20 11:29:27,419 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-02-20 11:29:27,419 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:29:27,419 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2024-02-20 11:29:27,420 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-20 11:29:27,420 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-02-20 11:29:27,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:29:27,420 INFO L85 PathProgramCache]: Analyzing trace with hash -315337826, now seen corresponding path program 1 times [2024-02-20 11:29:27,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:29:27,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46493123] [2024-02-20 11:29:27,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:29:27,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:29:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-20 11:29:27,432 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-20 11:29:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-20 11:29:27,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-20 11:29:27,441 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-20 11:29:27,441 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-02-20 11:29:27,442 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-02-20 11:29:27,442 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-02-20 11:29:27,442 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-02-20 11:29:27,442 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-02-20 11:29:27,442 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 11:29:27,443 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-02-20 11:29:27,443 WARN L345 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-20 11:29:27,443 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-02-20 11:29:27,461 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-20 11:29:27,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 61 transitions, 150 flow [2024-02-20 11:29:27,468 INFO L124 PetriNetUnfolderBase]: 12/72 cut-off events. [2024-02-20 11:29:27,468 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-02-20 11:29:27,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 72 events. 12/72 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 175 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 67. Up to 5 conditions per place. [2024-02-20 11:29:27,469 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 61 transitions, 150 flow [2024-02-20 11:29:27,470 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 61 transitions, 150 flow [2024-02-20 11:29:27,471 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:29:27,471 INFO L369 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@7c699b9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:29:27,471 INFO L370 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-02-20 11:29:27,473 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:29:27,474 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2024-02-20 11:29:27,474 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-20 11:29:27,474 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:29:27,474 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:29:27,474 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-02-20 11:29:27,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:29:27,475 INFO L85 PathProgramCache]: Analyzing trace with hash 546893205, now seen corresponding path program 1 times [2024-02-20 11:29:27,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:29:27,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914870652] [2024-02-20 11:29:27,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:29:27,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:29:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:29:27,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:29:27,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:29:27,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914870652] [2024-02-20 11:29:27,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914870652] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:29:27,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:29:27,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:29:27,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848425190] [2024-02-20 11:29:27,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:29:27,514 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:29:27,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:29:27,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:29:27,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:29:27,521 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 61 [2024-02-20 11:29:27,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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-02-20 11:29:27,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:29:27,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 61 [2024-02-20 11:29:27,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:29:30,038 INFO L124 PetriNetUnfolderBase]: 28492/41307 cut-off events. [2024-02-20 11:29:30,038 INFO L125 PetriNetUnfolderBase]: For 5011/5011 co-relation queries the response was YES. [2024-02-20 11:29:30,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80861 conditions, 41307 events. 28492/41307 cut-off events. For 5011/5011 co-relation queries the response was YES. Maximal size of possible extension queue 1557. Compared 289037 event pairs, 6352 based on Foata normal form. 4892/44047 useless extension candidates. Maximal degree in co-relation 10947. Up to 15765 conditions per place. [2024-02-20 11:29:30,454 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 70 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2024-02-20 11:29:30,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 97 transitions, 410 flow [2024-02-20 11:29:30,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:29:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:29:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2024-02-20 11:29:30,456 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-02-20 11:29:30,457 INFO L308 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2024-02-20 11:29:30,457 INFO L507 AbstractCegarLoop]: Abstraction has has 60 places, 97 transitions, 410 flow [2024-02-20 11:29:30,457 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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-02-20 11:29:30,457 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:29:30,457 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:29:30,458 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-20 11:29:30,458 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-02-20 11:29:30,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:29:30,458 INFO L85 PathProgramCache]: Analyzing trace with hash 546894228, now seen corresponding path program 1 times [2024-02-20 11:29:30,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:29:30,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255115959] [2024-02-20 11:29:30,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:29:30,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:29:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:29:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:29:30,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:29:30,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255115959] [2024-02-20 11:29:30,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255115959] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:29:30,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:29:30,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:29:30,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877034636] [2024-02-20 11:29:30,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:29:30,491 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:29:30,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:29:30,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:29:30,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:29:30,504 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-02-20 11:29:30,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 97 transitions, 410 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-02-20 11:29:30,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:29:30,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-02-20 11:29:30,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:29:32,882 INFO L124 PetriNetUnfolderBase]: 28492/39753 cut-off events. [2024-02-20 11:29:32,883 INFO L125 PetriNetUnfolderBase]: For 8420/10881 co-relation queries the response was YES. [2024-02-20 11:29:32,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115593 conditions, 39753 events. 28492/39753 cut-off events. For 8420/10881 co-relation queries the response was YES. Maximal size of possible extension queue 1427. Compared 258528 event pairs, 6352 based on Foata normal form. 630/39008 useless extension candidates. Maximal degree in co-relation 15771. Up to 15765 conditions per place. [2024-02-20 11:29:33,405 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 91 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2024-02-20 11:29:33,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 115 transitions, 691 flow [2024-02-20 11:29:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:29:33,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:29:33,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2024-02-20 11:29:33,408 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.680327868852459 [2024-02-20 11:29:33,409 INFO L308 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2024-02-20 11:29:33,409 INFO L507 AbstractCegarLoop]: Abstraction has has 61 places, 115 transitions, 691 flow [2024-02-20 11:29:33,409 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-02-20 11:29:33,410 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:29:33,410 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:29:33,410 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-20 11:29:33,410 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-02-20 11:29:33,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:29:33,411 INFO L85 PathProgramCache]: Analyzing trace with hash -135844057, now seen corresponding path program 1 times [2024-02-20 11:29:33,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:29:33,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685223704] [2024-02-20 11:29:33,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:29:33,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:29:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:29:33,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:29:33,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:29:33,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685223704] [2024-02-20 11:29:33,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685223704] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:29:33,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:29:33,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:29:33,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511151619] [2024-02-20 11:29:33,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:29:33,476 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:29:33,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:29:33,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:29:33,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:29:33,484 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 61 [2024-02-20 11:29:33,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 115 transitions, 691 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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-02-20 11:29:33,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:29:33,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 61 [2024-02-20 11:29:33,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:29:38,899 INFO L124 PetriNetUnfolderBase]: 61788/84332 cut-off events. [2024-02-20 11:29:38,899 INFO L125 PetriNetUnfolderBase]: For 93261/114060 co-relation queries the response was YES. [2024-02-20 11:29:39,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313283 conditions, 84332 events. 61788/84332 cut-off events. For 93261/114060 co-relation queries the response was YES. Maximal size of possible extension queue 3157. Compared 566617 event pairs, 4522 based on Foata normal form. 105/79829 useless extension candidates. Maximal degree in co-relation 119866. Up to 33223 conditions per place. [2024-02-20 11:29:39,790 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 221 selfloop transitions, 6 changer transitions 0/248 dead transitions. [2024-02-20 11:29:39,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 248 transitions, 2075 flow [2024-02-20 11:29:39,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:29:39,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:29:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2024-02-20 11:29:39,802 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2024-02-20 11:29:39,802 INFO L308 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2024-02-20 11:29:39,802 INFO L507 AbstractCegarLoop]: Abstraction has has 64 places, 248 transitions, 2075 flow [2024-02-20 11:29:39,803 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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-02-20 11:29:39,803 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:29:39,803 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:29:39,803 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-20 11:29:39,803 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-02-20 11:29:39,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:29:39,803 INFO L85 PathProgramCache]: Analyzing trace with hash -135843034, now seen corresponding path program 1 times [2024-02-20 11:29:39,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:29:39,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775135519] [2024-02-20 11:29:39,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:29:39,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:29:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:29:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:29:39,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:29:39,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775135519] [2024-02-20 11:29:39,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775135519] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:29:39,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:29:39,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:29:39,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274939274] [2024-02-20 11:29:39,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:29:39,850 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:29:39,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:29:39,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:29:39,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:29:39,858 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-02-20 11:29:39,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 248 transitions, 2075 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-02-20 11:29:39,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:29:39,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-02-20 11:29:39,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:29:45,577 INFO L124 PetriNetUnfolderBase]: 62372/83034 cut-off events. [2024-02-20 11:29:45,577 INFO L125 PetriNetUnfolderBase]: For 140041/164431 co-relation queries the response was YES. [2024-02-20 11:29:45,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386462 conditions, 83034 events. 62372/83034 cut-off events. For 140041/164431 co-relation queries the response was YES. Maximal size of possible extension queue 2981. Compared 525282 event pairs, 5034 based on Foata normal form. 1632/81594 useless extension candidates. Maximal degree in co-relation 148496. Up to 32365 conditions per place. [2024-02-20 11:29:46,378 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 285 selfloop transitions, 5 changer transitions 0/309 dead transitions. [2024-02-20 11:29:46,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 309 transitions, 3217 flow [2024-02-20 11:29:46,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:29:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:29:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2024-02-20 11:29:46,380 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6721311475409836 [2024-02-20 11:29:46,382 INFO L308 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2024-02-20 11:29:46,382 INFO L507 AbstractCegarLoop]: Abstraction has has 65 places, 309 transitions, 3217 flow [2024-02-20 11:29:46,382 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-02-20 11:29:46,382 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:29:46,383 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2024-02-20 11:29:46,383 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-20 11:29:46,383 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-02-20 11:29:46,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:29:46,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1585694516, now seen corresponding path program 1 times [2024-02-20 11:29:46,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:29:46,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740488970] [2024-02-20 11:29:46,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:29:46,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:29:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-20 11:29:46,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-20 11:29:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-20 11:29:46,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-20 11:29:46,418 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-20 11:29:46,418 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-02-20 11:29:46,418 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-02-20 11:29:46,419 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-02-20 11:29:46,420 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-02-20 11:29:46,420 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-02-20 11:29:46,421 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-02-20 11:29:46,421 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-20 11:29:46,421 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-02-20 11:29:46,423 WARN L345 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-20 11:29:46,423 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-02-20 11:29:46,449 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-20 11:29:46,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 75 transitions, 190 flow [2024-02-20 11:29:46,458 INFO L124 PetriNetUnfolderBase]: 15/89 cut-off events. [2024-02-20 11:29:46,459 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-02-20 11:29:46,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 89 events. 15/89 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 230 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 90. Up to 6 conditions per place. [2024-02-20 11:29:46,459 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 75 transitions, 190 flow [2024-02-20 11:29:46,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 75 transitions, 190 flow [2024-02-20 11:29:46,461 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:29:46,462 INFO L369 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@7c699b9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:29:46,462 INFO L370 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-02-20 11:29:46,464 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:29:46,464 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2024-02-20 11:29:46,464 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-20 11:29:46,464 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:29:46,464 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:29:46,464 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-02-20 11:29:46,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:29:46,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1676329523, now seen corresponding path program 1 times [2024-02-20 11:29:46,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:29:46,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673933478] [2024-02-20 11:29:46,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:29:46,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:29:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:29:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:29:46,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:29:46,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673933478] [2024-02-20 11:29:46,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673933478] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:29:46,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:29:46,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:29:46,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519053700] [2024-02-20 11:29:46,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:29:46,512 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:29:46,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:29:46,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:29:46,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:29:46,520 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2024-02-20 11:29:46,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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-02-20 11:29:46,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:29:46,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2024-02-20 11:29:46,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand