./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/triangular-longer-1.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/triangular-longer-1.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 1e30b67a045ce6921ac9aa6cdcebddb50c3d7d787a6b9dd7b66c9173f916fde4 --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:23:44,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 11:23:45,055 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 11:23:45,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 11:23:45,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 11:23:45,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 11:23:45,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 11:23:45,103 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 11:23:45,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 11:23:45,107 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 11:23:45,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 11:23:45,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 11:23:45,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 11:23:45,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 11:23:45,110 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 11:23:45,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 11:23:45,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 11:23:45,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 11:23:45,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 11:23:45,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 11:23:45,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 11:23:45,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 11:23:45,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 11:23:45,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 11:23:45,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 11:23:45,114 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 11:23:45,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 11:23:45,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 11:23:45,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 11:23:45,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 11:23:45,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 11:23:45,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 11:23:45,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:23:45,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 11:23:45,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 11:23:45,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 11:23:45,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 11:23:45,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 11:23:45,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 11:23:45,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 11:23:45,119 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 11:23:45,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 11:23:45,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 11:23:45,119 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 -> 1e30b67a045ce6921ac9aa6cdcebddb50c3d7d787a6b9dd7b66c9173f916fde4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 11:23:45,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 11:23:45,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 11:23:45,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 11:23:45,426 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 11:23:45,426 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 11:23:45,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-1.i [2024-02-20 11:23:46,613 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 11:23:46,826 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 11:23:46,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-1.i [2024-02-20 11:23:46,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a5acd0d8/912f02b409cb4802b5e5288ba9b59f93/FLAG5b445bf05 [2024-02-20 11:23:46,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a5acd0d8/912f02b409cb4802b5e5288ba9b59f93 [2024-02-20 11:23:46,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 11:23:46,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 11:23:46,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 11:23:46,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 11:23:46,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 11:23:46,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:23:46" (1/1) ... [2024-02-20 11:23:46,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a0634f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:23:46, skipping insertion in model container [2024-02-20 11:23:46,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:23:46" (1/1) ... [2024-02-20 11:23:46,928 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 11:23:47,263 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/triangular-longer-1.i[30961,30974] [2024-02-20 11:23:47,269 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:23:47,275 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 11:23:47,309 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/triangular-longer-1.i[30961,30974] [2024-02-20 11:23:47,310 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:23:47,339 INFO L206 MainTranslator]: Completed translation [2024-02-20 11:23:47,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:23:47 WrapperNode [2024-02-20 11:23:47,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 11:23:47,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 11:23:47,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 11:23:47,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 11:23:47,346 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:23:47" (1/1) ... [2024-02-20 11:23:47,358 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:23:47" (1/1) ... [2024-02-20 11:23:47,377 INFO L138 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2024-02-20 11:23:47,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 11:23:47,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 11:23:47,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 11:23:47,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 11:23:47,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:23:47" (1/1) ... [2024-02-20 11:23:47,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:23:47" (1/1) ... [2024-02-20 11:23:47,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:23:47" (1/1) ... [2024-02-20 11:23:47,411 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-02-20 11:23:47,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:23:47" (1/1) ... [2024-02-20 11:23:47,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:23:47" (1/1) ... [2024-02-20 11:23:47,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:23:47" (1/1) ... [2024-02-20 11:23:47,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:23:47" (1/1) ... [2024-02-20 11:23:47,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:23:47" (1/1) ... [2024-02-20 11:23:47,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:23:47" (1/1) ... [2024-02-20 11:23:47,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 11:23:47,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 11:23:47,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 11:23:47,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 11:23:47,427 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:23:47" (1/1) ... [2024-02-20 11:23:47,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:23:47,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:23:47,477 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:23:47,499 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:23:47,534 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-02-20 11:23:47,535 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-02-20 11:23:47,535 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-02-20 11:23:47,535 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-02-20 11:23:47,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 11:23:47,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 11:23:47,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 11:23:47,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-20 11:23:47,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 11:23:47,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 11:23:47,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 11:23:47,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 11:23:47,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 11:23:47,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 11:23:47,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-20 11:23:47,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 11:23:47,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 11:23:47,541 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:23:47,651 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 11:23:47,653 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 11:23:47,796 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 11:23:47,797 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 11:23:47,948 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 11:23:47,948 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-20 11:23:47,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:23:47 BoogieIcfgContainer [2024-02-20 11:23:47,949 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 11:23:47,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 11:23:47,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 11:23:47,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 11:23:47,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:23:46" (1/3) ... [2024-02-20 11:23:47,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c54ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:23:47, skipping insertion in model container [2024-02-20 11:23:47,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:23:47" (2/3) ... [2024-02-20 11:23:47,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c54ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:23:47, skipping insertion in model container [2024-02-20 11:23:47,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:23:47" (3/3) ... [2024-02-20 11:23:47,957 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longer-1.i [2024-02-20 11:23:47,975 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 11:23:47,976 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 11:23:47,976 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 11:23:48,008 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-20 11:23:48,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2024-02-20 11:23:48,064 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2024-02-20 11:23:48,065 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-20 11:23:48,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-02-20 11:23:48,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2024-02-20 11:23:48,071 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2024-02-20 11:23:48,080 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:23:48,089 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;@6beaa140, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:23:48,090 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-20 11:23:48,098 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:23:48,104 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-02-20 11:23:48,105 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-20 11:23:48,105 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:23:48,106 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:23:48,107 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:23:48,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:23:48,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1796875976, now seen corresponding path program 1 times [2024-02-20 11:23:48,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:23:48,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556040475] [2024-02-20 11:23:48,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:23:48,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:23:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:23:48,575 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:23:48,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:23:48,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556040475] [2024-02-20 11:23:48,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556040475] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:23:48,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:23:48,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:23:48,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683731712] [2024-02-20 11:23:48,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:23:48,588 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:23:48,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:23:48,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:23:48,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-20 11:23:48,645 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:23:48,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:23:48,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:23:48,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:23:48,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:23:48,928 INFO L124 PetriNetUnfolderBase]: 321/543 cut-off events. [2024-02-20 11:23:48,929 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-20 11:23:48,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 543 events. 321/543 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2180 event pairs, 62 based on Foata normal form. 12/542 useless extension candidates. Maximal degree in co-relation 1045. Up to 221 conditions per place. [2024-02-20 11:23:48,938 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 4 changer transitions 22/54 dead transitions. [2024-02-20 11:23:48,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 54 transitions, 216 flow [2024-02-20 11:23:48,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-20 11:23:48,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-20 11:23:48,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-02-20 11:23:48,952 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-02-20 11:23:48,956 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2024-02-20 11:23:48,956 INFO L507 AbstractCegarLoop]: Abstraction has has 31 places, 54 transitions, 216 flow [2024-02-20 11:23:48,956 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:23:48,957 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:23:48,957 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:23:48,957 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 11:23:48,957 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:23:48,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:23:48,958 INFO L85 PathProgramCache]: Analyzing trace with hash 676521124, now seen corresponding path program 1 times [2024-02-20 11:23:48,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:23:48,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303481860] [2024-02-20 11:23:48,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:23:48,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:23:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:23:49,157 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:23:49,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:23:49,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303481860] [2024-02-20 11:23:49,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303481860] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:23:49,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:23:49,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:23:49,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077221559] [2024-02-20 11:23:49,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:23:49,160 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 11:23:49,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:23:49,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 11:23:49,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-02-20 11:23:49,193 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:23:49,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 54 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:23:49,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:23:49,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:23:49,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:23:49,504 INFO L124 PetriNetUnfolderBase]: 697/1161 cut-off events. [2024-02-20 11:23:49,504 INFO L125 PetriNetUnfolderBase]: For 82/90 co-relation queries the response was YES. [2024-02-20 11:23:49,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3320 conditions, 1161 events. 697/1161 cut-off events. For 82/90 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5196 event pairs, 50 based on Foata normal form. 0/1121 useless extension candidates. Maximal degree in co-relation 3307. Up to 547 conditions per place. [2024-02-20 11:23:49,514 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 58 selfloop transitions, 11 changer transitions 111/183 dead transitions. [2024-02-20 11:23:49,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 183 transitions, 1095 flow [2024-02-20 11:23:49,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-02-20 11:23:49,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-02-20 11:23:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2024-02-20 11:23:49,519 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5875 [2024-02-20 11:23:49,520 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 14 predicate places. [2024-02-20 11:23:49,521 INFO L507 AbstractCegarLoop]: Abstraction has has 40 places, 183 transitions, 1095 flow [2024-02-20 11:23:49,521 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:23:49,521 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:23:49,521 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:23:49,522 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 11:23:49,522 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:23:49,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:23:49,531 INFO L85 PathProgramCache]: Analyzing trace with hash 299733066, now seen corresponding path program 2 times [2024-02-20 11:23:49,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:23:49,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195067354] [2024-02-20 11:23:49,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:23:49,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:23:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:23:49,655 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:23:49,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:23:49,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195067354] [2024-02-20 11:23:49,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195067354] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:23:49,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:23:49,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:23:49,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766278164] [2024-02-20 11:23:49,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:23:49,657 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 11:23:49,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:23:49,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 11:23:49,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-02-20 11:23:49,670 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:23:49,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 183 transitions, 1095 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:23:49,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:23:49,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:23:49,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:23:50,045 INFO L124 PetriNetUnfolderBase]: 850/1413 cut-off events. [2024-02-20 11:23:50,046 INFO L125 PetriNetUnfolderBase]: For 317/327 co-relation queries the response was YES. [2024-02-20 11:23:50,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5345 conditions, 1413 events. 850/1413 cut-off events. For 317/327 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6491 event pairs, 44 based on Foata normal form. 0/1403 useless extension candidates. Maximal degree in co-relation 5329. Up to 718 conditions per place. [2024-02-20 11:23:50,053 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 63 selfloop transitions, 15 changer transitions 188/269 dead transitions. [2024-02-20 11:23:50,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 269 transitions, 2143 flow [2024-02-20 11:23:50,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-20 11:23:50,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-20 11:23:50,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 152 transitions. [2024-02-20 11:23:50,058 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2024-02-20 11:23:50,059 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 24 predicate places. [2024-02-20 11:23:50,060 INFO L507 AbstractCegarLoop]: Abstraction has has 50 places, 269 transitions, 2143 flow [2024-02-20 11:23:50,060 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:23:50,060 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:23:50,060 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:23:50,060 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 11:23:50,061 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:23:50,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:23:50,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1146810191, now seen corresponding path program 1 times [2024-02-20 11:23:50,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:23:50,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110653619] [2024-02-20 11:23:50,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:23:50,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:23:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:23:50,211 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:23:50,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:23:50,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110653619] [2024-02-20 11:23:50,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110653619] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:23:50,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:23:50,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-20 11:23:50,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803536995] [2024-02-20 11:23:50,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:23:50,213 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-20 11:23:50,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:23:50,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-20 11:23:50,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-02-20 11:23:50,229 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:23:50,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 269 transitions, 2143 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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:23:50,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:23:50,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:23:50,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:23:50,602 INFO L124 PetriNetUnfolderBase]: 1201/1988 cut-off events. [2024-02-20 11:23:50,603 INFO L125 PetriNetUnfolderBase]: For 892/916 co-relation queries the response was YES. [2024-02-20 11:23:50,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9349 conditions, 1988 events. 1201/1988 cut-off events. For 892/916 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9835 event pairs, 32 based on Foata normal form. 0/1948 useless extension candidates. Maximal degree in co-relation 9330. Up to 1087 conditions per place. [2024-02-20 11:23:50,616 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 86 selfloop transitions, 21 changer transitions 250/360 dead transitions. [2024-02-20 11:23:50,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 360 transitions, 3585 flow [2024-02-20 11:23:50,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-20 11:23:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-20 11:23:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 180 transitions. [2024-02-20 11:23:50,618 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2024-02-20 11:23:50,619 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 36 predicate places. [2024-02-20 11:23:50,619 INFO L507 AbstractCegarLoop]: Abstraction has has 62 places, 360 transitions, 3585 flow [2024-02-20 11:23:50,619 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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:23:50,620 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:23:50,620 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:23:50,620 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-20 11:23:50,620 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:23:50,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:23:50,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1164524235, now seen corresponding path program 2 times [2024-02-20 11:23:50,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:23:50,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987514188] [2024-02-20 11:23:50,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:23:50,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:23:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:23:50,773 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:23:50,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:23:50,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987514188] [2024-02-20 11:23:50,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987514188] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:23:50,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:23:50,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-20 11:23:50,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34434580] [2024-02-20 11:23:50,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:23:50,776 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-20 11:23:50,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:23:50,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-20 11:23:50,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-02-20 11:23:50,791 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:23:50,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 360 transitions, 3585 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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:23:50,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:23:50,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:23:50,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:23:51,160 INFO L124 PetriNetUnfolderBase]: 1291/2132 cut-off events. [2024-02-20 11:23:51,160 INFO L125 PetriNetUnfolderBase]: For 1574/1606 co-relation queries the response was YES. [2024-02-20 11:23:51,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12004 conditions, 2132 events. 1291/2132 cut-off events. For 1574/1606 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10700 event pairs, 50 based on Foata normal form. 0/2119 useless extension candidates. Maximal degree in co-relation 11982. Up to 1150 conditions per place. [2024-02-20 11:23:51,174 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 85 selfloop transitions, 21 changer transitions 322/431 dead transitions. [2024-02-20 11:23:51,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 431 transitions, 5151 flow [2024-02-20 11:23:51,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-20 11:23:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-20 11:23:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-02-20 11:23:51,176 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-02-20 11:23:51,179 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 46 predicate places. [2024-02-20 11:23:51,179 INFO L507 AbstractCegarLoop]: Abstraction has has 72 places, 431 transitions, 5151 flow [2024-02-20 11:23:51,179 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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:23:51,179 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:23:51,180 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:23:51,180 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 11:23:51,180 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:23:51,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:23:51,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1474256740, now seen corresponding path program 1 times [2024-02-20 11:23:51,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:23:51,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498568947] [2024-02-20 11:23:51,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:23:51,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:23:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:23:51,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:23:51,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:23:51,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498568947] [2024-02-20 11:23:51,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498568947] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:23:51,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580573693] [2024-02-20 11:23:51,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:23:51,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:23:51,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:23:51,320 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:23:51,330 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:23:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:23:51,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-20 11:23:51,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:23:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:23:51,517 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:23:51,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:23:51,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580573693] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:23:51,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:23:51,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-02-20 11:23:51,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491623516] [2024-02-20 11:23:51,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:23:51,631 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-02-20 11:23:51,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:23:51,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-02-20 11:23:51,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-02-20 11:23:51,650 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:23:51,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 431 transitions, 5151 flow. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 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:23:51,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:23:51,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:23:51,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:23:52,483 INFO L124 PetriNetUnfolderBase]: 2083/3470 cut-off events. [2024-02-20 11:23:52,484 INFO L125 PetriNetUnfolderBase]: For 4339/4379 co-relation queries the response was YES. [2024-02-20 11:23:52,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22549 conditions, 3470 events. 2083/3470 cut-off events. For 4339/4379 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 17756 event pairs, 44 based on Foata normal form. 0/3457 useless extension candidates. Maximal degree in co-relation 22524. Up to 1996 conditions per place. [2024-02-20 11:23:52,509 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 104 selfloop transitions, 36 changer transitions 558/701 dead transitions. [2024-02-20 11:23:52,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 701 transitions, 9787 flow [2024-02-20 11:23:52,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-02-20 11:23:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-02-20 11:23:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 277 transitions. [2024-02-20 11:23:52,511 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5496031746031746 [2024-02-20 11:23:52,515 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 66 predicate places. [2024-02-20 11:23:52,515 INFO L507 AbstractCegarLoop]: Abstraction has has 92 places, 701 transitions, 9787 flow [2024-02-20 11:23:52,516 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 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:23:52,516 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:23:52,516 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:23:52,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-20 11:23:52,731 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-02-20 11:23:52,731 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:23:52,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:23:52,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1499081272, now seen corresponding path program 1 times [2024-02-20 11:23:52,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:23:52,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700563660] [2024-02-20 11:23:52,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:23:52,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:23:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:23:52,944 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:23:52,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:23:52,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700563660] [2024-02-20 11:23:52,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700563660] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:23:52,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070265764] [2024-02-20 11:23:52,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:23:52,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:23:52,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:23:52,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:23:52,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-20 11:23:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:23:53,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-20 11:23:53,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:23:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:23:53,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:23:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:23:53,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070265764] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:23:53,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:23:53,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-02-20 11:23:53,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105119200] [2024-02-20 11:23:53,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:23:53,288 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-20 11:23:53,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:23:53,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-20 11:23:53,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-02-20 11:23:53,318 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:23:53,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 701 transitions, 9787 flow. Second operand has 17 states, 17 states have (on average 7.352941176470588) internal successors, (125), 17 states have internal predecessors, (125), 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:23:53,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:23:53,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:23:53,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:23:54,825 INFO L124 PetriNetUnfolderBase]: 3964/6620 cut-off events. [2024-02-20 11:23:54,826 INFO L125 PetriNetUnfolderBase]: For 12499/12547 co-relation queries the response was YES. [2024-02-20 11:23:54,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48784 conditions, 6620 events. 3964/6620 cut-off events. For 12499/12547 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 35393 event pairs, 44 based on Foata normal form. 0/6607 useless extension candidates. Maximal degree in co-relation 48756. Up to 3670 conditions per place. [2024-02-20 11:23:54,857 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 170 selfloop transitions, 27 changer transitions 1245/1445 dead transitions. [2024-02-20 11:23:54,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 1445 transitions, 23087 flow [2024-02-20 11:23:54,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-02-20 11:23:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2024-02-20 11:23:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 415 transitions. [2024-02-20 11:23:54,860 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5577956989247311 [2024-02-20 11:23:54,861 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 96 predicate places. [2024-02-20 11:23:54,861 INFO L507 AbstractCegarLoop]: Abstraction has has 122 places, 1445 transitions, 23087 flow [2024-02-20 11:23:54,861 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.352941176470588) internal successors, (125), 17 states have internal predecessors, (125), 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:23:54,861 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:23:54,862 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:23:54,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-20 11:23:55,076 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-02-20 11:23:55,077 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:23:55,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:23:55,077 INFO L85 PathProgramCache]: Analyzing trace with hash 929567774, now seen corresponding path program 2 times [2024-02-20 11:23:55,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:23:55,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17551151] [2024-02-20 11:23:55,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:23:55,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:23:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:23:55,276 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:23:55,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:23:55,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17551151] [2024-02-20 11:23:55,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17551151] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:23:55,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535564958] [2024-02-20 11:23:55,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 11:23:55,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:23:55,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:23:55,278 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:23:55,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-20 11:23:55,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 11:23:55,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:23:55,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-20 11:23:55,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:23:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:23:55,474 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:23:55,617 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:23:55,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535564958] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:23:55,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:23:55,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-02-20 11:23:55,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995919702] [2024-02-20 11:23:55,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:23:55,618 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-20 11:23:55,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:23:55,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-20 11:23:55,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-02-20 11:23:55,639 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:23:55,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 1445 transitions, 23087 flow. Second operand has 17 states, 17 states have (on average 7.352941176470588) internal successors, (125), 17 states have internal predecessors, (125), 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:23:55,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:23:55,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:23:55,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:23:58,902 INFO L124 PetriNetUnfolderBase]: 6727/11246 cut-off events. [2024-02-20 11:23:58,902 INFO L125 PetriNetUnfolderBase]: For 28256/28312 co-relation queries the response was YES. [2024-02-20 11:23:58,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93055 conditions, 11246 events. 6727/11246 cut-off events. For 28256/28312 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 68710 event pairs, 52 based on Foata normal form. 0/11188 useless extension candidates. Maximal degree in co-relation 93024. Up to 6649 conditions per place. [2024-02-20 11:23:58,962 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 275 selfloop transitions, 82 changer transitions 2060/2420 dead transitions. [2024-02-20 11:23:58,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 2420 transitions, 43521 flow [2024-02-20 11:23:58,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-02-20 11:23:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2024-02-20 11:23:58,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 525 transitions. [2024-02-20 11:23:58,965 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.546875 [2024-02-20 11:23:58,965 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 135 predicate places. [2024-02-20 11:23:58,965 INFO L507 AbstractCegarLoop]: Abstraction has has 161 places, 2420 transitions, 43521 flow [2024-02-20 11:23:58,966 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.352941176470588) internal successors, (125), 17 states have internal predecessors, (125), 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:23:58,966 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:23:58,966 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:23:58,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-20 11:23:59,180 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:23:59,181 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:23:59,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:23:59,181 INFO L85 PathProgramCache]: Analyzing trace with hash -338305626, now seen corresponding path program 3 times [2024-02-20 11:23:59,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:23:59,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442909005] [2024-02-20 11:23:59,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:23:59,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:23:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:23:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:23:59,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:23:59,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442909005] [2024-02-20 11:23:59,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442909005] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:23:59,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155860095] [2024-02-20 11:23:59,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 11:23:59,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:23:59,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:23:59,306 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:23:59,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-20 11:23:59,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-02-20 11:23:59,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:23:59,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-20 11:23:59,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:23:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:23:59,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:23:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:23:59,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155860095] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:23:59,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:23:59,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-02-20 11:23:59,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742330455] [2024-02-20 11:23:59,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:23:59,697 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-02-20 11:23:59,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:23:59,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-02-20 11:23:59,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-02-20 11:23:59,731 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:23:59,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 2420 transitions, 43521 flow. Second operand has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 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:23:59,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:23:59,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:23:59,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:24:04,501 INFO L124 PetriNetUnfolderBase]: 8599/14453 cut-off events. [2024-02-20 11:24:04,501 INFO L125 PetriNetUnfolderBase]: For 47776/47804 co-relation queries the response was YES. [2024-02-20 11:24:04,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132568 conditions, 14453 events. 8599/14453 cut-off events. For 47776/47804 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 93233 event pairs, 50 based on Foata normal form. 6/14449 useless extension candidates. Maximal degree in co-relation 132534. Up to 8764 conditions per place. [2024-02-20 11:24:04,585 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 333 selfloop transitions, 125 changer transitions 2677/3138 dead transitions. [2024-02-20 11:24:04,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 3138 transitions, 62715 flow [2024-02-20 11:24:04,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-02-20 11:24:04,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2024-02-20 11:24:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 533 transitions. [2024-02-20 11:24:04,588 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-02-20 11:24:04,588 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 175 predicate places. [2024-02-20 11:24:04,589 INFO L507 AbstractCegarLoop]: Abstraction has has 201 places, 3138 transitions, 62715 flow [2024-02-20 11:24:04,589 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 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:24:04,589 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:24:04,589 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:24:04,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-02-20 11:24:04,804 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:24:04,804 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:24:04,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:24:04,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1864780103, now seen corresponding path program 4 times [2024-02-20 11:24:04,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:24:04,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622622178] [2024-02-20 11:24:04,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:24:04,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:24:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:24:05,028 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:05,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:24:05,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622622178] [2024-02-20 11:24:05,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622622178] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:24:05,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345611145] [2024-02-20 11:24:05,029 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-20 11:24:05,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:24:05,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:24:05,031 INFO L229 MonitoredProcess]: Starting monitored process 6 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:24:05,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-20 11:24:05,105 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-20 11:24:05,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:24:05,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjunts are in the unsatisfiable core [2024-02-20 11:24:05,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:24:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:05,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:24:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:24:05,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345611145] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:24:05,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:24:05,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-02-20 11:24:05,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541795086] [2024-02-20 11:24:05,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:24:05,382 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-02-20 11:24:05,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:24:05,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-02-20 11:24:05,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2024-02-20 11:24:05,424 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:24:05,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 3138 transitions, 62715 flow. Second operand has 25 states, 25 states have (on average 7.08) internal successors, (177), 25 states have internal predecessors, (177), 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:24:05,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:24:05,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:24:05,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:24:15,469 INFO L124 PetriNetUnfolderBase]: 13414/22560 cut-off events. [2024-02-20 11:24:15,469 INFO L125 PetriNetUnfolderBase]: For 96080/96110 co-relation queries the response was YES. [2024-02-20 11:24:15,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226787 conditions, 22560 events. 13414/22560 cut-off events. For 96080/96110 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 146989 event pairs, 44 based on Foata normal form. 6/22556 useless extension candidates. Maximal degree in co-relation 226750. Up to 13786 conditions per place. [2024-02-20 11:24:15,613 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 475 selfloop transitions, 181 changer transitions 4202/4861 dead transitions. [2024-02-20 11:24:15,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 4861 transitions, 106891 flow [2024-02-20 11:24:15,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-02-20 11:24:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2024-02-20 11:24:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 739 transitions. [2024-02-20 11:24:15,617 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5402046783625731 [2024-02-20 11:24:15,617 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 231 predicate places. [2024-02-20 11:24:15,617 INFO L507 AbstractCegarLoop]: Abstraction has has 257 places, 4861 transitions, 106891 flow [2024-02-20 11:24:15,620 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.08) internal successors, (177), 25 states have internal predecessors, (177), 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:24:15,620 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:24:15,620 INFO L234 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:24:15,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-02-20 11:24:15,837 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-02-20 11:24:15,838 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:24:15,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:24:15,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1945472848, now seen corresponding path program 5 times [2024-02-20 11:24:15,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:24:15,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75021596] [2024-02-20 11:24:15,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:24:15,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:24:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:24:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:24:16,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:24:16,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75021596] [2024-02-20 11:24:16,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75021596] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:24:16,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361679393] [2024-02-20 11:24:16,282 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-20 11:24:16,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:24:16,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:24:16,284 INFO L229 MonitoredProcess]: Starting monitored process 7 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:24:16,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-02-20 11:24:16,360 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-02-20 11:24:16,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:24:16,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 23 conjunts are in the unsatisfiable core [2024-02-20 11:24:16,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:24:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:24:16,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:24:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:24:16,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361679393] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:24:16,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:24:16,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 28 [2024-02-20 11:24:16,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19252072] [2024-02-20 11:24:16,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:24:16,971 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-02-20 11:24:16,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:24:16,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-02-20 11:24:16,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2024-02-20 11:24:17,017 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:24:17,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 4861 transitions, 106891 flow. Second operand has 29 states, 29 states have (on average 7.310344827586207) internal successors, (212), 29 states have internal predecessors, (212), 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:24:17,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:24:17,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:24:17,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:24:35,421 INFO L124 PetriNetUnfolderBase]: 16078/26988 cut-off events. [2024-02-20 11:24:35,421 INFO L125 PetriNetUnfolderBase]: For 141190/141270 co-relation queries the response was YES. [2024-02-20 11:24:35,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295592 conditions, 26988 events. 16078/26988 cut-off events. For 141190/141270 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 173647 event pairs, 44 based on Foata normal form. 0/26975 useless extension candidates. Maximal degree in co-relation 295552. Up to 16126 conditions per place. [2024-02-20 11:24:35,556 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 680 selfloop transitions, 49 changer transitions 5165/5897 dead transitions. [2024-02-20 11:24:35,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 5897 transitions, 141471 flow [2024-02-20 11:24:35,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-02-20 11:24:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2024-02-20 11:24:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 727 transitions. [2024-02-20 11:24:35,559 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5507575757575758 [2024-02-20 11:24:35,560 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 285 predicate places. [2024-02-20 11:24:35,560 INFO L507 AbstractCegarLoop]: Abstraction has has 311 places, 5897 transitions, 141471 flow [2024-02-20 11:24:35,560 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.310344827586207) internal successors, (212), 29 states have internal predecessors, (212), 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:24:35,560 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:24:35,560 INFO L234 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:24:35,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-02-20 11:24:35,776 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:24:35,777 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:24:35,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:24:35,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1185675100, now seen corresponding path program 6 times [2024-02-20 11:24:35,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:24:35,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622162033] [2024-02-20 11:24:35,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:24:35,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:24:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:24:36,205 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:24:36,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:24:36,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622162033] [2024-02-20 11:24:36,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622162033] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:24:36,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500370541] [2024-02-20 11:24:36,205 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-20 11:24:36,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:24:36,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:24:36,206 INFO L229 MonitoredProcess]: Starting monitored process 8 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:24:36,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-02-20 11:24:36,305 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2024-02-20 11:24:36,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:24:36,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 23 conjunts are in the unsatisfiable core [2024-02-20 11:24:36,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:24:36,454 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:24:36,455 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:24:36,801 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:24:36,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500370541] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:24:36,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:24:36,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 30 [2024-02-20 11:24:36,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877698831] [2024-02-20 11:24:36,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:24:36,803 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-02-20 11:24:36,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:24:36,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-02-20 11:24:36,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=743, Unknown=0, NotChecked=0, Total=930 [2024-02-20 11:24:36,838 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:24:36,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 5897 transitions, 141471 flow. Second operand has 31 states, 31 states have (on average 7.290322580645161) internal successors, (226), 31 states have internal predecessors, (226), 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:24:36,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:24:36,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:24:36,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:25:08,667 INFO L124 PetriNetUnfolderBase]: 23404/39161 cut-off events. [2024-02-20 11:25:08,667 INFO L125 PetriNetUnfolderBase]: For 247570/247658 co-relation queries the response was YES. [2024-02-20 11:25:08,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464050 conditions, 39161 events. 23404/39161 cut-off events. For 247570/247658 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 267793 event pairs, 44 based on Foata normal form. 0/39148 useless extension candidates. Maximal degree in co-relation 464007. Up to 23290 conditions per place. [2024-02-20 11:25:08,896 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 793 selfloop transitions, 170 changer transitions 7780/8746 dead transitions. [2024-02-20 11:25:08,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 8746 transitions, 227333 flow [2024-02-20 11:25:08,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-02-20 11:25:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2024-02-20 11:25:08,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 832 transitions. [2024-02-20 11:25:08,899 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-02-20 11:25:08,900 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 348 predicate places. [2024-02-20 11:25:08,900 INFO L507 AbstractCegarLoop]: Abstraction has has 374 places, 8746 transitions, 227333 flow [2024-02-20 11:25:08,904 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.290322580645161) internal successors, (226), 31 states have internal predecessors, (226), 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:25:08,904 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:25:08,904 INFO L234 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:25:08,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-02-20 11:25:09,105 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:25:09,105 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:25:09,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:25:09,106 INFO L85 PathProgramCache]: Analyzing trace with hash 670318046, now seen corresponding path program 7 times [2024-02-20 11:25:09,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:25:09,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045164062] [2024-02-20 11:25:09,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:25:09,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:25:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:25:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:25:09,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:25:09,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045164062] [2024-02-20 11:25:09,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045164062] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:25:09,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844549881] [2024-02-20 11:25:09,701 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-20 11:25:09,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:25:09,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:25:09,705 INFO L229 MonitoredProcess]: Starting monitored process 9 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:25:09,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-02-20 11:25:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:25:09,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 23 conjunts are in the unsatisfiable core [2024-02-20 11:25:09,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:25:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:25:09,955 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:25:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:25:10,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844549881] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:25:10,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:25:10,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 34 [2024-02-20 11:25:10,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431486619] [2024-02-20 11:25:10,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:25:10,373 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-02-20 11:25:10,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:25:10,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-02-20 11:25:10,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2024-02-20 11:25:10,403 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:25:10,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 8746 transitions, 227333 flow. Second operand has 35 states, 35 states have (on average 7.314285714285714) internal successors, (256), 35 states have internal predecessors, (256), 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:25:10,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:25:10,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:25:10,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:26:34,494 INFO L124 PetriNetUnfolderBase]: 28264/47244 cut-off events. [2024-02-20 11:26:34,494 INFO L125 PetriNetUnfolderBase]: For 353735/353771 co-relation queries the response was YES. [2024-02-20 11:26:34,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602426 conditions, 47244 events. 28264/47244 cut-off events. For 353735/353771 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 331170 event pairs, 44 based on Foata normal form. 6/47240 useless extension candidates. Maximal degree in co-relation 602380. Up to 28132 conditions per place. [2024-02-20 11:26:34,778 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 871 selfloop transitions, 284 changer transitions 9459/10617 dead transitions. [2024-02-20 11:26:34,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 10617 transitions, 297207 flow [2024-02-20 11:26:34,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-02-20 11:26:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2024-02-20 11:26:34,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 871 transitions. [2024-02-20 11:26:34,780 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5337009803921569 [2024-02-20 11:26:34,781 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 415 predicate places. [2024-02-20 11:26:34,783 INFO L507 AbstractCegarLoop]: Abstraction has has 441 places, 10617 transitions, 297207 flow [2024-02-20 11:26:34,783 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.314285714285714) internal successors, (256), 35 states have internal predecessors, (256), 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:26:34,783 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:26:34,783 INFO L234 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:26:34,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-02-20 11:26:34,996 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-02-20 11:26:34,996 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:26:34,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:26:34,997 INFO L85 PathProgramCache]: Analyzing trace with hash 279154910, now seen corresponding path program 8 times [2024-02-20 11:26:34,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:26:34,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576798499] [2024-02-20 11:26:34,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:26:34,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:26:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:26:35,334 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:26:35,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:26:35,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576798499] [2024-02-20 11:26:35,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576798499] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:26:35,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835977221] [2024-02-20 11:26:35,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 11:26:35,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:26:35,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:26:35,337 INFO L229 MonitoredProcess]: Starting monitored process 10 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:26:35,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-02-20 11:26:35,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 11:26:35,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:26:35,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 23 conjunts are in the unsatisfiable core [2024-02-20 11:26:35,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:26:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:26:35,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:26:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:26:35,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835977221] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:26:35,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:26:35,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2024-02-20 11:26:35,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586547466] [2024-02-20 11:26:35,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:26:35,854 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-02-20 11:26:35,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:26:35,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-02-20 11:26:35,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=930, Unknown=0, NotChecked=0, Total=1122 [2024-02-20 11:26:35,891 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:26:35,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 10617 transitions, 297207 flow. Second operand has 34 states, 34 states have (on average 7.205882352941177) internal successors, (245), 34 states have internal predecessors, (245), 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:26:35,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:26:35,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:26:35,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:28:45,837 INFO L124 PetriNetUnfolderBase]: 32071/53678 cut-off events. [2024-02-20 11:28:45,837 INFO L125 PetriNetUnfolderBase]: For 469109/469213 co-relation queries the response was YES. [2024-02-20 11:28:45,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732835 conditions, 53678 events. 32071/53678 cut-off events. For 469109/469213 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 386296 event pairs, 60 based on Foata normal form. 0/53602 useless extension candidates. Maximal degree in co-relation 732786. Up to 32569 conditions per place. [2024-02-20 11:28:46,212 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 1062 selfloop transitions, 377 changer transitions 10372/11814 dead transitions. [2024-02-20 11:28:46,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 11814 transitions, 354345 flow [2024-02-20 11:28:46,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-02-20 11:28:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2024-02-20 11:28:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 975 transitions. [2024-02-20 11:28:46,215 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-02-20 11:28:46,215 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 489 predicate places. [2024-02-20 11:28:46,216 INFO L507 AbstractCegarLoop]: Abstraction has has 515 places, 11814 transitions, 354345 flow [2024-02-20 11:28:46,216 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.205882352941177) internal successors, (245), 34 states have internal predecessors, (245), 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:46,216 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:28:46,216 INFO L234 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:28:46,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-02-20 11:28:46,420 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-02-20 11:28:46,421 INFO L432 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:28:46,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:28:46,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1800186387, now seen corresponding path program 9 times [2024-02-20 11:28:46,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:28:46,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449206254] [2024-02-20 11:28:46,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:28:46,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:28:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:28:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:28:46,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:28:46,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449206254] [2024-02-20 11:28:46,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449206254] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:28:46,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732832243] [2024-02-20 11:28:46,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 11:28:46,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:28:46,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:28:46,750 INFO L229 MonitoredProcess]: Starting monitored process 11 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:46,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-02-20 11:28:46,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-02-20 11:28:46,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:28:46,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 24 conjunts are in the unsatisfiable core [2024-02-20 11:28:46,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:28:46,929 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:28:46,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:28:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:28:47,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732832243] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:28:47,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:28:47,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 28 [2024-02-20 11:28:47,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332158463] [2024-02-20 11:28:47,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:28:47,199 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-02-20 11:28:47,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:28:47,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-02-20 11:28:47,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2024-02-20 11:28:47,241 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:28:47,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 11814 transitions, 354345 flow. Second operand has 29 states, 29 states have (on average 7.344827586206897) internal successors, (213), 29 states have internal predecessors, (213), 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:47,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:28:47,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:28:47,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:31:23,088 INFO L124 PetriNetUnfolderBase]: 34330/57405 cut-off events. [2024-02-20 11:31:23,089 INFO L125 PetriNetUnfolderBase]: For 575405/575445 co-relation queries the response was YES. [2024-02-20 11:31:23,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 836102 conditions, 57405 events. 34330/57405 cut-off events. For 575405/575445 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 415404 event pairs, 44 based on Foata normal form. 6/57338 useless extension candidates. Maximal degree in co-relation 836050. Up to 34909 conditions per place. [2024-02-20 11:31:23,515 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 1147 selfloop transitions, 391 changer transitions 11123/12664 dead transitions. [2024-02-20 11:31:23,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 12664 transitions, 405167 flow [2024-02-20 11:31:23,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-02-20 11:31:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2024-02-20 11:31:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 884 transitions. [2024-02-20 11:31:23,518 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.533816425120773 [2024-02-20 11:31:23,518 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 557 predicate places. [2024-02-20 11:31:23,518 INFO L507 AbstractCegarLoop]: Abstraction has has 583 places, 12664 transitions, 405167 flow [2024-02-20 11:31:23,519 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.344827586206897) internal successors, (213), 29 states have internal predecessors, (213), 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:31:23,519 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:31:23,519 INFO L234 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:31:23,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-02-20 11:31:23,732 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-02-20 11:31:23,732 INFO L432 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:31:23,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:31:23,733 INFO L85 PathProgramCache]: Analyzing trace with hash 340537633, now seen corresponding path program 10 times [2024-02-20 11:31:23,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:31:23,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414378549] [2024-02-20 11:31:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:31:23,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:31:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:31:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:31:24,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:31:24,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414378549] [2024-02-20 11:31:24,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414378549] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:31:24,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767013448] [2024-02-20 11:31:24,075 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-20 11:31:24,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:31:24,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:31:24,076 INFO L229 MonitoredProcess]: Starting monitored process 12 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:31:24,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-02-20 11:31:24,172 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-20 11:31:24,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:31:24,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2024-02-20 11:31:24,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:31:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:31:24,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:31:24,540 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:31:24,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767013448] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:31:24,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:31:24,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 29 [2024-02-20 11:31:24,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163227487] [2024-02-20 11:31:24,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:31:24,541 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-02-20 11:31:24,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:31:24,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-02-20 11:31:24,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2024-02-20 11:31:24,592 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-02-20 11:31:24,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 583 places, 12664 transitions, 405167 flow. Second operand has 30 states, 30 states have (on average 7.166666666666667) internal successors, (215), 30 states have internal predecessors, (215), 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:31:24,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:31:24,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-02-20 11:31:24,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:34:22,667 INFO L124 PetriNetUnfolderBase]: 34744/58104 cut-off events. [2024-02-20 11:34:22,668 INFO L125 PetriNetUnfolderBase]: For 665885/666005 co-relation queries the response was YES. [2024-02-20 11:34:22,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 898937 conditions, 58104 events. 34744/58104 cut-off events. For 665885/666005 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 421333 event pairs, 50 based on Foata normal form. 0/58091 useless extension candidates. Maximal degree in co-relation 898882. Up to 35368 conditions per place. [2024-02-20 11:34:23,125 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 1134 selfloop transitions, 421 changer transitions 11313/12871 dead transitions. [2024-02-20 11:34:23,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 12871 transitions, 437527 flow [2024-02-20 11:34:23,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-02-20 11:34:23,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2024-02-20 11:34:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 987 transitions. [2024-02-20 11:34:23,128 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5340909090909091 [2024-02-20 11:34:23,128 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 633 predicate places. [2024-02-20 11:34:23,128 INFO L507 AbstractCegarLoop]: Abstraction has has 659 places, 12871 transitions, 437527 flow [2024-02-20 11:34:23,128 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.166666666666667) internal successors, (215), 30 states have internal predecessors, (215), 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,128 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:34:23,129 INFO L234 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:34:23,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-02-20 11:34:23,330 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-02-20 11:34:23,330 INFO L432 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:34:23,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:34:23,331 INFO L85 PathProgramCache]: Analyzing trace with hash 986382533, now seen corresponding path program 11 times [2024-02-20 11:34:23,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:34:23,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887245495] [2024-02-20 11:34:23,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:34:23,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:34:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:34:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 253 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:34:23,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:34:23,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887245495] [2024-02-20 11:34:23,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887245495] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:34:23,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952287925] [2024-02-20 11:34:23,485 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-20 11:34:23,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:34:23,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:34:23,486 INFO L229 MonitoredProcess]: Starting monitored process 13 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:34:23,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-02-20 11:34:23,588 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-02-20 11:34:23,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:34:23,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 12 conjunts are in the unsatisfiable core [2024-02-20 11:34:23,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:34:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:34:23,659 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 11:34:23,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952287925] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:34:23,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-20 11:34:23,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 14 [2024-02-20 11:34:23,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278199323] [2024-02-20 11:34:23,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:34:23,661 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-20 11:34:23,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:34:23,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-20 11:34:23,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2024-02-20 11:34:23,668 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 24 [2024-02-20 11:34:23,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 12871 transitions, 437527 flow. Second operand has 13 states, 13 states have (on average 12.846153846153847) internal successors, (167), 13 states have internal predecessors, (167), 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,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:34:23,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 24 [2024-02-20 11:34:23,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15