./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/weaver/unroll-5.wvr.c -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 624ca078114fa3c35bb1960efece3c50cba0d03b97522c4936fd5f6e5d783f29 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:09:57,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:09:57,508 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:09:57,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:09:57,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:09:57,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:09:57,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:09:57,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:09:57,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:09:57,541 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:09:57,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:09:57,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:09:57,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:09:57,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:09:57,544 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:09:57,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:09:57,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:09:57,545 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:09:57,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:09:57,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:09:57,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:09:57,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:09:57,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:09:57,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:09:57,547 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:09:57,547 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:09:57,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:09:57,547 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:09:57,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:09:57,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:09:57,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:09:57,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:09:57,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:09:57,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:09:57,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:09:57,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:09:57,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:09:57,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:09:57,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:09:57,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:09:57,551 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:09:57,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:09:57,552 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:09:57,552 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 -> 624ca078114fa3c35bb1960efece3c50cba0d03b97522c4936fd5f6e5d783f29 [2024-06-27 17:09:57,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:09:57,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:09:57,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:09:57,805 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:09:57,805 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:09:57,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c [2024-06-27 17:09:58,857 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:09:59,098 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:09:59,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c [2024-06-27 17:09:59,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b9df547b/c80aa96b146d420386debca7dbad49a2/FLAG27eba09a5 [2024-06-27 17:09:59,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b9df547b/c80aa96b146d420386debca7dbad49a2 [2024-06-27 17:09:59,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:09:59,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:09:59,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:09:59,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:09:59,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:09:59,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:09:59" (1/1) ... [2024-06-27 17:09:59,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a734256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:59, skipping insertion in model container [2024-06-27 17:09:59,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:09:59" (1/1) ... [2024-06-27 17:09:59,154 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:09:59,305 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c[2670,2683] [2024-06-27 17:09:59,315 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:09:59,322 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:09:59,337 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c[2670,2683] [2024-06-27 17:09:59,340 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:09:59,353 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:09:59,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:59 WrapperNode [2024-06-27 17:09:59,354 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:09:59,355 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:09:59,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:09:59,355 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:09:59,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:59" (1/1) ... [2024-06-27 17:09:59,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:59" (1/1) ... [2024-06-27 17:09:59,385 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 157 [2024-06-27 17:09:59,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:09:59,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:09:59,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:09:59,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:09:59,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:59" (1/1) ... [2024-06-27 17:09:59,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:59" (1/1) ... [2024-06-27 17:09:59,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:59" (1/1) ... [2024-06-27 17:09:59,417 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-06-27 17:09:59,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:59" (1/1) ... [2024-06-27 17:09:59,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:59" (1/1) ... [2024-06-27 17:09:59,423 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:59" (1/1) ... [2024-06-27 17:09:59,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:59" (1/1) ... [2024-06-27 17:09:59,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:59" (1/1) ... [2024-06-27 17:09:59,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:59" (1/1) ... [2024-06-27 17:09:59,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:09:59,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:09:59,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:09:59,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:09:59,445 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:59" (1/1) ... [2024-06-27 17:09:59,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:09:59,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:09:59,490 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-06-27 17:09:59,512 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-06-27 17:09:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:09:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 17:09:59,535 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 17:09:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 17:09:59,535 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 17:09:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:09:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 17:09:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 17:09:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 17:09:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 17:09:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:09:59,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:09:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 17:09:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 17:09:59,538 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:09:59,606 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:09:59,608 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:09:59,832 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:09:59,837 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:10:00,107 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:10:00,107 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-06-27 17:10:00,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:10:00 BoogieIcfgContainer [2024-06-27 17:10:00,108 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:10:00,109 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:10:00,109 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:10:00,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:10:00,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:09:59" (1/3) ... [2024-06-27 17:10:00,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9385d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:10:00, skipping insertion in model container [2024-06-27 17:10:00,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:59" (2/3) ... [2024-06-27 17:10:00,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9385d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:10:00, skipping insertion in model container [2024-06-27 17:10:00,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:10:00" (3/3) ... [2024-06-27 17:10:00,120 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2024-06-27 17:10:00,128 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:10:00,136 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:10:00,137 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 17:10:00,137 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:10:00,182 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 17:10:00,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2024-06-27 17:10:00,242 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2024-06-27 17:10:00,242 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:10:00,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2024-06-27 17:10:00,246 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2024-06-27 17:10:00,248 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2024-06-27 17:10:00,256 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:10:00,264 INFO L357 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4fffbc85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:10:00,265 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 17:10:00,273 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:10:00,274 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2024-06-27 17:10:00,274 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:10:00,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:10:00,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:10:00,275 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:10:00,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:10:00,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1224019720, now seen corresponding path program 1 times [2024-06-27 17:10:00,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:10:00,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159304716] [2024-06-27 17:10:00,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:10:00,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:10:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:10:00,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:10:00,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159304716] [2024-06-27 17:10:00,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159304716] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:10:00,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:10:00,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:10:00,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603095145] [2024-06-27 17:10:00,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:10:00,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:10:00,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:10:00,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:10:00,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:10:00,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:10:00,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-06-27 17:10:00,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:10:00,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:10:00,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:10:00,675 INFO L124 PetriNetUnfolderBase]: 69/125 cut-off events. [2024-06-27 17:10:00,675 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-06-27 17:10:00,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 125 events. 69/125 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 322 event pairs, 22 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 220. Up to 72 conditions per place. [2024-06-27 17:10:00,680 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 23 selfloop transitions, 3 changer transitions 1/28 dead transitions. [2024-06-27 17:10:00,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 28 transitions, 131 flow [2024-06-27 17:10:00,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:10:00,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:10:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2024-06-27 17:10:00,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2024-06-27 17:10:00,691 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 37 transitions. [2024-06-27 17:10:00,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 28 transitions, 131 flow [2024-06-27 17:10:00,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 28 transitions, 117 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 17:10:00,695 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2024-06-27 17:10:00,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=20, PETRI_TRANSITIONS=19} [2024-06-27 17:10:00,700 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2024-06-27 17:10:00,700 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2024-06-27 17:10:00,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-06-27 17:10:00,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:10:00,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:10:00,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:10:00,701 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:10:00,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:10:00,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1539169625, now seen corresponding path program 1 times [2024-06-27 17:10:00,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:10:00,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650412465] [2024-06-27 17:10:00,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:10:00,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:10:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:00,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:10:00,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:10:00,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650412465] [2024-06-27 17:10:00,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650412465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:10:00,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:10:00,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:10:00,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617373893] [2024-06-27 17:10:00,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:10:00,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:10:00,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:10:00,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:10:00,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:10:00,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:10:00,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-06-27 17:10:00,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:10:00,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:10:00,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:10:00,945 INFO L124 PetriNetUnfolderBase]: 69/126 cut-off events. [2024-06-27 17:10:00,945 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-06-27 17:10:00,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 126 events. 69/126 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 301 event pairs, 44 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 110. Up to 125 conditions per place. [2024-06-27 17:10:00,948 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2024-06-27 17:10:00,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 20 transitions, 97 flow [2024-06-27 17:10:00,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:10:00,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:10:00,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2024-06-27 17:10:00,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-27 17:10:00,970 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 3 states and 27 transitions. [2024-06-27 17:10:00,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 20 transitions, 97 flow [2024-06-27 17:10:00,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 94 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:10:00,972 INFO L231 Difference]: Finished difference. Result has 22 places, 20 transitions, 66 flow [2024-06-27 17:10:00,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=22, PETRI_TRANSITIONS=20} [2024-06-27 17:10:00,973 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2024-06-27 17:10:00,973 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 20 transitions, 66 flow [2024-06-27 17:10:00,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-06-27 17:10:00,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:10:00,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:10:00,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:10:00,975 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:10:00,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:10:00,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1379179667, now seen corresponding path program 1 times [2024-06-27 17:10:00,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:10:00,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344138359] [2024-06-27 17:10:00,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:10:00,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:10:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:01,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:10:01,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:10:01,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344138359] [2024-06-27 17:10:01,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344138359] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:10:01,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594915154] [2024-06-27 17:10:01,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:10:01,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:10:01,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:10:01,169 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-06-27 17:10:01,188 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-06-27 17:10:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:01,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:10:01,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:10:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:10:01,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:10:01,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:10:01,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594915154] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:10:01,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:10:01,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2024-06-27 17:10:01,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178132026] [2024-06-27 17:10:01,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:10:01,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:10:01,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:10:01,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:10:01,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:10:01,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:10:01,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 20 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-06-27 17:10:01,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:10:01,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:10:01,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:10:01,461 INFO L124 PetriNetUnfolderBase]: 76/138 cut-off events. [2024-06-27 17:10:01,461 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-06-27 17:10:01,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 138 events. 76/138 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 365 event pairs, 22 based on Foata normal form. 5/142 useless extension candidates. Maximal degree in co-relation 317. Up to 71 conditions per place. [2024-06-27 17:10:01,464 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 28 selfloop transitions, 4 changer transitions 1/34 dead transitions. [2024-06-27 17:10:01,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 168 flow [2024-06-27 17:10:01,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:10:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:10:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2024-06-27 17:10:01,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-06-27 17:10:01,465 INFO L175 Difference]: Start difference. First operand has 22 places, 20 transitions, 66 flow. Second operand 4 states and 45 transitions. [2024-06-27 17:10:01,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 168 flow [2024-06-27 17:10:01,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 34 transitions, 164 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:10:01,469 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 88 flow [2024-06-27 17:10:01,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2024-06-27 17:10:01,470 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2024-06-27 17:10:01,471 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 88 flow [2024-06-27 17:10:01,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-06-27 17:10:01,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:10:01,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:10:01,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-27 17:10:01,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:10:01,706 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:10:01,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:10:01,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2145685361, now seen corresponding path program 1 times [2024-06-27 17:10:01,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:10:01,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161151733] [2024-06-27 17:10:01,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:10:01,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:10:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:01,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:10:01,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:10:01,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161151733] [2024-06-27 17:10:01,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161151733] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:10:01,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:10:01,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:10:01,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498307340] [2024-06-27 17:10:01,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:10:01,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:10:01,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:10:01,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:10:01,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:10:01,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:10:01,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:01,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:10:01,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:10:01,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:10:01,942 INFO L124 PetriNetUnfolderBase]: 85/167 cut-off events. [2024-06-27 17:10:01,942 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2024-06-27 17:10:01,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 167 events. 85/167 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 542 event pairs, 24 based on Foata normal form. 9/175 useless extension candidates. Maximal degree in co-relation 442. Up to 93 conditions per place. [2024-06-27 17:10:01,947 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 31 selfloop transitions, 4 changer transitions 7/43 dead transitions. [2024-06-27 17:10:01,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 43 transitions, 243 flow [2024-06-27 17:10:01,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:10:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:10:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2024-06-27 17:10:01,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53 [2024-06-27 17:10:01,949 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 88 flow. Second operand 5 states and 53 transitions. [2024-06-27 17:10:01,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 43 transitions, 243 flow [2024-06-27 17:10:01,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 43 transitions, 238 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:10:01,952 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 115 flow [2024-06-27 17:10:01,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2024-06-27 17:10:01,953 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2024-06-27 17:10:01,953 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 115 flow [2024-06-27 17:10:01,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:01,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:10:01,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:10:01,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:10:01,954 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:10:01,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:10:01,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1095045627, now seen corresponding path program 2 times [2024-06-27 17:10:01,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:10:01,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414841783] [2024-06-27 17:10:01,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:10:01,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:10:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:10:02,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:10:02,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414841783] [2024-06-27 17:10:02,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414841783] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:10:02,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667198840] [2024-06-27 17:10:02,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:10:02,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:10:02,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:10:02,057 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-06-27 17:10:02,102 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-06-27 17:10:02,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:10:02,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:10:02,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:10:02,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:10:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:10:02,179 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:10:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:10:02,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667198840] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:10:02,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:10:02,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-06-27 17:10:02,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011710087] [2024-06-27 17:10:02,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:10:02,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 17:10:02,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:10:02,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 17:10:02,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 17:10:02,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:10:02,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 115 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:02,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:10:02,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:10:02,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:10:02,335 INFO L124 PetriNetUnfolderBase]: 108/212 cut-off events. [2024-06-27 17:10:02,335 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2024-06-27 17:10:02,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 212 events. 108/212 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 705 event pairs, 38 based on Foata normal form. 5/216 useless extension candidates. Maximal degree in co-relation 702. Up to 123 conditions per place. [2024-06-27 17:10:02,336 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 31 selfloop transitions, 11 changer transitions 5/48 dead transitions. [2024-06-27 17:10:02,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 324 flow [2024-06-27 17:10:02,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:10:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:10:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2024-06-27 17:10:02,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54 [2024-06-27 17:10:02,338 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 115 flow. Second operand 5 states and 54 transitions. [2024-06-27 17:10:02,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 324 flow [2024-06-27 17:10:02,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 48 transitions, 306 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-27 17:10:02,342 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 194 flow [2024-06-27 17:10:02,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2024-06-27 17:10:02,344 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2024-06-27 17:10:02,344 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 194 flow [2024-06-27 17:10:02,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:02,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:10:02,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:10:02,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-06-27 17:10:02,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:10:02,558 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:10:02,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:10:02,559 INFO L85 PathProgramCache]: Analyzing trace with hash -944125937, now seen corresponding path program 2 times [2024-06-27 17:10:02,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:10:02,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882846579] [2024-06-27 17:10:02,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:10:02,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:10:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:02,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:10:02,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:10:02,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882846579] [2024-06-27 17:10:02,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882846579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:10:02,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:10:02,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:10:02,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721761815] [2024-06-27 17:10:02,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:10:02,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:10:02,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:10:02,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:10:02,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:10:02,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:10:02,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-06-27 17:10:02,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:10:02,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:10:02,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:10:02,708 INFO L124 PetriNetUnfolderBase]: 114/222 cut-off events. [2024-06-27 17:10:02,708 INFO L125 PetriNetUnfolderBase]: For 413/413 co-relation queries the response was YES. [2024-06-27 17:10:02,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 222 events. 114/222 cut-off events. For 413/413 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 790 event pairs, 34 based on Foata normal form. 4/225 useless extension candidates. Maximal degree in co-relation 832. Up to 134 conditions per place. [2024-06-27 17:10:02,710 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 34 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2024-06-27 17:10:02,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 357 flow [2024-06-27 17:10:02,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:10:02,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:10:02,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-06-27 17:10:02,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-06-27 17:10:02,713 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 194 flow. Second operand 4 states and 44 transitions. [2024-06-27 17:10:02,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 357 flow [2024-06-27 17:10:02,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 355 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-27 17:10:02,716 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 256 flow [2024-06-27 17:10:02,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=256, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2024-06-27 17:10:02,717 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2024-06-27 17:10:02,717 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 256 flow [2024-06-27 17:10:02,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-06-27 17:10:02,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:10:02,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:10:02,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:10:02,718 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:10:02,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:10:02,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1632477155, now seen corresponding path program 3 times [2024-06-27 17:10:02,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:10:02,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767678554] [2024-06-27 17:10:02,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:10:02,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:10:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:10:02,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:10:02,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767678554] [2024-06-27 17:10:02,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767678554] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:10:02,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:10:02,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:10:02,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502309679] [2024-06-27 17:10:02,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:10:02,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:10:02,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:10:02,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:10:02,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:10:02,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:10:02,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-06-27 17:10:02,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:10:02,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:10:02,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:10:02,845 INFO L124 PetriNetUnfolderBase]: 115/218 cut-off events. [2024-06-27 17:10:02,845 INFO L125 PetriNetUnfolderBase]: For 528/528 co-relation queries the response was YES. [2024-06-27 17:10:02,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 218 events. 115/218 cut-off events. For 528/528 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 735 event pairs, 33 based on Foata normal form. 4/221 useless extension candidates. Maximal degree in co-relation 918. Up to 133 conditions per place. [2024-06-27 17:10:02,847 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 32 selfloop transitions, 9 changer transitions 3/45 dead transitions. [2024-06-27 17:10:02,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 399 flow [2024-06-27 17:10:02,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:10:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:10:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-06-27 17:10:02,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-06-27 17:10:02,848 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 256 flow. Second operand 4 states and 44 transitions. [2024-06-27 17:10:02,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 399 flow [2024-06-27 17:10:02,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 384 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 17:10:02,851 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 285 flow [2024-06-27 17:10:02,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2024-06-27 17:10:02,852 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2024-06-27 17:10:02,852 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 285 flow [2024-06-27 17:10:02,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-06-27 17:10:02,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:10:02,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:10:02,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:10:02,853 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:10:02,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:10:02,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1547063205, now seen corresponding path program 3 times [2024-06-27 17:10:02,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:10:02,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683516231] [2024-06-27 17:10:02,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:10:02,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:10:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:10:02,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:10:02,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683516231] [2024-06-27 17:10:02,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683516231] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:10:02,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:10:02,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:10:02,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066967740] [2024-06-27 17:10:02,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:10:02,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:10:02,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:10:02,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:10:02,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:10:02,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:10:02,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 285 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:02,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:10:02,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:10:02,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:10:02,990 INFO L124 PetriNetUnfolderBase]: 100/184 cut-off events. [2024-06-27 17:10:02,991 INFO L125 PetriNetUnfolderBase]: For 598/598 co-relation queries the response was YES. [2024-06-27 17:10:02,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 184 events. 100/184 cut-off events. For 598/598 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 534 event pairs, 31 based on Foata normal form. 2/185 useless extension candidates. Maximal degree in co-relation 802. Up to 136 conditions per place. [2024-06-27 17:10:02,993 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 30 selfloop transitions, 11 changer transitions 2/44 dead transitions. [2024-06-27 17:10:02,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 413 flow [2024-06-27 17:10:02,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:10:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:10:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2024-06-27 17:10:02,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2024-06-27 17:10:02,994 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 285 flow. Second operand 5 states and 44 transitions. [2024-06-27 17:10:02,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 413 flow [2024-06-27 17:10:02,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 381 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 17:10:02,997 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 301 flow [2024-06-27 17:10:02,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2024-06-27 17:10:02,999 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 24 predicate places. [2024-06-27 17:10:02,999 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 301 flow [2024-06-27 17:10:02,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:02,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:10:02,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:10:02,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 17:10:02,999 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:10:03,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:10:03,000 INFO L85 PathProgramCache]: Analyzing trace with hash 663248543, now seen corresponding path program 4 times [2024-06-27 17:10:03,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:10:03,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488410018] [2024-06-27 17:10:03,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:10:03,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:10:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:10:03,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:10:03,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488410018] [2024-06-27 17:10:03,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488410018] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:10:03,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:10:03,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:10:03,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523696767] [2024-06-27 17:10:03,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:10:03,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:10:03,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:10:03,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:10:03,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:10:03,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:10:03,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:03,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:10:03,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:10:03,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:10:03,151 INFO L124 PetriNetUnfolderBase]: 94/170 cut-off events. [2024-06-27 17:10:03,152 INFO L125 PetriNetUnfolderBase]: For 673/673 co-relation queries the response was YES. [2024-06-27 17:10:03,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 170 events. 94/170 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 481 event pairs, 29 based on Foata normal form. 4/173 useless extension candidates. Maximal degree in co-relation 800. Up to 122 conditions per place. [2024-06-27 17:10:03,153 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 30 selfloop transitions, 9 changer transitions 4/44 dead transitions. [2024-06-27 17:10:03,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 427 flow [2024-06-27 17:10:03,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:10:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:10:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2024-06-27 17:10:03,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43 [2024-06-27 17:10:03,155 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 301 flow. Second operand 5 states and 43 transitions. [2024-06-27 17:10:03,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 427 flow [2024-06-27 17:10:03,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 44 transitions, 413 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 17:10:03,158 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 323 flow [2024-06-27 17:10:03,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=323, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2024-06-27 17:10:03,159 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 29 predicate places. [2024-06-27 17:10:03,159 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 323 flow [2024-06-27 17:10:03,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:03,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:10:03,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:10:03,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 17:10:03,160 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:10:03,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:10:03,161 INFO L85 PathProgramCache]: Analyzing trace with hash -979150364, now seen corresponding path program 1 times [2024-06-27 17:10:03,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:10:03,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639474351] [2024-06-27 17:10:03,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:10:03,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:10:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:10:03,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:10:03,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639474351] [2024-06-27 17:10:03,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639474351] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:10:03,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082900645] [2024-06-27 17:10:03,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:10:03,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:10:03,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:10:03,341 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-06-27 17:10:03,368 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-06-27 17:10:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:03,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 30 conjunts are in the unsatisfiable core [2024-06-27 17:10:03,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:10:03,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 17:10:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:10:03,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:10:03,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 388 treesize of output 340 [2024-06-27 17:10:04,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:10:04,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 17 new quantified variables, introduced 45 case distinctions, treesize of input 3973 treesize of output 2733 [2024-06-27 17:11:04,744 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-06-27 17:11:48,806 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-06-27 17:12:04,452 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-06-27 17:12:24,320 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-06-27 17:12:32,007 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-06-27 17:12:32,927 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-06-27 17:12:37,044 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-06-27 17:12:45,733 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-06-27 17:18:18,705 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-06-27 17:18:18,706 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-06-27 17:18:18,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-06-27 17:18:18,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-06-27 17:18:18,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:18:18,908 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:287) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:519) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:609) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2024-06-27 17:18:18,912 INFO L158 Benchmark]: Toolchain (without parser) took 499786.62ms. Allocated memory was 167.8MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 130.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-06-27 17:18:18,912 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory was 136.4MB in the beginning and 136.3MB in the end (delta: 91.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:18:18,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.53ms. Allocated memory is still 167.8MB. Free memory was 130.1MB in the beginning and 117.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-06-27 17:18:18,913 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.91ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 115.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:18:18,913 INFO L158 Benchmark]: Boogie Preprocessor took 55.20ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 112.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:18:18,913 INFO L158 Benchmark]: RCFGBuilder took 663.91ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 134.5MB in the end (delta: -21.9MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. [2024-06-27 17:18:18,914 INFO L158 Benchmark]: TraceAbstraction took 498802.40ms. Allocated memory was 167.8MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 134.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-06-27 17:18:18,915 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory was 136.4MB in the beginning and 136.3MB in the end (delta: 91.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.53ms. Allocated memory is still 167.8MB. Free memory was 130.1MB in the beginning and 117.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.91ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 115.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.20ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 112.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 663.91ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 134.5MB in the end (delta: -21.9MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. * TraceAbstraction took 498802.40ms. Allocated memory was 167.8MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 134.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/weaver/unroll-5.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 624ca078114fa3c35bb1960efece3c50cba0d03b97522c4936fd5f6e5d783f29 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:18:20,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:18:21,030 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-06-27 17:18:21,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:18:21,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:18:21,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:18:21,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:18:21,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:18:21,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:18:21,076 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:18:21,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:18:21,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:18:21,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:18:21,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:18:21,078 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:18:21,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:18:21,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:18:21,079 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:18:21,079 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:18:21,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:18:21,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:18:21,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:18:21,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:18:21,081 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-06-27 17:18:21,081 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-06-27 17:18:21,081 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:18:21,082 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-06-27 17:18:21,082 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:18:21,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:18:21,082 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:18:21,083 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:18:21,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:18:21,083 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:18:21,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:18:21,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:18:21,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:18:21,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:18:21,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:18:21,085 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-06-27 17:18:21,085 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-06-27 17:18:21,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:18:21,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:18:21,086 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:18:21,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:18:21,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:18:21,087 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-06-27 17:18:21,093 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 -> 624ca078114fa3c35bb1960efece3c50cba0d03b97522c4936fd5f6e5d783f29 [2024-06-27 17:18:21,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:18:21,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:18:21,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:18:21,367 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:18:21,368 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:18:21,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c [2024-06-27 17:18:22,516 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:18:22,704 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:18:22,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c [2024-06-27 17:18:22,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ae4c4c41/76fd8198e49f4c1589f956b8a6c6fe69/FLAGc3c3ef086 [2024-06-27 17:18:22,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ae4c4c41/76fd8198e49f4c1589f956b8a6c6fe69 [2024-06-27 17:18:22,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:18:22,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:18:22,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:18:22,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:18:22,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:18:22,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:18:22" (1/1) ... [2024-06-27 17:18:22,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d1b628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:22, skipping insertion in model container [2024-06-27 17:18:22,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:18:22" (1/1) ... [2024-06-27 17:18:22,756 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:18:22,934 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c[2670,2683] [2024-06-27 17:18:22,949 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:18:22,962 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-06-27 17:18:22,966 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:18:22,983 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c[2670,2683] [2024-06-27 17:18:22,991 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:18:22,995 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:18:23,020 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c[2670,2683] [2024-06-27 17:18:23,022 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:18:23,035 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:18:23,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:23 WrapperNode [2024-06-27 17:18:23,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:18:23,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:18:23,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:18:23,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:18:23,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:23" (1/1) ... [2024-06-27 17:18:23,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:23" (1/1) ... [2024-06-27 17:18:23,089 INFO L138 Inliner]: procedures = 25, calls = 28, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 155 [2024-06-27 17:18:23,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:18:23,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:18:23,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:18:23,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:18:23,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:23" (1/1) ... [2024-06-27 17:18:23,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:23" (1/1) ... [2024-06-27 17:18:23,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:23" (1/1) ... [2024-06-27 17:18:23,137 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-06-27 17:18:23,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:23" (1/1) ... [2024-06-27 17:18:23,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:23" (1/1) ... [2024-06-27 17:18:23,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:23" (1/1) ... [2024-06-27 17:18:23,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:23" (1/1) ... [2024-06-27 17:18:23,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:23" (1/1) ... [2024-06-27 17:18:23,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:23" (1/1) ... [2024-06-27 17:18:23,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:18:23,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:18:23,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:18:23,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:18:23,178 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:23" (1/1) ... [2024-06-27 17:18:23,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:18:23,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:18:23,208 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-06-27 17:18:23,217 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-06-27 17:18:23,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:18:23,252 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 17:18:23,252 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 17:18:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 17:18:23,253 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 17:18:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-06-27 17:18:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-06-27 17:18:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 17:18:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-06-27 17:18:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-06-27 17:18:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:18:23,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:18:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-06-27 17:18:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-06-27 17:18:23,255 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:18:23,349 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:18:23,350 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:18:23,728 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:18:23,729 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:18:23,960 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:18:23,961 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-06-27 17:18:23,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:18:23 BoogieIcfgContainer [2024-06-27 17:18:23,961 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:18:23,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:18:23,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:18:23,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:18:23,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:18:22" (1/3) ... [2024-06-27 17:18:23,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6821ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:18:23, skipping insertion in model container [2024-06-27 17:18:23,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:18:23" (2/3) ... [2024-06-27 17:18:23,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6821ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:18:23, skipping insertion in model container [2024-06-27 17:18:23,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:18:23" (3/3) ... [2024-06-27 17:18:23,967 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2024-06-27 17:18:23,973 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:18:23,980 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:18:23,980 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 17:18:23,980 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:18:24,008 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 17:18:24,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2024-06-27 17:18:24,045 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2024-06-27 17:18:24,046 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:18:24,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2024-06-27 17:18:24,048 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2024-06-27 17:18:24,050 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2024-06-27 17:18:24,057 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:18:24,062 INFO L357 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4cdfd718, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:18:24,062 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 17:18:24,067 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:18:24,068 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2024-06-27 17:18:24,074 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:18:24,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:24,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:24,075 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:24,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:24,080 INFO L85 PathProgramCache]: Analyzing trace with hash -122311800, now seen corresponding path program 1 times [2024-06-27 17:18:24,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:24,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104819021] [2024-06-27 17:18:24,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:18:24,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:24,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:24,092 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:24,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-06-27 17:18:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:18:24,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-27 17:18:24,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:18:24,317 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:18:24,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:24,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104819021] [2024-06-27 17:18:24,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104819021] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:18:24,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:18:24,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:18:24,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999593723] [2024-06-27 17:18:24,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:18:24,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:18:24,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:24,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:18:24,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:18:24,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:24,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-06-27 17:18:24,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:24,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:24,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:24,462 INFO L124 PetriNetUnfolderBase]: 69/125 cut-off events. [2024-06-27 17:18:24,462 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-06-27 17:18:24,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 125 events. 69/125 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 322 event pairs, 22 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 220. Up to 72 conditions per place. [2024-06-27 17:18:24,464 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 23 selfloop transitions, 3 changer transitions 1/28 dead transitions. [2024-06-27 17:18:24,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 28 transitions, 131 flow [2024-06-27 17:18:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:18:24,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:18:24,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2024-06-27 17:18:24,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2024-06-27 17:18:24,475 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 37 transitions. [2024-06-27 17:18:24,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 28 transitions, 131 flow [2024-06-27 17:18:24,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 28 transitions, 117 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 17:18:24,480 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2024-06-27 17:18:24,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=20, PETRI_TRANSITIONS=19} [2024-06-27 17:18:24,484 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2024-06-27 17:18:24,484 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2024-06-27 17:18:24,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-06-27 17:18:24,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:24,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:24,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:24,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:24,687 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:24,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:24,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1542401835, now seen corresponding path program 1 times [2024-06-27 17:18:24,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:24,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901691382] [2024-06-27 17:18:24,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:18:24,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:24,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:24,690 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:24,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-06-27 17:18:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:18:24,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:18:24,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:24,781 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:18:24,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:24,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901691382] [2024-06-27 17:18:24,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901691382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:18:24,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:18:24,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:18:24,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537642969] [2024-06-27 17:18:24,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:18:24,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:18:24,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:24,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:18:24,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:18:24,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:24,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-06-27 17:18:24,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:24,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:24,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:24,871 INFO L124 PetriNetUnfolderBase]: 69/126 cut-off events. [2024-06-27 17:18:24,871 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-06-27 17:18:24,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 126 events. 69/126 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 297 event pairs, 44 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 110. Up to 125 conditions per place. [2024-06-27 17:18:24,872 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2024-06-27 17:18:24,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 20 transitions, 97 flow [2024-06-27 17:18:24,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:18:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:18:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2024-06-27 17:18:24,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-27 17:18:24,873 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 3 states and 27 transitions. [2024-06-27 17:18:24,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 20 transitions, 97 flow [2024-06-27 17:18:24,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 94 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:18:24,874 INFO L231 Difference]: Finished difference. Result has 22 places, 20 transitions, 66 flow [2024-06-27 17:18:24,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=22, PETRI_TRANSITIONS=20} [2024-06-27 17:18:24,875 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2024-06-27 17:18:24,875 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 20 transitions, 66 flow [2024-06-27 17:18:24,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-06-27 17:18:24,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:24,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:24,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:25,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:25,079 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:25,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:25,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1876352877, now seen corresponding path program 1 times [2024-06-27 17:18:25,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:25,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615655470] [2024-06-27 17:18:25,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:18:25,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:25,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:25,082 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:25,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-06-27 17:18:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:18:25,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 17:18:25,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:25,187 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:25,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:25,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615655470] [2024-06-27 17:18:25,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615655470] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:25,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:25,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-06-27 17:18:25,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594824633] [2024-06-27 17:18:25,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:25,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 17:18:25,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:25,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 17:18:25,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-06-27 17:18:25,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:25,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 20 transitions, 66 flow. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-06-27 17:18:25,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:25,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:25,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:25,641 INFO L124 PetriNetUnfolderBase]: 126/233 cut-off events. [2024-06-27 17:18:25,641 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-06-27 17:18:25,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 233 events. 126/233 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 802 event pairs, 13 based on Foata normal form. 28/260 useless extension candidates. Maximal degree in co-relation 551. Up to 82 conditions per place. [2024-06-27 17:18:25,643 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 54 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2024-06-27 17:18:25,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 66 transitions, 325 flow [2024-06-27 17:18:25,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:18:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:18:25,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2024-06-27 17:18:25,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2024-06-27 17:18:25,645 INFO L175 Difference]: Start difference. First operand has 22 places, 20 transitions, 66 flow. Second operand 9 states and 92 transitions. [2024-06-27 17:18:25,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 66 transitions, 325 flow [2024-06-27 17:18:25,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 66 transitions, 321 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:18:25,647 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 150 flow [2024-06-27 17:18:25,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=150, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-27 17:18:25,648 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2024-06-27 17:18:25,648 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 150 flow [2024-06-27 17:18:25,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-06-27 17:18:25,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:25,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:25,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:25,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:25,849 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:25,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:25,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1553128357, now seen corresponding path program 1 times [2024-06-27 17:18:25,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:25,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123125915] [2024-06-27 17:18:25,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:18:25,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:25,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:25,851 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:25,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-06-27 17:18:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:18:25,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-27 17:18:25,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:26,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:26,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:26,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:26,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123125915] [2024-06-27 17:18:26,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123125915] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:18:26,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 17:18:26,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-06-27 17:18:26,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036401106] [2024-06-27 17:18:26,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:18:26,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:18:26,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:26,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:18:26,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-06-27 17:18:26,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:26,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-06-27 17:18:26,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:26,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:26,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:26,295 INFO L124 PetriNetUnfolderBase]: 124/226 cut-off events. [2024-06-27 17:18:26,295 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2024-06-27 17:18:26,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 226 events. 124/226 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 697 event pairs, 22 based on Foata normal form. 4/230 useless extension candidates. Maximal degree in co-relation 746. Up to 154 conditions per place. [2024-06-27 17:18:26,300 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 32 selfloop transitions, 6 changer transitions 1/40 dead transitions. [2024-06-27 17:18:26,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 269 flow [2024-06-27 17:18:26,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:18:26,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:18:26,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-06-27 17:18:26,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-06-27 17:18:26,304 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 150 flow. Second operand 4 states and 44 transitions. [2024-06-27 17:18:26,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 269 flow [2024-06-27 17:18:26,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 262 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 17:18:26,310 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 184 flow [2024-06-27 17:18:26,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2024-06-27 17:18:26,312 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 18 predicate places. [2024-06-27 17:18:26,312 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 184 flow [2024-06-27 17:18:26,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-06-27 17:18:26,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:26,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:26,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-06-27 17:18:26,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:26,515 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:26,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash 383733707, now seen corresponding path program 2 times [2024-06-27 17:18:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:26,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614755016] [2024-06-27 17:18:26,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:18:26,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:26,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:26,518 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:26,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-06-27 17:18:26,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:18:26,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:26,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 17:18:26,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:26,661 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:18:26,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:26,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614755016] [2024-06-27 17:18:26,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614755016] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:18:26,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:18:26,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:18:26,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545489237] [2024-06-27 17:18:26,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:18:26,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:18:26,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:26,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:18:26,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:18:26,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:26,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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-06-27 17:18:26,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:26,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:26,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:26,838 INFO L124 PetriNetUnfolderBase]: 118/218 cut-off events. [2024-06-27 17:18:26,838 INFO L125 PetriNetUnfolderBase]: For 412/412 co-relation queries the response was YES. [2024-06-27 17:18:26,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 218 events. 118/218 cut-off events. For 412/412 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 703 event pairs, 51 based on Foata normal form. 6/224 useless extension candidates. Maximal degree in co-relation 747. Up to 142 conditions per place. [2024-06-27 17:18:26,840 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 27 selfloop transitions, 7 changer transitions 12/47 dead transitions. [2024-06-27 17:18:26,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 320 flow [2024-06-27 17:18:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:18:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:18:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2024-06-27 17:18:26,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-06-27 17:18:26,841 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 184 flow. Second operand 6 states and 55 transitions. [2024-06-27 17:18:26,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 320 flow [2024-06-27 17:18:26,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 311 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 17:18:26,843 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 181 flow [2024-06-27 17:18:26,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=181, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2024-06-27 17:18:26,844 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 24 predicate places. [2024-06-27 17:18:26,844 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 181 flow [2024-06-27 17:18:26,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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-06-27 17:18:26,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:26,844 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:26,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:27,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:27,047 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:27,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:27,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1467486352, now seen corresponding path program 2 times [2024-06-27 17:18:27,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:27,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573584586] [2024-06-27 17:18:27,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:18:27,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:27,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:27,050 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:27,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-06-27 17:18:27,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:18:27,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:27,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 17:18:27,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:27,239 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:18:27,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:18:27,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:27,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573584586] [2024-06-27 17:18:27,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573584586] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:27,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:27,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2024-06-27 17:18:27,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146105112] [2024-06-27 17:18:27,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:27,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 17:18:27,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:27,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 17:18:27,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:18:27,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:27,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 181 flow. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 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-06-27 17:18:27,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:27,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:27,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:28,298 INFO L124 PetriNetUnfolderBase]: 174/318 cut-off events. [2024-06-27 17:18:28,298 INFO L125 PetriNetUnfolderBase]: For 479/479 co-relation queries the response was YES. [2024-06-27 17:18:28,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 318 events. 174/318 cut-off events. For 479/479 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1057 event pairs, 12 based on Foata normal form. 22/340 useless extension candidates. Maximal degree in co-relation 1079. Up to 138 conditions per place. [2024-06-27 17:18:28,300 INFO L140 encePairwiseOnDemand]: 12/20 looper letters, 66 selfloop transitions, 45 changer transitions 0/112 dead transitions. [2024-06-27 17:18:28,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 112 transitions, 712 flow [2024-06-27 17:18:28,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-06-27 17:18:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-06-27 17:18:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 167 transitions. [2024-06-27 17:18:28,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4394736842105263 [2024-06-27 17:18:28,303 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 181 flow. Second operand 19 states and 167 transitions. [2024-06-27 17:18:28,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 112 transitions, 712 flow [2024-06-27 17:18:28,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 112 transitions, 640 flow, removed 14 selfloop flow, removed 10 redundant places. [2024-06-27 17:18:28,306 INFO L231 Difference]: Finished difference. Result has 58 places, 68 transitions, 477 flow [2024-06-27 17:18:28,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=477, PETRI_PLACES=58, PETRI_TRANSITIONS=68} [2024-06-27 17:18:28,307 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 37 predicate places. [2024-06-27 17:18:28,307 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 68 transitions, 477 flow [2024-06-27 17:18:28,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 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-06-27 17:18:28,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:28,307 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:28,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-06-27 17:18:28,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:28,511 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:28,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:28,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1586495169, now seen corresponding path program 3 times [2024-06-27 17:18:28,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:28,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258949956] [2024-06-27 17:18:28,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:18:28,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:28,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:28,513 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:28,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-06-27 17:18:28,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 17:18:28,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:28,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 17:18:28,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 17:18:28,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 17:18:28,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:28,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258949956] [2024-06-27 17:18:28,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258949956] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:18:28,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 17:18:28,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-06-27 17:18:28,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311610014] [2024-06-27 17:18:28,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:18:28,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:18:28,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:28,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:18:28,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-06-27 17:18:28,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:28,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 68 transitions, 477 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-06-27 17:18:28,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:28,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:28,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:28,856 INFO L124 PetriNetUnfolderBase]: 169/300 cut-off events. [2024-06-27 17:18:28,856 INFO L125 PetriNetUnfolderBase]: For 1132/1132 co-relation queries the response was YES. [2024-06-27 17:18:28,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 300 events. 169/300 cut-off events. For 1132/1132 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 937 event pairs, 11 based on Foata normal form. 26/326 useless extension candidates. Maximal degree in co-relation 1323. Up to 205 conditions per place. [2024-06-27 17:18:28,859 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 56 selfloop transitions, 22 changer transitions 0/79 dead transitions. [2024-06-27 17:18:28,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 79 transitions, 705 flow [2024-06-27 17:18:28,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:18:28,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:18:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2024-06-27 17:18:28,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-27 17:18:28,861 INFO L175 Difference]: Start difference. First operand has 58 places, 68 transitions, 477 flow. Second operand 4 states and 42 transitions. [2024-06-27 17:18:28,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 79 transitions, 705 flow [2024-06-27 17:18:28,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 528 flow, removed 70 selfloop flow, removed 7 redundant places. [2024-06-27 17:18:28,867 INFO L231 Difference]: Finished difference. Result has 54 places, 67 transitions, 421 flow [2024-06-27 17:18:28,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=421, PETRI_PLACES=54, PETRI_TRANSITIONS=67} [2024-06-27 17:18:28,868 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2024-06-27 17:18:28,868 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 67 transitions, 421 flow [2024-06-27 17:18:28,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-06-27 17:18:28,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:28,868 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:28,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:29,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:29,071 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:29,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:29,072 INFO L85 PathProgramCache]: Analyzing trace with hash 560178533, now seen corresponding path program 4 times [2024-06-27 17:18:29,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:29,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123152336] [2024-06-27 17:18:29,073 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 17:18:29,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:29,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:29,074 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:29,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-06-27 17:18:29,146 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 17:18:29,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:29,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-27 17:18:29,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 17:18:29,232 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 17:18:29,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:29,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123152336] [2024-06-27 17:18:29,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123152336] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:29,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:29,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2024-06-27 17:18:29,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184084174] [2024-06-27 17:18:29,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:29,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 17:18:29,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:29,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 17:18:29,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:18:29,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:29,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 67 transitions, 421 flow. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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-06-27 17:18:29,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:29,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:29,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:29,990 INFO L124 PetriNetUnfolderBase]: 216/394 cut-off events. [2024-06-27 17:18:29,990 INFO L125 PetriNetUnfolderBase]: For 1637/1637 co-relation queries the response was YES. [2024-06-27 17:18:29,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1615 conditions, 394 events. 216/394 cut-off events. For 1637/1637 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1424 event pairs, 29 based on Foata normal form. 8/401 useless extension candidates. Maximal degree in co-relation 1585. Up to 152 conditions per place. [2024-06-27 17:18:29,993 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 57 selfloop transitions, 54 changer transitions 6/118 dead transitions. [2024-06-27 17:18:29,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 118 transitions, 947 flow [2024-06-27 17:18:29,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 17:18:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 17:18:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 94 transitions. [2024-06-27 17:18:29,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2024-06-27 17:18:29,994 INFO L175 Difference]: Start difference. First operand has 54 places, 67 transitions, 421 flow. Second operand 12 states and 94 transitions. [2024-06-27 17:18:29,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 118 transitions, 947 flow [2024-06-27 17:18:29,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 118 transitions, 841 flow, removed 43 selfloop flow, removed 6 redundant places. [2024-06-27 17:18:29,999 INFO L231 Difference]: Finished difference. Result has 65 places, 89 transitions, 736 flow [2024-06-27 17:18:29,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=736, PETRI_PLACES=65, PETRI_TRANSITIONS=89} [2024-06-27 17:18:30,000 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 44 predicate places. [2024-06-27 17:18:30,000 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 89 transitions, 736 flow [2024-06-27 17:18:30,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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-06-27 17:18:30,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:30,000 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:30,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:30,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:30,203 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:30,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:30,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1920324837, now seen corresponding path program 5 times [2024-06-27 17:18:30,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:30,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879714157] [2024-06-27 17:18:30,204 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 17:18:30,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:30,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:30,207 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:30,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-06-27 17:18:30,290 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-06-27 17:18:30,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:30,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2024-06-27 17:18:30,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:30,820 INFO L349 Elim1Store]: treesize reduction 568, result has 4.2 percent of original size [2024-06-27 17:18:30,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 6 disjoint index pairs (out of 66 index pairs), introduced 20 new quantified variables, introduced 66 case distinctions, treesize of input 838 treesize of output 152 [2024-06-27 17:18:30,928 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:18:30,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:31,842 INFO L349 Elim1Store]: treesize reduction 498, result has 21.3 percent of original size [2024-06-27 17:18:31,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 20 new quantified variables, introduced 66 case distinctions, treesize of input 955 treesize of output 282 [2024-06-27 17:18:48,243 WARN L293 SmtUtils]: Spent 5.99s on a formula simplification. DAG size of input: 661 DAG size of output: 659 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 17:19:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:19:30,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:19:30,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879714157] [2024-06-27 17:19:30,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879714157] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:19:30,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:19:30,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-06-27 17:19:30,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551474295] [2024-06-27 17:19:30,719 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:19:30,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-27 17:19:30,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:19:30,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-27 17:19:30,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-06-27 17:19:30,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:19:30,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 89 transitions, 736 flow. Second operand has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 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-06-27 17:19:30,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:19:30,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:19:30,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:19:36,747 INFO L124 PetriNetUnfolderBase]: 427/760 cut-off events. [2024-06-27 17:19:36,747 INFO L125 PetriNetUnfolderBase]: For 2145/2145 co-relation queries the response was YES. [2024-06-27 17:19:36,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3548 conditions, 760 events. 427/760 cut-off events. For 2145/2145 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3193 event pairs, 44 based on Foata normal form. 3/763 useless extension candidates. Maximal degree in co-relation 3383. Up to 345 conditions per place. [2024-06-27 17:19:36,753 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 86 selfloop transitions, 8 changer transitions 96/191 dead transitions. [2024-06-27 17:19:36,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 191 transitions, 1933 flow [2024-06-27 17:19:36,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:19:36,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:19:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2024-06-27 17:19:36,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49375 [2024-06-27 17:19:36,754 INFO L175 Difference]: Start difference. First operand has 65 places, 89 transitions, 736 flow. Second operand 8 states and 79 transitions. [2024-06-27 17:19:36,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 191 transitions, 1933 flow [2024-06-27 17:19:36,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 191 transitions, 1853 flow, removed 34 selfloop flow, removed 2 redundant places. [2024-06-27 17:19:36,762 INFO L231 Difference]: Finished difference. Result has 72 places, 90 transitions, 732 flow [2024-06-27 17:19:36,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=732, PETRI_PLACES=72, PETRI_TRANSITIONS=90} [2024-06-27 17:19:36,763 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 51 predicate places. [2024-06-27 17:19:36,763 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 90 transitions, 732 flow [2024-06-27 17:19:36,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 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-06-27 17:19:36,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:19:36,763 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:19:36,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-06-27 17:19:36,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:19:36,968 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:19:36,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:19:36,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2024840239, now seen corresponding path program 6 times [2024-06-27 17:19:36,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:19:36,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749813291] [2024-06-27 17:19:36,969 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 17:19:36,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:19:36,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:19:36,970 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:19:36,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-06-27 17:19:37,053 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-06-27 17:19:37,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:19:37,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 17:19:37,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:19:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 17:19:37,145 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:19:37,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:19:37,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749813291] [2024-06-27 17:19:37,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749813291] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:19:37,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:19:37,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:19:37,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294510138] [2024-06-27 17:19:37,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:19:37,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:19:37,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:19:37,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:19:37,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:19:37,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:19:37,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 90 transitions, 732 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-06-27 17:19:37,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:19:37,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:19:37,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:19:37,364 INFO L124 PetriNetUnfolderBase]: 221/402 cut-off events. [2024-06-27 17:19:37,364 INFO L125 PetriNetUnfolderBase]: For 1337/1337 co-relation queries the response was YES. [2024-06-27 17:19:37,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1827 conditions, 402 events. 221/402 cut-off events. For 1337/1337 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1416 event pairs, 57 based on Foata normal form. 26/427 useless extension candidates. Maximal degree in co-relation 1796. Up to 246 conditions per place. [2024-06-27 17:19:37,367 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 56 selfloop transitions, 48 changer transitions 0/105 dead transitions. [2024-06-27 17:19:37,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 105 transitions, 1029 flow [2024-06-27 17:19:37,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:19:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:19:37,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2024-06-27 17:19:37,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46 [2024-06-27 17:19:37,369 INFO L175 Difference]: Start difference. First operand has 72 places, 90 transitions, 732 flow. Second operand 5 states and 46 transitions. [2024-06-27 17:19:37,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 105 transitions, 1029 flow [2024-06-27 17:19:37,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 105 transitions, 955 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-27 17:19:37,375 INFO L231 Difference]: Finished difference. Result has 66 places, 92 transitions, 868 flow [2024-06-27 17:19:37,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=868, PETRI_PLACES=66, PETRI_TRANSITIONS=92} [2024-06-27 17:19:37,375 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 45 predicate places. [2024-06-27 17:19:37,375 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 92 transitions, 868 flow [2024-06-27 17:19:37,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-06-27 17:19:37,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:19:37,376 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:19:37,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-06-27 17:19:37,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:19:37,579 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:19:37,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:19:37,580 INFO L85 PathProgramCache]: Analyzing trace with hash 725889167, now seen corresponding path program 7 times [2024-06-27 17:19:37,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:19:37,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863923170] [2024-06-27 17:19:37,581 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-06-27 17:19:37,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:19:37,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:19:37,582 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:19:37,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-06-27 17:19:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:19:37,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-27 17:19:37,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:19:37,799 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 17:19:37,799 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:19:38,022 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 17:19:38,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:19:38,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863923170] [2024-06-27 17:19:38,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863923170] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:19:38,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:19:38,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2024-06-27 17:19:38,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295694006] [2024-06-27 17:19:38,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:19:38,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 17:19:38,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:19:38,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 17:19:38,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-06-27 17:19:38,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:19:38,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 92 transitions, 868 flow. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 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-06-27 17:19:38,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:19:38,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:19:38,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:19:38,888 INFO L124 PetriNetUnfolderBase]: 220/403 cut-off events. [2024-06-27 17:19:38,888 INFO L125 PetriNetUnfolderBase]: For 1601/1601 co-relation queries the response was YES. [2024-06-27 17:19:38,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 403 events. 220/403 cut-off events. For 1601/1601 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1436 event pairs, 48 based on Foata normal form. 2/405 useless extension candidates. Maximal degree in co-relation 1865. Up to 193 conditions per place. [2024-06-27 17:19:38,890 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 58 selfloop transitions, 50 changer transitions 2/111 dead transitions. [2024-06-27 17:19:38,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 111 transitions, 1174 flow [2024-06-27 17:19:38,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:19:38,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:19:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2024-06-27 17:19:38,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2024-06-27 17:19:38,892 INFO L175 Difference]: Start difference. First operand has 66 places, 92 transitions, 868 flow. Second operand 9 states and 68 transitions. [2024-06-27 17:19:38,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 111 transitions, 1174 flow [2024-06-27 17:19:38,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 111 transitions, 1130 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:19:38,897 INFO L231 Difference]: Finished difference. Result has 72 places, 93 transitions, 939 flow [2024-06-27 17:19:38,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=939, PETRI_PLACES=72, PETRI_TRANSITIONS=93} [2024-06-27 17:19:38,897 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 51 predicate places. [2024-06-27 17:19:38,897 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 93 transitions, 939 flow [2024-06-27 17:19:38,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 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-06-27 17:19:38,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:19:38,898 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:19:38,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-06-27 17:19:39,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:19:39,101 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:19:39,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:19:39,101 INFO L85 PathProgramCache]: Analyzing trace with hash -159909113, now seen corresponding path program 8 times [2024-06-27 17:19:39,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:19:39,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499343779] [2024-06-27 17:19:39,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:19:39,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:19:39,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:19:39,111 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:19:39,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-06-27 17:19:39,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:19:39,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:19:39,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-27 17:19:39,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:19:39,379 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 17:19:39,379 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:19:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 17:19:39,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:19:39,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499343779] [2024-06-27 17:19:39,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499343779] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:19:39,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:19:39,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2024-06-27 17:19:39,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163706365] [2024-06-27 17:19:39,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:19:39,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 17:19:39,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:19:39,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 17:19:39,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-06-27 17:19:39,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:19:39,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 93 transitions, 939 flow. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 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-06-27 17:19:39,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:19:39,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:19:39,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:19:40,244 INFO L124 PetriNetUnfolderBase]: 211/376 cut-off events. [2024-06-27 17:19:40,244 INFO L125 PetriNetUnfolderBase]: For 1870/1870 co-relation queries the response was YES. [2024-06-27 17:19:40,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1884 conditions, 376 events. 211/376 cut-off events. For 1870/1870 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1275 event pairs, 48 based on Foata normal form. 2/378 useless extension candidates. Maximal degree in co-relation 1846. Up to 193 conditions per place. [2024-06-27 17:19:40,247 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 56 selfloop transitions, 46 changer transitions 4/107 dead transitions. [2024-06-27 17:19:40,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 107 transitions, 1211 flow [2024-06-27 17:19:40,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:19:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:19:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2024-06-27 17:19:40,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-27 17:19:40,249 INFO L175 Difference]: Start difference. First operand has 72 places, 93 transitions, 939 flow. Second operand 8 states and 59 transitions. [2024-06-27 17:19:40,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 107 transitions, 1211 flow [2024-06-27 17:19:40,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 107 transitions, 1184 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-27 17:19:40,257 INFO L231 Difference]: Finished difference. Result has 76 places, 91 transitions, 986 flow [2024-06-27 17:19:40,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=986, PETRI_PLACES=76, PETRI_TRANSITIONS=91} [2024-06-27 17:19:40,258 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 55 predicate places. [2024-06-27 17:19:40,258 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 91 transitions, 986 flow [2024-06-27 17:19:40,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 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-06-27 17:19:40,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:19:40,259 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:19:40,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-06-27 17:19:40,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:19:40,468 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:19:40,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:19:40,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1596738952, now seen corresponding path program 1 times [2024-06-27 17:19:40,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:19:40,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402066186] [2024-06-27 17:19:40,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:19:40,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:19:40,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:19:40,470 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:19:40,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-06-27 17:19:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:19:40,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 17:19:40,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:19:46,535 WARN L293 SmtUtils]: Spent 5.09s on a formula simplification. DAG size of input: 780 DAG size of output: 204 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-27 17:19:46,535 INFO L349 Elim1Store]: treesize reduction 1224, result has 22.0 percent of original size [2024-06-27 17:19:46,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 36 new quantified variables, introduced 190 case distinctions, treesize of input 21313 treesize of output 583 Killed by 15