./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe035_power.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-wmm/safe035_power.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 6415bffc70cf05f8f6460106962f2f9c59b321fd2fc94a45894cc3c1f3d85b66 --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:33:23,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 11:33:23,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 11:33:23,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 11:33:23,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 11:33:23,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 11:33:23,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 11:33:23,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 11:33:23,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 11:33:23,674 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 11:33:23,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 11:33:23,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 11:33:23,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 11:33:23,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 11:33:23,678 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 11:33:23,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 11:33:23,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 11:33:23,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 11:33:23,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 11:33:23,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 11:33:23,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 11:33:23,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 11:33:23,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 11:33:23,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 11:33:23,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 11:33:23,693 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 11:33:23,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 11:33:23,693 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 11:33:23,693 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 11:33:23,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 11:33:23,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 11:33:23,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 11:33:23,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:33:23,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 11:33:23,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 11:33:23,694 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 11:33:23,694 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 11:33:23,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 11:33:23,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 11:33:23,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 11:33:23,695 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 11:33:23,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 11:33:23,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 11:33:23,696 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 -> 6415bffc70cf05f8f6460106962f2f9c59b321fd2fc94a45894cc3c1f3d85b66 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 11:33:23,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 11:33:23,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 11:33:23,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 11:33:23,968 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 11:33:23,968 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 11:33:23,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe035_power.i [2024-02-20 11:33:24,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 11:33:25,139 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 11:33:25,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe035_power.i [2024-02-20 11:33:25,153 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb3587e94/f93d1ac8c25b4604832904e0d340f968/FLAGe827d9762 [2024-02-20 11:33:25,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb3587e94/f93d1ac8c25b4604832904e0d340f968 [2024-02-20 11:33:25,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 11:33:25,167 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 11:33:25,168 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 11:33:25,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 11:33:25,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 11:33:25,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:33:25" (1/1) ... [2024-02-20 11:33:25,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10130f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:25, skipping insertion in model container [2024-02-20 11:33:25,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:33:25" (1/1) ... [2024-02-20 11:33:25,213 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 11:33:25,327 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-wmm/safe035_power.i[947,960] [2024-02-20 11:33:25,531 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:33:25,541 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 11:33:25,555 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-wmm/safe035_power.i[947,960] [2024-02-20 11:33:25,612 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:33:25,656 INFO L206 MainTranslator]: Completed translation [2024-02-20 11:33:25,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:25 WrapperNode [2024-02-20 11:33:25,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 11:33:25,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 11:33:25,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 11:33:25,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 11:33:25,664 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:33:25" (1/1) ... [2024-02-20 11:33:25,690 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:33:25" (1/1) ... [2024-02-20 11:33:25,722 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 172 [2024-02-20 11:33:25,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 11:33:25,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 11:33:25,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 11:33:25,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 11:33:25,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:25" (1/1) ... [2024-02-20 11:33:25,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:25" (1/1) ... [2024-02-20 11:33:25,745 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:25" (1/1) ... [2024-02-20 11:33:25,760 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-02-20 11:33:25,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:25" (1/1) ... [2024-02-20 11:33:25,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:25" (1/1) ... [2024-02-20 11:33:25,772 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:25" (1/1) ... [2024-02-20 11:33:25,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:25" (1/1) ... [2024-02-20 11:33:25,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:25" (1/1) ... [2024-02-20 11:33:25,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:25" (1/1) ... [2024-02-20 11:33:25,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 11:33:25,781 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 11:33:25,781 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 11:33:25,781 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 11:33:25,781 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:25" (1/1) ... [2024-02-20 11:33:25,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:33:25,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:33:25,816 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:33:25,896 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:33:25,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 11:33:25,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 11:33:25,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 11:33:25,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-20 11:33:25,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-20 11:33:25,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 11:33:25,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 11:33:25,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 11:33:25,962 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-20 11:33:25,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-20 11:33:25,962 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-20 11:33:25,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-20 11:33:25,962 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-20 11:33:25,963 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-20 11:33:25,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 11:33:25,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 11:33:25,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 11:33:25,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-20 11:33:25,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-20 11:33:25,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 11:33:25,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 11:33:25,967 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:33:26,153 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 11:33:26,155 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 11:33:26,488 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 11:33:26,488 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 11:33:26,649 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 11:33:26,650 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-20 11:33:26,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:33:26 BoogieIcfgContainer [2024-02-20 11:33:26,650 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 11:33:26,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 11:33:26,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 11:33:26,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 11:33:26,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:33:25" (1/3) ... [2024-02-20 11:33:26,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f296df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:33:26, skipping insertion in model container [2024-02-20 11:33:26,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:33:25" (2/3) ... [2024-02-20 11:33:26,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f296df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:33:26, skipping insertion in model container [2024-02-20 11:33:26,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:33:26" (3/3) ... [2024-02-20 11:33:26,657 INFO L112 eAbstractionObserver]: Analyzing ICFG safe035_power.i [2024-02-20 11:33:26,671 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 11:33:26,671 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-02-20 11:33:26,671 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 11:33:26,706 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-20 11:33:26,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 96 flow [2024-02-20 11:33:26,751 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2024-02-20 11:33:26,751 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-20 11:33:26,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 1/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2024-02-20 11:33:26,755 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 42 transitions, 96 flow [2024-02-20 11:33:26,757 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 39 transitions, 87 flow [2024-02-20 11:33:26,764 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:33:26,769 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;@35c0c0ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:33:26,769 INFO L370 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-02-20 11:33:26,775 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:33:26,775 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-02-20 11:33:26,775 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-20 11:33:26,775 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:33:26,776 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:33:26,776 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-20 11:33:26,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:33:26,780 INFO L85 PathProgramCache]: Analyzing trace with hash 743793337, now seen corresponding path program 1 times [2024-02-20 11:33:26,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:33:26,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149106032] [2024-02-20 11:33:26,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:33:26,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:33:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:33:27,184 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:33:27,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:33:27,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149106032] [2024-02-20 11:33:27,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149106032] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:33:27,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:33:27,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-20 11:33:27,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767150114] [2024-02-20 11:33:27,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:33:27,192 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:33:27,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:33:27,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:33:27,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:33:27,221 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42 [2024-02-20 11:33:27,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:33:27,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:33:27,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42 [2024-02-20 11:33:27,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:33:27,696 INFO L124 PetriNetUnfolderBase]: 1951/3088 cut-off events. [2024-02-20 11:33:27,696 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-02-20 11:33:27,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5983 conditions, 3088 events. 1951/3088 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18990 event pairs, 266 based on Foata normal form. 120/3172 useless extension candidates. Maximal degree in co-relation 5972. Up to 2386 conditions per place. [2024-02-20 11:33:27,712 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 33 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2024-02-20 11:33:27,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 183 flow [2024-02-20 11:33:27,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:33:27,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:33:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-02-20 11:33:27,720 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6984126984126984 [2024-02-20 11:33:27,722 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2024-02-20 11:33:27,723 INFO L507 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 183 flow [2024-02-20 11:33:27,723 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:33:27,723 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:33:27,723 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:33:27,723 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 11:33:27,723 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-20 11:33:27,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:33:27,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1704297118, now seen corresponding path program 1 times [2024-02-20 11:33:27,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:33:27,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715374230] [2024-02-20 11:33:27,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:33:27,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:33:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:33:27,864 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:33:27,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:33:27,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715374230] [2024-02-20 11:33:27,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715374230] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:33:27,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:33:27,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:33:27,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038180325] [2024-02-20 11:33:27,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:33:27,866 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:33:27,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:33:27,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:33:27,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:33:27,875 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-02-20 11:33:27,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:33:27,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:33:27,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-02-20 11:33:27,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:33:28,436 INFO L124 PetriNetUnfolderBase]: 3374/5440 cut-off events. [2024-02-20 11:33:28,436 INFO L125 PetriNetUnfolderBase]: For 1028/1043 co-relation queries the response was YES. [2024-02-20 11:33:28,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14553 conditions, 5440 events. 3374/5440 cut-off events. For 1028/1043 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 34167 event pairs, 238 based on Foata normal form. 210/5494 useless extension candidates. Maximal degree in co-relation 14539. Up to 3547 conditions per place. [2024-02-20 11:33:28,459 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 79 selfloop transitions, 5 changer transitions 3/96 dead transitions. [2024-02-20 11:33:28,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 96 transitions, 533 flow [2024-02-20 11:33:28,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:33:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:33:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-02-20 11:33:28,460 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2024-02-20 11:33:28,461 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2024-02-20 11:33:28,461 INFO L507 AbstractCegarLoop]: Abstraction has has 52 places, 96 transitions, 533 flow [2024-02-20 11:33:28,461 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:33:28,461 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:33:28,461 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:33:28,462 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 11:33:28,462 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-20 11:33:28,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:33:28,462 INFO L85 PathProgramCache]: Analyzing trace with hash 3938819, now seen corresponding path program 1 times [2024-02-20 11:33:28,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:33:28,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600919352] [2024-02-20 11:33:28,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:33:28,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:33:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:33:28,632 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:33:28,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:33:28,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600919352] [2024-02-20 11:33:28,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600919352] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:33:28,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:33:28,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:33:28,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055165915] [2024-02-20 11:33:28,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:33:28,633 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:33:28,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:33:28,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:33:28,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-20 11:33:28,636 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-02-20 11:33:28,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 96 transitions, 533 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:33:28,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:33:28,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-02-20 11:33:28,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:33:29,012 INFO L124 PetriNetUnfolderBase]: 2251/3621 cut-off events. [2024-02-20 11:33:29,013 INFO L125 PetriNetUnfolderBase]: For 1064/1134 co-relation queries the response was YES. [2024-02-20 11:33:29,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13327 conditions, 3621 events. 2251/3621 cut-off events. For 1064/1134 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 20356 event pairs, 142 based on Foata normal form. 152/3707 useless extension candidates. Maximal degree in co-relation 13310. Up to 2389 conditions per place. [2024-02-20 11:33:29,027 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 92 selfloop transitions, 8 changer transitions 43/152 dead transitions. [2024-02-20 11:33:29,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 152 transitions, 1138 flow [2024-02-20 11:33:29,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:33:29,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:33:29,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2024-02-20 11:33:29,029 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2024-02-20 11:33:29,029 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2024-02-20 11:33:29,029 INFO L507 AbstractCegarLoop]: Abstraction has has 56 places, 152 transitions, 1138 flow [2024-02-20 11:33:29,029 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:33:29,029 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:33:29,030 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:33:29,030 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 11:33:29,030 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-20 11:33:29,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:33:29,030 INFO L85 PathProgramCache]: Analyzing trace with hash -545191794, now seen corresponding path program 1 times [2024-02-20 11:33:29,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:33:29,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83991094] [2024-02-20 11:33:29,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:33:29,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:33:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:33:29,276 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:33:29,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:33:29,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83991094] [2024-02-20 11:33:29,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83991094] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:33:29,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:33:29,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:33:29,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944379116] [2024-02-20 11:33:29,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:33:29,277 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 11:33:29,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:33:29,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 11:33:29,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-20 11:33:29,281 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42 [2024-02-20 11:33:29,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 152 transitions, 1138 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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:33:29,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:33:29,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42 [2024-02-20 11:33:29,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:33:29,645 INFO L124 PetriNetUnfolderBase]: 1775/2769 cut-off events. [2024-02-20 11:33:29,645 INFO L125 PetriNetUnfolderBase]: For 990/1088 co-relation queries the response was YES. [2024-02-20 11:33:29,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13142 conditions, 2769 events. 1775/2769 cut-off events. For 990/1088 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14683 event pairs, 126 based on Foata normal form. 58/2809 useless extension candidates. Maximal degree in co-relation 13122. Up to 1781 conditions per place. [2024-02-20 11:33:29,658 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 75 selfloop transitions, 11 changer transitions 66/161 dead transitions. [2024-02-20 11:33:29,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 161 transitions, 1512 flow [2024-02-20 11:33:29,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-20 11:33:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-20 11:33:29,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-02-20 11:33:29,659 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-02-20 11:33:29,660 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2024-02-20 11:33:29,660 INFO L507 AbstractCegarLoop]: Abstraction has has 61 places, 161 transitions, 1512 flow [2024-02-20 11:33:29,660 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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:33:29,660 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:33:29,660 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:33:29,660 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-20 11:33:29,660 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-20 11:33:29,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:33:29,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1266268168, now seen corresponding path program 1 times [2024-02-20 11:33:29,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:33:29,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733947324] [2024-02-20 11:33:29,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:33:29,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:33:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:33:31,321 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:33:31,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:33:31,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733947324] [2024-02-20 11:33:31,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733947324] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:33:31,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:33:31,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:33:31,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299084840] [2024-02-20 11:33:31,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:33:31,323 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:33:31,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:33:31,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:33:31,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:33:31,334 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-02-20 11:33:31,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 161 transitions, 1512 flow. Second operand has 10 states, 10 states have (on average 16.2) internal successors, (162), 10 states have internal predecessors, (162), 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:33:31,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:33:31,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-02-20 11:33:31,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:33:32,000 INFO L124 PetriNetUnfolderBase]: 3269/5111 cut-off events. [2024-02-20 11:33:32,000 INFO L125 PetriNetUnfolderBase]: For 5994/6063 co-relation queries the response was YES. [2024-02-20 11:33:32,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27759 conditions, 5111 events. 3269/5111 cut-off events. For 5994/6063 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 29116 event pairs, 114 based on Foata normal form. 9/5111 useless extension candidates. Maximal degree in co-relation 27736. Up to 3210 conditions per place. [2024-02-20 11:33:32,024 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 96 selfloop transitions, 8 changer transitions 164/290 dead transitions. [2024-02-20 11:33:32,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 290 transitions, 3334 flow [2024-02-20 11:33:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-20 11:33:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-20 11:33:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-02-20 11:33:32,025 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2024-02-20 11:33:32,026 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2024-02-20 11:33:32,026 INFO L507 AbstractCegarLoop]: Abstraction has has 68 places, 290 transitions, 3334 flow [2024-02-20 11:33:32,026 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.2) internal successors, (162), 10 states have internal predecessors, (162), 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:33:32,027 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:33:32,027 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:33:32,027 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 11:33:32,027 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-20 11:33:32,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:33:32,027 INFO L85 PathProgramCache]: Analyzing trace with hash -934515398, now seen corresponding path program 2 times [2024-02-20 11:33:32,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:33:32,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885685264] [2024-02-20 11:33:32,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:33:32,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:33:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:33:32,377 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:33:32,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:33:32,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885685264] [2024-02-20 11:33:32,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885685264] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:33:32,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:33:32,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-20 11:33:32,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861111373] [2024-02-20 11:33:32,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:33:32,378 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 11:33:32,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:33:32,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 11:33:32,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-02-20 11:33:32,387 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-02-20 11:33:32,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 290 transitions, 3334 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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:33:32,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:33:32,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-02-20 11:33:32,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:33:33,840 INFO L124 PetriNetUnfolderBase]: 6525/10052 cut-off events. [2024-02-20 11:33:33,840 INFO L125 PetriNetUnfolderBase]: For 32163/32622 co-relation queries the response was YES. [2024-02-20 11:33:33,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61841 conditions, 10052 events. 6525/10052 cut-off events. For 32163/32622 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 61351 event pairs, 229 based on Foata normal form. 136/10151 useless extension candidates. Maximal degree in co-relation 61815. Up to 6510 conditions per place. [2024-02-20 11:33:33,882 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 103 selfloop transitions, 1 changer transitions 420/544 dead transitions. [2024-02-20 11:33:33,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 544 transitions, 7426 flow [2024-02-20 11:33:33,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-20 11:33:33,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-20 11:33:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-02-20 11:33:33,885 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5674603174603174 [2024-02-20 11:33:33,887 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 25 predicate places. [2024-02-20 11:33:33,887 INFO L507 AbstractCegarLoop]: Abstraction has has 73 places, 544 transitions, 7426 flow [2024-02-20 11:33:33,887 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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:33:33,888 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:33:33,888 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:33:33,888 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-20 11:33:33,888 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-20 11:33:33,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:33:33,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1039582212, now seen corresponding path program 3 times [2024-02-20 11:33:33,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:33:33,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764581136] [2024-02-20 11:33:33,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:33:33,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:33:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:33:35,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:33:35,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:33:35,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764581136] [2024-02-20 11:33:35,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764581136] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:33:35,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:33:35,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-02-20 11:33:35,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559435489] [2024-02-20 11:33:35,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:33:35,495 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-20 11:33:35,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:33:35,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-20 11:33:35,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-02-20 11:33:35,513 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-02-20 11:33:35,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 544 transitions, 7426 flow. Second operand has 13 states, 13 states have (on average 15.692307692307692) internal successors, (204), 13 states have internal predecessors, (204), 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:33:35,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:33:35,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-02-20 11:33:35,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:33:39,049 INFO L124 PetriNetUnfolderBase]: 14534/22545 cut-off events. [2024-02-20 11:33:39,050 INFO L125 PetriNetUnfolderBase]: For 108978/109700 co-relation queries the response was YES. [2024-02-20 11:33:39,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154794 conditions, 22545 events. 14534/22545 cut-off events. For 108978/109700 co-relation queries the response was YES. Maximal size of possible extension queue 1089. Compared 158783 event pairs, 376 based on Foata normal form. 309/22805 useless extension candidates. Maximal degree in co-relation 154765. Up to 15524 conditions per place. [2024-02-20 11:33:39,154 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 142 selfloop transitions, 38 changer transitions 1279/1478 dead transitions. [2024-02-20 11:33:39,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 1478 transitions, 23393 flow [2024-02-20 11:33:39,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-02-20 11:33:39,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-02-20 11:33:39,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 383 transitions. [2024-02-20 11:33:39,159 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5364145658263305 [2024-02-20 11:33:39,160 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 41 predicate places. [2024-02-20 11:33:39,160 INFO L507 AbstractCegarLoop]: Abstraction has has 89 places, 1478 transitions, 23393 flow [2024-02-20 11:33:39,161 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.692307692307692) internal successors, (204), 13 states have internal predecessors, (204), 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:33:39,161 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:33:39,161 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:33:39,161 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-20 11:33:39,161 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-20 11:33:39,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:33:39,162 INFO L85 PathProgramCache]: Analyzing trace with hash 281186038, now seen corresponding path program 4 times [2024-02-20 11:33:39,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:33:39,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470326958] [2024-02-20 11:33:39,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:33:39,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:33:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:33:41,178 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:33:41,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:33:41,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470326958] [2024-02-20 11:33:41,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470326958] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:33:41,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:33:41,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:33:41,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658297420] [2024-02-20 11:33:41,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:33:41,180 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:33:41,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:33:41,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:33:41,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:33:41,194 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-02-20 11:33:41,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 1478 transitions, 23393 flow. Second operand has 11 states, 11 states have (on average 16.0) internal successors, (176), 11 states have internal predecessors, (176), 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:33:41,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:33:41,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-02-20 11:33:41,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:33:49,765 INFO L124 PetriNetUnfolderBase]: 29221/45819 cut-off events. [2024-02-20 11:33:49,766 INFO L125 PetriNetUnfolderBase]: For 314629/316329 co-relation queries the response was YES. [2024-02-20 11:33:50,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345450 conditions, 45819 events. 29221/45819 cut-off events. For 314629/316329 co-relation queries the response was YES. Maximal size of possible extension queue 2330. Compared 364183 event pairs, 607 based on Foata normal form. 585/46344 useless extension candidates. Maximal degree in co-relation 345418. Up to 31979 conditions per place. [2024-02-20 11:33:50,223 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 130 selfloop transitions, 23 changer transitions 2796/2969 dead transitions. [2024-02-20 11:33:50,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 2969 transitions, 53097 flow [2024-02-20 11:33:50,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-02-20 11:33:50,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-02-20 11:33:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 382 transitions. [2024-02-20 11:33:50,228 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5350140056022409 [2024-02-20 11:33:50,231 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 57 predicate places. [2024-02-20 11:33:50,231 INFO L507 AbstractCegarLoop]: Abstraction has has 105 places, 2969 transitions, 53097 flow [2024-02-20 11:33:50,232 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.0) internal successors, (176), 11 states have internal predecessors, (176), 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:33:50,232 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:33:50,232 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:33:50,232 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-20 11:33:50,232 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-20 11:33:50,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:33:50,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2094166306, now seen corresponding path program 5 times [2024-02-20 11:33:50,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:33:50,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296491007] [2024-02-20 11:33:50,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:33:50,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:33:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:33:50,925 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:33:50,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:33:50,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296491007] [2024-02-20 11:33:50,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296491007] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:33:50,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:33:50,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-02-20 11:33:50,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098833624] [2024-02-20 11:33:50,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:33:50,927 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:33:50,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:33:50,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:33:50,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:33:50,945 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-02-20 11:33:50,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 2969 transitions, 53097 flow. Second operand has 10 states, 10 states have (on average 16.2) internal successors, (162), 10 states have internal predecessors, (162), 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:33:50,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:33:50,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-02-20 11:33:50,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:34:04,472 INFO L124 PetriNetUnfolderBase]: 30814/48402 cut-off events. [2024-02-20 11:34:04,473 INFO L125 PetriNetUnfolderBase]: For 462536/464392 co-relation queries the response was YES. [2024-02-20 11:34:04,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399605 conditions, 48402 events. 30814/48402 cut-off events. For 462536/464392 co-relation queries the response was YES. Maximal size of possible extension queue 2479. Compared 389675 event pairs, 629 based on Foata normal form. 504/48847 useless extension candidates. Maximal degree in co-relation 399570. Up to 33799 conditions per place. [2024-02-20 11:34:04,677 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 127 selfloop transitions, 8 changer transitions 3045/3199 dead transitions. [2024-02-20 11:34:04,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 3199 transitions, 63575 flow [2024-02-20 11:34:04,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-02-20 11:34:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-02-20 11:34:04,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 232 transitions. [2024-02-20 11:34:04,679 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2024-02-20 11:34:04,679 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 66 predicate places. [2024-02-20 11:34:04,679 INFO L507 AbstractCegarLoop]: Abstraction has has 114 places, 3199 transitions, 63575 flow [2024-02-20 11:34:04,680 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.2) internal successors, (162), 10 states have internal predecessors, (162), 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:34:04,680 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:34:04,680 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:34:04,680 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-20 11:34:04,680 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-20 11:34:04,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:34:04,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1358352460, now seen corresponding path program 6 times [2024-02-20 11:34:04,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:34:04,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497050921] [2024-02-20 11:34:04,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:34:04,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:34:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:34:05,265 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:34:05,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:34:05,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497050921] [2024-02-20 11:34:05,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497050921] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:34:05,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:34:05,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-02-20 11:34:05,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962268827] [2024-02-20 11:34:05,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:34:05,271 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-20 11:34:05,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:34:05,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-20 11:34:05,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-02-20 11:34:05,283 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-02-20 11:34:05,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 3199 transitions, 63575 flow. Second operand has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 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:34:05,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:34:05,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-02-20 11:34:05,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:34:22,762 INFO L124 PetriNetUnfolderBase]: 35931/56432 cut-off events. [2024-02-20 11:34:22,762 INFO L125 PetriNetUnfolderBase]: For 711366/713961 co-relation queries the response was YES. [2024-02-20 11:34:22,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506857 conditions, 56432 events. 35931/56432 cut-off events. For 711366/713961 co-relation queries the response was YES. Maximal size of possible extension queue 2938. Compared 464766 event pairs, 730 based on Foata normal form. 601/56970 useless extension candidates. Maximal degree in co-relation 506819. Up to 39600 conditions per place. [2024-02-20 11:34:23,050 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 162 selfloop transitions, 27 changer transitions 3992/4201 dead transitions. [2024-02-20 11:34:23,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 4201 transitions, 91927 flow [2024-02-20 11:34:23,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-20 11:34:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-20 11:34:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2024-02-20 11:34:23,055 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5317460317460317 [2024-02-20 11:34:23,056 INFO L308 CegarLoopForPetriNet]: 48 programPoint places, 74 predicate places. [2024-02-20 11:34:23,056 INFO L507 AbstractCegarLoop]: Abstraction has has 122 places, 4201 transitions, 91927 flow [2024-02-20 11:34:23,056 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 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:34:23,056 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:34:23,056 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:34:23,057 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-20 11:34:23,057 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-02-20 11:34:23,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:34:23,057 INFO L85 PathProgramCache]: Analyzing trace with hash -280326068, now seen corresponding path program 7 times [2024-02-20 11:34:23,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:34:23,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737684210] [2024-02-20 11:34:23,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:34:23,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:34:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:34:24,630 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:34:24,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:34:24,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737684210] [2024-02-20 11:34:24,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737684210] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:34:24,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:34:24,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-02-20 11:34:24,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690961001] [2024-02-20 11:34:24,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:34:24,632 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:34:24,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:34:24,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:34:24,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:34:24,643 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2024-02-20 11:34:24,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 4201 transitions, 91927 flow. Second operand has 11 states, 11 states have (on average 16.0) internal successors, (176), 11 states have internal predecessors, (176), 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:34:24,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:34:24,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2024-02-20 11:34:24,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand