./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.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/11_fmaxsymopt.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 963498115a8eca6e92c68ab7fa8168826446f05b9b398350c3ee0745adf1bb45 --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:27:49,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 11:27:49,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 11:27:49,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 11:27:49,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 11:27:49,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 11:27:49,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 11:27:49,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 11:27:49,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 11:27:49,486 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 11:27:49,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 11:27:49,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 11:27:49,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 11:27:49,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 11:27:49,489 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 11:27:49,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 11:27:49,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 11:27:49,489 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 11:27:49,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 11:27:49,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 11:27:49,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 11:27:49,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 11:27:49,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 11:27:49,491 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 11:27:49,491 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 11:27:49,491 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 11:27:49,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 11:27:49,491 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 11:27:49,492 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 11:27:49,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 11:27:49,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 11:27:49,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 11:27:49,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:27:49,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 11:27:49,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 11:27:49,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 11:27:49,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 11:27:49,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 11:27:49,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 11:27:49,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 11:27:49,495 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 11:27:49,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 11:27:49,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 11:27:49,496 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 -> 963498115a8eca6e92c68ab7fa8168826446f05b9b398350c3ee0745adf1bb45 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 11:27:49,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 11:27:49,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 11:27:49,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 11:27:49,820 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 11:27:49,821 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 11:27:49,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i [2024-02-20 11:27:50,809 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 11:27:51,029 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 11:27:51,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt.i [2024-02-20 11:27:51,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54d32f36f/e096b8e8cce442ee9edcce4847b5b858/FLAG96664f6df [2024-02-20 11:27:51,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54d32f36f/e096b8e8cce442ee9edcce4847b5b858 [2024-02-20 11:27:51,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 11:27:51,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 11:27:51,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 11:27:51,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 11:27:51,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 11:27:51,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:27:51" (1/1) ... [2024-02-20 11:27:51,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33346cb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:51, skipping insertion in model container [2024-02-20 11:27:51,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:27:51" (1/1) ... [2024-02-20 11:27:51,127 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 11:27:51,406 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/11_fmaxsymopt.i[30540,30553] [2024-02-20 11:27:51,416 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:27:51,426 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 11:27:51,463 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/11_fmaxsymopt.i[30540,30553] [2024-02-20 11:27:51,477 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:27:51,511 INFO L206 MainTranslator]: Completed translation [2024-02-20 11:27:51,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:51 WrapperNode [2024-02-20 11:27:51,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 11:27:51,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 11:27:51,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 11:27:51,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 11:27:51,520 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:27:51" (1/1) ... [2024-02-20 11:27:51,541 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:27:51" (1/1) ... [2024-02-20 11:27:51,580 INFO L138 Inliner]: procedures = 171, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2024-02-20 11:27:51,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 11:27:51,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 11:27:51,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 11:27:51,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 11:27:51,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:51" (1/1) ... [2024-02-20 11:27:51,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:51" (1/1) ... [2024-02-20 11:27:51,602 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:51" (1/1) ... [2024-02-20 11:27:51,616 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 7, 1]. 70 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 1 writes are split as follows [0, 0, 1]. [2024-02-20 11:27:51,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:51" (1/1) ... [2024-02-20 11:27:51,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:51" (1/1) ... [2024-02-20 11:27:51,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:51" (1/1) ... [2024-02-20 11:27:51,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:51" (1/1) ... [2024-02-20 11:27:51,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:51" (1/1) ... [2024-02-20 11:27:51,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:51" (1/1) ... [2024-02-20 11:27:51,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 11:27:51,636 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 11:27:51,637 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 11:27:51,637 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 11:27:51,637 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:51" (1/1) ... [2024-02-20 11:27:51,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:27:51,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:27:51,664 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:27:51,668 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:27:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-20 11:27:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-20 11:27:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-20 11:27:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-02-20 11:27:51,732 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-02-20 11:27:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 11:27:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 11:27:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 11:27:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 11:27:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 11:27:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 11:27:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 11:27:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 11:27:51,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 11:27:51,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 11:27:51,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 11:27:51,735 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:27:51,852 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 11:27:51,853 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 11:27:52,124 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 11:27:52,125 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 11:27:52,244 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 11:27:52,244 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-20 11:27:52,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:27:52 BoogieIcfgContainer [2024-02-20 11:27:52,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 11:27:52,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 11:27:52,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 11:27:52,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 11:27:52,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:27:51" (1/3) ... [2024-02-20 11:27:52,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b5cadc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:27:52, skipping insertion in model container [2024-02-20 11:27:52,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:51" (2/3) ... [2024-02-20 11:27:52,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b5cadc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:27:52, skipping insertion in model container [2024-02-20 11:27:52,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:27:52" (3/3) ... [2024-02-20 11:27:52,256 INFO L112 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2024-02-20 11:27:52,270 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 11:27:52,270 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 11:27:52,271 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 11:27:52,313 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-20 11:27:52,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 19 transitions, 42 flow [2024-02-20 11:27:52,379 INFO L124 PetriNetUnfolderBase]: 3/21 cut-off events. [2024-02-20 11:27:52,380 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-20 11:27:52,382 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 4. Compared 33 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2024-02-20 11:27:52,382 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 19 transitions, 42 flow [2024-02-20 11:27:52,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 19 transitions, 42 flow [2024-02-20 11:27:52,393 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:27:52,398 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;@62f3c8b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:27:52,400 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-20 11:27:52,404 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:27:52,404 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2024-02-20 11:27:52,404 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-20 11:27:52,404 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:27:52,405 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-02-20 11:27:52,405 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:27:52,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:27:52,410 INFO L85 PathProgramCache]: Analyzing trace with hash -599900866, now seen corresponding path program 1 times [2024-02-20 11:27:52,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:27:52,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699311494] [2024-02-20 11:27:52,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:27:52,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:27:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-20 11:27:52,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-20 11:27:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-20 11:27:52,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-20 11:27:52,587 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-20 11:27:52,587 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-02-20 11:27:52,589 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-02-20 11:27:52,589 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-02-20 11:27:52,590 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 11:27:52,591 INFO L457 BasicCegarLoop]: Path program histogram: [1] [2024-02-20 11:27:52,597 WARN L345 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-20 11:27:52,597 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-02-20 11:27:52,627 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-20 11:27:52,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 76 flow [2024-02-20 11:27:52,645 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2024-02-20 11:27:52,646 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 11:27:52,647 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 7. Compared 85 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:27:52,647 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 33 transitions, 76 flow [2024-02-20 11:27:52,648 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 33 transitions, 76 flow [2024-02-20 11:27:52,651 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:27:52,653 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;@62f3c8b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:27:52,653 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-20 11:27:52,661 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:27:52,662 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2024-02-20 11:27:52,662 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-20 11:27:52,662 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:27:52,663 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:27:52,663 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-02-20 11:27:52,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:27:52,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1205241674, now seen corresponding path program 1 times [2024-02-20 11:27:52,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:27:52,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571732731] [2024-02-20 11:27:52,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:27:52,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:27:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:27:52,866 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:27:52,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:27:52,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571732731] [2024-02-20 11:27:52,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571732731] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:27:52,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:27:52,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:27:52,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720506490] [2024-02-20 11:27:52,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:27:52,875 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:27:52,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:27:52,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:27:52,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:27:52,910 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-02-20 11:27:52,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:27:52,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:27:52,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-02-20 11:27:52,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:27:53,150 INFO L124 PetriNetUnfolderBase]: 602/1147 cut-off events. [2024-02-20 11:27:53,151 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-02-20 11:27:53,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2132 conditions, 1147 events. 602/1147 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6043 event pairs, 254 based on Foata normal form. 93/1081 useless extension candidates. Maximal degree in co-relation 1076. Up to 494 conditions per place. [2024-02-20 11:27:53,161 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 36 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2024-02-20 11:27:53,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 46 transitions, 183 flow [2024-02-20 11:27:53,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:27:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:27:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2024-02-20 11:27:53,171 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2024-02-20 11:27:53,175 INFO L308 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2024-02-20 11:27:53,175 INFO L507 AbstractCegarLoop]: Abstraction has has 33 places, 46 transitions, 183 flow [2024-02-20 11:27:53,175 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:27:53,175 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:27:53,175 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2024-02-20 11:27:53,176 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 11:27:53,177 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-02-20 11:27:53,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:27:53,177 INFO L85 PathProgramCache]: Analyzing trace with hash 726364495, now seen corresponding path program 1 times [2024-02-20 11:27:53,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:27:53,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438756330] [2024-02-20 11:27:53,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:27:53,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:27:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-20 11:27:53,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-20 11:27:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-20 11:27:53,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-20 11:27:53,231 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-20 11:27:53,232 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-02-20 11:27:53,232 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-02-20 11:27:53,233 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-02-20 11:27:53,233 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-02-20 11:27:53,233 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 11:27:53,233 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2024-02-20 11:27:53,234 WARN L345 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-20 11:27:53,234 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-02-20 11:27:53,258 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-20 11:27:53,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 47 transitions, 112 flow [2024-02-20 11:27:53,266 INFO L124 PetriNetUnfolderBase]: 9/55 cut-off events. [2024-02-20 11:27:53,267 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-02-20 11:27:53,267 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 7. Compared 140 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:27:53,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 47 transitions, 112 flow [2024-02-20 11:27:53,268 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 47 transitions, 112 flow [2024-02-20 11:27:53,269 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:27:53,271 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;@62f3c8b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:27:53,272 INFO L370 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-02-20 11:27:53,279 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:27:53,279 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2024-02-20 11:27:53,279 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-20 11:27:53,279 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:27:53,279 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:27:53,280 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:27:53,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:27:53,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1039813422, now seen corresponding path program 1 times [2024-02-20 11:27:53,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:27:53,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231509914] [2024-02-20 11:27:53,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:27:53,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:27:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:27:53,378 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:27:53,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:27:53,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231509914] [2024-02-20 11:27:53,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231509914] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:27:53,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:27:53,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:27:53,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661600578] [2024-02-20 11:27:53,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:27:53,379 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:27:53,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:27:53,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:27:53,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:27:53,384 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-02-20 11:27:53,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:27:53,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:27:53,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-02-20 11:27:53,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:27:54,346 INFO L124 PetriNetUnfolderBase]: 7680/12078 cut-off events. [2024-02-20 11:27:54,346 INFO L125 PetriNetUnfolderBase]: For 736/736 co-relation queries the response was YES. [2024-02-20 11:27:54,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22928 conditions, 12078 events. 7680/12078 cut-off events. For 736/736 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 78117 event pairs, 3366 based on Foata normal form. 1440/11882 useless extension candidates. Maximal degree in co-relation 6754. Up to 5478 conditions per place. [2024-02-20 11:27:54,422 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 54 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-02-20 11:27:54,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 278 flow [2024-02-20 11:27:54,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:27:54,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:27:54,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-02-20 11:27:54,425 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7163120567375887 [2024-02-20 11:27:54,425 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2024-02-20 11:27:54,425 INFO L507 AbstractCegarLoop]: Abstraction has has 46 places, 68 transitions, 278 flow [2024-02-20 11:27:54,426 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:27:54,426 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:27:54,426 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:27:54,426 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-20 11:27:54,426 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:27:54,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:27:54,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1293779579, now seen corresponding path program 1 times [2024-02-20 11:27:54,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:27:54,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812490296] [2024-02-20 11:27:54,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:27:54,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:27:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:27:54,491 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:27:54,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:27:54,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812490296] [2024-02-20 11:27:54,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812490296] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:27:54,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:27:54,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:27:54,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947146919] [2024-02-20 11:27:54,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:27:54,493 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:27:54,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:27:54,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:27:54,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:27:54,497 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2024-02-20 11:27:54,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 68 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:27:54,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:27:54,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2024-02-20 11:27:54,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:27:55,882 INFO L124 PetriNetUnfolderBase]: 12680/19726 cut-off events. [2024-02-20 11:27:55,883 INFO L125 PetriNetUnfolderBase]: For 1999/2189 co-relation queries the response was YES. [2024-02-20 11:27:55,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54807 conditions, 19726 events. 12680/19726 cut-off events. For 1999/2189 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 134779 event pairs, 2924 based on Foata normal form. 354/17329 useless extension candidates. Maximal degree in co-relation 15540. Up to 9101 conditions per place. [2024-02-20 11:27:56,026 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 100 selfloop transitions, 4 changer transitions 0/115 dead transitions. [2024-02-20 11:27:56,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 115 transitions, 690 flow [2024-02-20 11:27:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:27:56,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:27:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-02-20 11:27:56,031 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6524822695035462 [2024-02-20 11:27:56,033 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2024-02-20 11:27:56,033 INFO L507 AbstractCegarLoop]: Abstraction has has 48 places, 115 transitions, 690 flow [2024-02-20 11:27:56,034 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:27:56,034 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:27:56,034 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:27:56,034 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 11:27:56,034 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-02-20 11:27:56,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:27:56,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1806750903, now seen corresponding path program 1 times [2024-02-20 11:27:56,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:27:56,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332900815] [2024-02-20 11:27:56,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:27:56,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:27:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:27:56,078 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:27:56,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:27:56,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332900815] [2024-02-20 11:27:56,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332900815] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:27:56,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:27:56,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:27:56,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875022003] [2024-02-20 11:27:56,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:27:56,080 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:27:56,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:27:56,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:27:56,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:27:56,081 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-02-20 11:27:56,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 115 transitions, 690 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:27:56,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:27:56,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-02-20 11:27:56,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:27:57,128 INFO L124 PetriNetUnfolderBase]: 9431/14581 cut-off events. [2024-02-20 11:27:57,128 INFO L125 PetriNetUnfolderBase]: For 2638/2950 co-relation queries the response was YES. [2024-02-20 11:27:57,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53969 conditions, 14581 events. 9431/14581 cut-off events. For 2638/2950 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 94111 event pairs, 654 based on Foata normal form. 3/12760 useless extension candidates. Maximal degree in co-relation 25481. Up to 10356 conditions per place. [2024-02-20 11:27:57,212 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 166 selfloop transitions, 4 changer transitions 0/181 dead transitions. [2024-02-20 11:27:57,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 181 transitions, 1464 flow [2024-02-20 11:27:57,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:27:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:27:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-02-20 11:27:57,213 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6524822695035462 [2024-02-20 11:27:57,214 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2024-02-20 11:27:57,214 INFO L507 AbstractCegarLoop]: Abstraction has has 50 places, 181 transitions, 1464 flow [2024-02-20 11:27:57,214 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:27:57,214 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:27:57,215 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2024-02-20 11:27:57,215 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-20 11:27:57,215 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-02-20 11:27:57,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:27:57,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1156617789, now seen corresponding path program 1 times [2024-02-20 11:27:57,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:27:57,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705604150] [2024-02-20 11:27:57,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:27:57,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:27:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-20 11:27:57,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-20 11:27:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-20 11:27:57,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-20 11:27:57,231 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-20 11:27:57,232 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-02-20 11:27:57,232 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-02-20 11:27:57,232 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-02-20 11:27:57,232 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-02-20 11:27:57,232 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-02-20 11:27:57,232 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-20 11:27:57,233 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-02-20 11:27:57,233 WARN L345 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-20 11:27:57,233 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-02-20 11:27:57,261 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-20 11:27:57,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 61 transitions, 150 flow [2024-02-20 11:27:57,267 INFO L124 PetriNetUnfolderBase]: 12/72 cut-off events. [2024-02-20 11:27:57,267 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-02-20 11:27:57,267 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 7. Compared 181 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:27:57,267 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 61 transitions, 150 flow [2024-02-20 11:27:57,268 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 61 transitions, 150 flow [2024-02-20 11:27:57,268 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:27:57,269 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;@62f3c8b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:27:57,269 INFO L370 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-02-20 11:27:57,270 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:27:57,270 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2024-02-20 11:27:57,271 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-20 11:27:57,271 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:27:57,271 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:27:57,271 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:27:57,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:27:57,271 INFO L85 PathProgramCache]: Analyzing trace with hash -919666948, now seen corresponding path program 1 times [2024-02-20 11:27:57,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:27:57,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278910356] [2024-02-20 11:27:57,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:27:57,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:27:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:27:57,307 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:27:57,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:27:57,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278910356] [2024-02-20 11:27:57,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278910356] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:27:57,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:27:57,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:27:57,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80631707] [2024-02-20 11:27:57,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:27:57,308 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:27:57,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:27:57,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:27:57,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:27:57,312 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2024-02-20 11:27:57,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:27:57,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:27:57,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2024-02-20 11:27:57,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:28:05,016 INFO L124 PetriNetUnfolderBase]: 84272/119490 cut-off events. [2024-02-20 11:28:05,016 INFO L125 PetriNetUnfolderBase]: For 10204/10204 co-relation queries the response was YES. [2024-02-20 11:28:05,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230053 conditions, 119490 events. 84272/119490 cut-off events. For 10204/10204 co-relation queries the response was YES. Maximal size of possible extension queue 3567. Compared 860634 event pairs, 37670 based on Foata normal form. 17210/120756 useless extension candidates. Maximal degree in co-relation 22895. Up to 56102 conditions per place. [2024-02-20 11:28:05,966 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 72 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-02-20 11:28:05,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 90 transitions, 377 flow [2024-02-20 11:28:05,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:28:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:28:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2024-02-20 11:28:05,967 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.726775956284153 [2024-02-20 11:28:05,968 INFO L308 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2024-02-20 11:28:05,968 INFO L507 AbstractCegarLoop]: Abstraction has has 59 places, 90 transitions, 377 flow [2024-02-20 11:28:05,968 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:28:05,968 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:28:05,968 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:28:05,969 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-20 11:28:05,969 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:28:05,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:28:05,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1257318341, now seen corresponding path program 1 times [2024-02-20 11:28:05,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:28:05,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815024240] [2024-02-20 11:28:05,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:28:05,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:28:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:28:06,009 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:28:06,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:28:06,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815024240] [2024-02-20 11:28:06,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815024240] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:28:06,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:28:06,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:28:06,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198260689] [2024-02-20 11:28:06,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:28:06,010 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:28:06,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:28:06,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:28:06,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:28:06,014 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2024-02-20 11:28:06,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 90 transitions, 377 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:28:06,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:28:06,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2024-02-20 11:28:06,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:28:18,513 INFO L124 PetriNetUnfolderBase]: 138882/195363 cut-off events. [2024-02-20 11:28:18,513 INFO L125 PetriNetUnfolderBase]: For 22831/24557 co-relation queries the response was YES. [2024-02-20 11:28:18,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552741 conditions, 195363 events. 138882/195363 cut-off events. For 22831/24557 co-relation queries the response was YES. Maximal size of possible extension queue 5681. Compared 1467618 event pairs, 32772 based on Foata normal form. 2886/171623 useless extension candidates. Maximal degree in co-relation 91842. Up to 92709 conditions per place. [2024-02-20 11:28:20,239 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 136 selfloop transitions, 4 changer transitions 0/155 dead transitions. [2024-02-20 11:28:20,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 155 transitions, 951 flow [2024-02-20 11:28:20,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:28:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:28:20,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2024-02-20 11:28:20,241 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-02-20 11:28:20,241 INFO L308 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2024-02-20 11:28:20,241 INFO L507 AbstractCegarLoop]: Abstraction has has 61 places, 155 transitions, 951 flow [2024-02-20 11:28:20,241 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:28:20,242 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:28:20,242 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:28:20,242 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-20 11:28:20,242 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:28:20,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:28:20,242 INFO L85 PathProgramCache]: Analyzing trace with hash -230828055, now seen corresponding path program 1 times [2024-02-20 11:28:20,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:28:20,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944896299] [2024-02-20 11:28:20,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:28:20,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:28:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:28:20,263 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:28:20,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:28:20,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944896299] [2024-02-20 11:28:20,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944896299] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:28:20,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:28:20,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:28:20,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280967628] [2024-02-20 11:28:20,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:28:20,264 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:28:20,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:28:20,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:28:20,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:28:20,265 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2024-02-20 11:28:20,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 155 transitions, 951 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:28:20,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:28:20,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2024-02-20 11:28:20,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:28:30,323 INFO L124 PetriNetUnfolderBase]: 104163/145627 cut-off events. [2024-02-20 11:28:30,324 INFO L125 PetriNetUnfolderBase]: For 26172/28784 co-relation queries the response was YES. [2024-02-20 11:28:30,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548536 conditions, 145627 events. 104163/145627 cut-off events. For 26172/28784 co-relation queries the response was YES. Maximal size of possible extension queue 4019. Compared 1044992 event pairs, 7760 based on Foata normal form. 36/127445 useless extension candidates. Maximal degree in co-relation 153855. Up to 105908 conditions per place. [2024-02-20 11:28:31,522 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 238 selfloop transitions, 4 changer transitions 0/257 dead transitions. [2024-02-20 11:28:31,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 257 transitions, 2121 flow [2024-02-20 11:28:31,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:28:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:28:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2024-02-20 11:28:31,523 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-02-20 11:28:31,525 INFO L308 CegarLoopForPetriNet]: 58 programPoint places, 5 predicate places. [2024-02-20 11:28:31,525 INFO L507 AbstractCegarLoop]: Abstraction has has 63 places, 257 transitions, 2121 flow [2024-02-20 11:28:31,525 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:28:31,525 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:28:31,525 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:28:31,529 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-20 11:28:31,529 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:28:31,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:28:31,529 INFO L85 PathProgramCache]: Analyzing trace with hash 586568652, now seen corresponding path program 1 times [2024-02-20 11:28:31,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:28:31,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13215838] [2024-02-20 11:28:31,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:28:31,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:28:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:28:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:28:31,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:28:31,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13215838] [2024-02-20 11:28:31,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13215838] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:28:31,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121781591] [2024-02-20 11:28:31,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:28:31,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:28:31,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:28:31,581 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-02-20 11:28:31,582 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-02-20 11:28:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:28:31,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-20 11:28:31,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:28:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:28:31,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:28:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:28:31,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121781591] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:28:31,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:28:31,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-02-20 11:28:31,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886761762] [2024-02-20 11:28:31,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:28:31,736 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:28:31,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:28:31,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:28:31,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-20 11:28:31,738 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 61 [2024-02-20 11:28:31,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 257 transitions, 2121 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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:28:31,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:28:31,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 61 [2024-02-20 11:28:31,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand