./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.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/popl20-more-inc-subseq.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 69f7b2e4777088b02df05d348ae0a210dcd9618a97428b10acd3ef63d9199610 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:55:41,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:55:42,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 16:55:42,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:55:42,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:55:42,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:55:42,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:55:42,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:55:42,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:55:42,064 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:55:42,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:55:42,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:55:42,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:55:42,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:55:42,066 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:55:42,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:55:42,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:55:42,067 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:55:42,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:55:42,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:55:42,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:55:42,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:55:42,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:55:42,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:55:42,069 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:55:42,069 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:55:42,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:55:42,069 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:55:42,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:55:42,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:55:42,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:55:42,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:55:42,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:55:42,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:55:42,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:55:42,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:55:42,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:55:42,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:55:42,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:55:42,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:55:42,073 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:55:42,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:55:42,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:55:42,074 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 -> 69f7b2e4777088b02df05d348ae0a210dcd9618a97428b10acd3ef63d9199610 [2024-06-27 16:55:42,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:55:42,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:55:42,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:55:42,301 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:55:42,302 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:55:42,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-06-27 16:55:43,358 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:55:43,541 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:55:43,541 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-06-27 16:55:43,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fb34afed/b9dd215a8a474e528690ace8ae2b0411/FLAG89cfb0e2a [2024-06-27 16:55:43,560 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fb34afed/b9dd215a8a474e528690ace8ae2b0411 [2024-06-27 16:55:43,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:55:43,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:55:43,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:55:43,564 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:55:43,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:55:43,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:55:43" (1/1) ... [2024-06-27 16:55:43,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@662f5912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:43, skipping insertion in model container [2024-06-27 16:55:43,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:55:43" (1/1) ... [2024-06-27 16:55:43,588 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:55:43,715 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/popl20-more-inc-subseq.wvr.c[2950,2963] [2024-06-27 16:55:43,729 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:55:43,739 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:55:43,755 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/popl20-more-inc-subseq.wvr.c[2950,2963] [2024-06-27 16:55:43,757 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:55:43,772 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:55:43,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:43 WrapperNode [2024-06-27 16:55:43,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:55:43,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:55:43,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:55:43,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:55:43,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:43" (1/1) ... [2024-06-27 16:55:43,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:43" (1/1) ... [2024-06-27 16:55:43,805 INFO L138 Inliner]: procedures = 23, calls = 35, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 187 [2024-06-27 16:55:43,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:55:43,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:55:43,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:55:43,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:55:43,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:43" (1/1) ... [2024-06-27 16:55:43,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:43" (1/1) ... [2024-06-27 16:55:43,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:43" (1/1) ... [2024-06-27 16:55:43,834 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-06-27 16:55:43,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:43" (1/1) ... [2024-06-27 16:55:43,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:43" (1/1) ... [2024-06-27 16:55:43,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:43" (1/1) ... [2024-06-27 16:55:43,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:43" (1/1) ... [2024-06-27 16:55:43,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:43" (1/1) ... [2024-06-27 16:55:43,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:43" (1/1) ... [2024-06-27 16:55:43,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:55:43,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:55:43,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:55:43,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:55:43,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:43" (1/1) ... [2024-06-27 16:55:43,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:55:43,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:55:43,892 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 16:55:43,897 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 16:55:43,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:55:43,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:55:43,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:55:43,970 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:55:43,970 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:55:43,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:55:43,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 16:55:43,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 16:55:43,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 16:55:43,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 16:55:43,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 16:55:43,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 16:55:43,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:55:43,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:55:43,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 16:55:43,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 16:55:43,972 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 16:55:44,066 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:55:44,068 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:55:44,281 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:55:44,284 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:55:44,494 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:55:44,494 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-27 16:55:44,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:55:44 BoogieIcfgContainer [2024-06-27 16:55:44,495 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:55:44,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:55:44,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:55:44,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:55:44,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:55:43" (1/3) ... [2024-06-27 16:55:44,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c911212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:55:44, skipping insertion in model container [2024-06-27 16:55:44,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:43" (2/3) ... [2024-06-27 16:55:44,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c911212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:55:44, skipping insertion in model container [2024-06-27 16:55:44,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:55:44" (3/3) ... [2024-06-27 16:55:44,501 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2024-06-27 16:55:44,507 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:55:44,514 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:55:44,514 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:55:44,514 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:55:44,549 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 16:55:44,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 31 transitions, 76 flow [2024-06-27 16:55:44,617 INFO L124 PetriNetUnfolderBase]: 5/29 cut-off events. [2024-06-27 16:55:44,617 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:55:44,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 29 events. 5/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2024-06-27 16:55:44,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 31 transitions, 76 flow [2024-06-27 16:55:44,624 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 28 transitions, 68 flow [2024-06-27 16:55:44,636 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:55:44,642 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;@d33fe68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:55:44,643 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 16:55:44,653 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:55:44,654 INFO L124 PetriNetUnfolderBase]: 5/27 cut-off events. [2024-06-27 16:55:44,654 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:55:44,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:44,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:44,655 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 16:55:44,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:44,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1103126271, now seen corresponding path program 1 times [2024-06-27 16:55:44,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:44,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710377197] [2024-06-27 16:55:44,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:45,105 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 16:55:45,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:45,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710377197] [2024-06-27 16:55:45,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710377197] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:55:45,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:55:45,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:55:45,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562651783] [2024-06-27 16:55:45,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:55:45,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:55:45,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:55:45,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:55:45,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:55:45,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:55:45,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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 16:55:45,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:45,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:55:45,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:45,264 INFO L124 PetriNetUnfolderBase]: 202/345 cut-off events. [2024-06-27 16:55:45,264 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-06-27 16:55:45,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 345 events. 202/345 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1377 event pairs, 51 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 651. Up to 188 conditions per place. [2024-06-27 16:55:45,268 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 31 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2024-06-27 16:55:45,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 163 flow [2024-06-27 16:55:45,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:55:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:55:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2024-06-27 16:55:45,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2024-06-27 16:55:45,278 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 68 flow. Second operand 4 states and 67 transitions. [2024-06-27 16:55:45,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 163 flow [2024-06-27 16:55:45,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 40 transitions, 153 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 16:55:45,282 INFO L231 Difference]: Finished difference. Result has 30 places, 29 transitions, 74 flow [2024-06-27 16:55:45,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=30, PETRI_TRANSITIONS=29} [2024-06-27 16:55:45,286 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2024-06-27 16:55:45,286 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 29 transitions, 74 flow [2024-06-27 16:55:45,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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 16:55:45,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:45,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:45,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:55:45,287 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 16:55:45,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:45,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1933867166, now seen corresponding path program 1 times [2024-06-27 16:55:45,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:45,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196547704] [2024-06-27 16:55:45,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:45,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:45,393 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 16:55:45,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:45,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196547704] [2024-06-27 16:55:45,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196547704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:55:45,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:55:45,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:55:45,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977716727] [2024-06-27 16:55:45,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:55:45,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:55:45,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:55:45,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:55:45,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:55:45,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:55:45,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 29 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 16:55:45,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:45,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:55:45,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:45,487 INFO L124 PetriNetUnfolderBase]: 202/370 cut-off events. [2024-06-27 16:55:45,487 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-06-27 16:55:45,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 370 events. 202/370 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1558 event pairs, 126 based on Foata normal form. 1/335 useless extension candidates. Maximal degree in co-relation 285. Up to 320 conditions per place. [2024-06-27 16:55:45,492 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 22 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2024-06-27 16:55:45,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 124 flow [2024-06-27 16:55:45,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:55:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:55:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-06-27 16:55:45,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2024-06-27 16:55:45,495 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 74 flow. Second operand 3 states and 48 transitions. [2024-06-27 16:55:45,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 124 flow [2024-06-27 16:55:45,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:55:45,498 INFO L231 Difference]: Finished difference. Result has 31 places, 30 transitions, 82 flow [2024-06-27 16:55:45,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=31, PETRI_TRANSITIONS=30} [2024-06-27 16:55:45,499 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-27 16:55:45,499 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 82 flow [2024-06-27 16:55:45,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 16:55:45,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:45,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:45,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 16:55:45,501 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 16:55:45,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:45,502 INFO L85 PathProgramCache]: Analyzing trace with hash -720044749, now seen corresponding path program 1 times [2024-06-27 16:55:45,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:45,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92638705] [2024-06-27 16:55:45,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:45,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:45,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:55:45,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:45,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92638705] [2024-06-27 16:55:45,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92638705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:55:45,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:55:45,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:55:45,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795494058] [2024-06-27 16:55:45,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:55:45,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:55:45,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:55:45,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:55:45,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:55:45,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:55:45,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:45,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:45,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:55:45,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:45,697 INFO L124 PetriNetUnfolderBase]: 257/478 cut-off events. [2024-06-27 16:55:45,697 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-06-27 16:55:45,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 478 events. 257/478 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2116 event pairs, 94 based on Foata normal form. 1/437 useless extension candidates. Maximal degree in co-relation 951. Up to 216 conditions per place. [2024-06-27 16:55:45,700 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 34 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2024-06-27 16:55:45,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 194 flow [2024-06-27 16:55:45,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:55:45,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:55:45,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-06-27 16:55:45,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2024-06-27 16:55:45,703 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 82 flow. Second operand 3 states and 60 transitions. [2024-06-27 16:55:45,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 194 flow [2024-06-27 16:55:45,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 190 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 16:55:45,705 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 90 flow [2024-06-27 16:55:45,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2024-06-27 16:55:45,707 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2024-06-27 16:55:45,707 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 90 flow [2024-06-27 16:55:45,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:45,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:45,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:45,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 16:55:45,708 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 16:55:45,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:45,709 INFO L85 PathProgramCache]: Analyzing trace with hash 859726172, now seen corresponding path program 1 times [2024-06-27 16:55:45,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:45,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996436587] [2024-06-27 16:55:45,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:45,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:55:45,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:45,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996436587] [2024-06-27 16:55:45,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996436587] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:55:45,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:55:45,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:55:45,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471051412] [2024-06-27 16:55:45,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:55:45,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:55:45,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:55:45,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:55:45,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:55:45,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:55:45,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:45,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:45,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:55:45,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:45,858 INFO L124 PetriNetUnfolderBase]: 250/472 cut-off events. [2024-06-27 16:55:45,859 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-06-27 16:55:45,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 472 events. 250/472 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2061 event pairs, 102 based on Foata normal form. 11/450 useless extension candidates. Maximal degree in co-relation 1022. Up to 314 conditions per place. [2024-06-27 16:55:45,862 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 32 selfloop transitions, 2 changer transitions 4/44 dead transitions. [2024-06-27 16:55:45,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 44 transitions, 201 flow [2024-06-27 16:55:45,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:55:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:55:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-06-27 16:55:45,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6344086021505376 [2024-06-27 16:55:45,864 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 90 flow. Second operand 3 states and 59 transitions. [2024-06-27 16:55:45,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 44 transitions, 201 flow [2024-06-27 16:55:45,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 44 transitions, 199 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:55:45,866 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 100 flow [2024-06-27 16:55:45,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2024-06-27 16:55:45,867 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2024-06-27 16:55:45,867 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 100 flow [2024-06-27 16:55:45,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:45,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:45,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:45,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 16:55:45,868 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 16:55:45,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:45,868 INFO L85 PathProgramCache]: Analyzing trace with hash 2141843345, now seen corresponding path program 1 times [2024-06-27 16:55:45,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:45,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783779977] [2024-06-27 16:55:45,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:45,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:55:45,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:45,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783779977] [2024-06-27 16:55:45,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783779977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:55:45,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:55:45,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:55:45,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890448461] [2024-06-27 16:55:45,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:55:45,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:55:45,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:55:45,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:55:45,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:55:45,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:55:45,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 16:55:45,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:45,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:55:45,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:46,021 INFO L124 PetriNetUnfolderBase]: 307/599 cut-off events. [2024-06-27 16:55:46,021 INFO L125 PetriNetUnfolderBase]: For 73/80 co-relation queries the response was YES. [2024-06-27 16:55:46,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 599 events. 307/599 cut-off events. For 73/80 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2846 event pairs, 247 based on Foata normal form. 12/564 useless extension candidates. Maximal degree in co-relation 1079. Up to 433 conditions per place. [2024-06-27 16:55:46,023 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 25 selfloop transitions, 2 changer transitions 17/50 dead transitions. [2024-06-27 16:55:46,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 50 transitions, 242 flow [2024-06-27 16:55:46,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:55:46,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:55:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2024-06-27 16:55:46,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5725806451612904 [2024-06-27 16:55:46,025 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 100 flow. Second operand 4 states and 71 transitions. [2024-06-27 16:55:46,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 50 transitions, 242 flow [2024-06-27 16:55:46,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:55:46,026 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 112 flow [2024-06-27 16:55:46,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2024-06-27 16:55:46,027 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-27 16:55:46,027 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 112 flow [2024-06-27 16:55:46,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 16:55:46,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:46,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:46,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 16:55:46,028 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 16:55:46,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:46,028 INFO L85 PathProgramCache]: Analyzing trace with hash 812735461, now seen corresponding path program 1 times [2024-06-27 16:55:46,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:46,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314993763] [2024-06-27 16:55:46,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:46,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:55:46,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:46,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314993763] [2024-06-27 16:55:46,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314993763] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:55:46,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729638190] [2024-06-27 16:55:46,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:46,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:55:46,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:55:46,676 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 16:55:46,692 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 16:55:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:46,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 27 conjunts are in the unsatisfiable core [2024-06-27 16:55:46,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:47,262 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-06-27 16:55:47,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2024-06-27 16:55:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:55:47,282 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:55:47,716 INFO L349 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2024-06-27 16:55:47,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 99 [2024-06-27 16:55:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:55:47,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729638190] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:55:47,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:55:47,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 30 [2024-06-27 16:55:47,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841608814] [2024-06-27 16:55:47,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:55:47,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-06-27 16:55:47,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:55:47,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-06-27 16:55:47,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2024-06-27 16:55:48,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-27 16:55:48,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 112 flow. Second operand has 31 states, 31 states have (on average 7.290322580645161) internal successors, (226), 31 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:48,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:48,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-27 16:55:48,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:51,546 INFO L124 PetriNetUnfolderBase]: 1209/2051 cut-off events. [2024-06-27 16:55:51,546 INFO L125 PetriNetUnfolderBase]: For 347/347 co-relation queries the response was YES. [2024-06-27 16:55:51,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4846 conditions, 2051 events. 1209/2051 cut-off events. For 347/347 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 9779 event pairs, 107 based on Foata normal form. 3/1791 useless extension candidates. Maximal degree in co-relation 4828. Up to 349 conditions per place. [2024-06-27 16:55:51,554 INFO L140 encePairwiseOnDemand]: 16/31 looper letters, 200 selfloop transitions, 78 changer transitions 85/366 dead transitions. [2024-06-27 16:55:51,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 366 transitions, 1772 flow [2024-06-27 16:55:51,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-06-27 16:55:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2024-06-27 16:55:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 602 transitions. [2024-06-27 16:55:51,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38077166350411135 [2024-06-27 16:55:51,559 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 112 flow. Second operand 51 states and 602 transitions. [2024-06-27 16:55:51,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 366 transitions, 1772 flow [2024-06-27 16:55:51,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 366 transitions, 1762 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 16:55:51,566 INFO L231 Difference]: Finished difference. Result has 117 places, 111 transitions, 751 flow [2024-06-27 16:55:51,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=751, PETRI_PLACES=117, PETRI_TRANSITIONS=111} [2024-06-27 16:55:51,569 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 87 predicate places. [2024-06-27 16:55:51,569 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 111 transitions, 751 flow [2024-06-27 16:55:51,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.290322580645161) internal successors, (226), 31 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:51,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:51,570 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:51,582 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 16:55:51,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-06-27 16:55:51,780 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 16:55:51,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:51,781 INFO L85 PathProgramCache]: Analyzing trace with hash -729647344, now seen corresponding path program 2 times [2024-06-27 16:55:51,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:51,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959197018] [2024-06-27 16:55:51,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:51,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:55:51,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:51,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959197018] [2024-06-27 16:55:51,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959197018] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:55:51,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127390851] [2024-06-27 16:55:51,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:55:51,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:55:51,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:55:51,857 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 16:55:51,884 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 16:55:51,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:55:51,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:55:51,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 16:55:51,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:55:51,978 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:55:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:55:52,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127390851] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:55:52,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:55:52,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2024-06-27 16:55:52,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769446869] [2024-06-27 16:55:52,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:55:52,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 16:55:52,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:55:52,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 16:55:52,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 16:55:52,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:55:52,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 111 transitions, 751 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:52,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:52,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:55:52,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:52,309 INFO L124 PetriNetUnfolderBase]: 987/1917 cut-off events. [2024-06-27 16:55:52,309 INFO L125 PetriNetUnfolderBase]: For 10960/11071 co-relation queries the response was YES. [2024-06-27 16:55:52,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8592 conditions, 1917 events. 987/1917 cut-off events. For 10960/11071 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 9870 event pairs, 241 based on Foata normal form. 47/1882 useless extension candidates. Maximal degree in co-relation 8518. Up to 697 conditions per place. [2024-06-27 16:55:52,322 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 144 selfloop transitions, 31 changer transitions 0/186 dead transitions. [2024-06-27 16:55:52,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 186 transitions, 1663 flow [2024-06-27 16:55:52,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:55:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:55:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-06-27 16:55:52,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6935483870967742 [2024-06-27 16:55:52,324 INFO L175 Difference]: Start difference. First operand has 117 places, 111 transitions, 751 flow. Second operand 4 states and 86 transitions. [2024-06-27 16:55:52,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 186 transitions, 1663 flow [2024-06-27 16:55:52,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 186 transitions, 1403 flow, removed 121 selfloop flow, removed 15 redundant places. [2024-06-27 16:55:52,349 INFO L231 Difference]: Finished difference. Result has 95 places, 136 transitions, 897 flow [2024-06-27 16:55:52,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=897, PETRI_PLACES=95, PETRI_TRANSITIONS=136} [2024-06-27 16:55:52,350 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 65 predicate places. [2024-06-27 16:55:52,350 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 136 transitions, 897 flow [2024-06-27 16:55:52,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:52,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:52,351 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:52,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-27 16:55:52,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-06-27 16:55:52,563 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 16:55:52,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:52,568 INFO L85 PathProgramCache]: Analyzing trace with hash -979768174, now seen corresponding path program 3 times [2024-06-27 16:55:52,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:52,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693876726] [2024-06-27 16:55:52,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:52,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:55:52,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:52,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693876726] [2024-06-27 16:55:52,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693876726] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:55:52,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058625360] [2024-06-27 16:55:52,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:55:52,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:55:52,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:55:52,701 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 16:55:52,726 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 16:55:52,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-06-27 16:55:52,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:55:52,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 16:55:52,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:52,862 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:55:52,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:55:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:55:52,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058625360] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:55:52,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:55:52,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-06-27 16:55:52,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401075622] [2024-06-27 16:55:52,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:55:52,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-06-27 16:55:52,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:55:52,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-06-27 16:55:52,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-06-27 16:55:52,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:55:52,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 136 transitions, 897 flow. Second operand has 15 states, 15 states have (on average 12.133333333333333) internal successors, (182), 15 states have internal predecessors, (182), 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 16:55:52,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:52,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:55:52,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:53,397 INFO L124 PetriNetUnfolderBase]: 861/1832 cut-off events. [2024-06-27 16:55:53,397 INFO L125 PetriNetUnfolderBase]: For 6097/6191 co-relation queries the response was YES. [2024-06-27 16:55:53,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7131 conditions, 1832 events. 861/1832 cut-off events. For 6097/6191 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 10131 event pairs, 394 based on Foata normal form. 58/1819 useless extension candidates. Maximal degree in co-relation 4373. Up to 757 conditions per place. [2024-06-27 16:55:53,407 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 57 selfloop transitions, 8 changer transitions 138/209 dead transitions. [2024-06-27 16:55:53,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 209 transitions, 1669 flow [2024-06-27 16:55:53,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-06-27 16:55:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-06-27 16:55:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 281 transitions. [2024-06-27 16:55:53,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4532258064516129 [2024-06-27 16:55:53,409 INFO L175 Difference]: Start difference. First operand has 95 places, 136 transitions, 897 flow. Second operand 20 states and 281 transitions. [2024-06-27 16:55:53,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 209 transitions, 1669 flow [2024-06-27 16:55:53,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 209 transitions, 1631 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-27 16:55:53,421 INFO L231 Difference]: Finished difference. Result has 111 places, 59 transitions, 378 flow [2024-06-27 16:55:53,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=378, PETRI_PLACES=111, PETRI_TRANSITIONS=59} [2024-06-27 16:55:53,422 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 81 predicate places. [2024-06-27 16:55:53,422 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 59 transitions, 378 flow [2024-06-27 16:55:53,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.133333333333333) internal successors, (182), 15 states have internal predecessors, (182), 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 16:55:53,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:53,423 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:53,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-27 16:55:53,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:55:53,635 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 16:55:53,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:53,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1294955623, now seen corresponding path program 4 times [2024-06-27 16:55:53,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:53,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040032600] [2024-06-27 16:55:53,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:53,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:55:54,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:54,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040032600] [2024-06-27 16:55:54,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040032600] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:55:54,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052701473] [2024-06-27 16:55:54,835 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 16:55:54,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:55:54,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:55:54,836 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:55:54,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-27 16:55:54,916 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 16:55:54,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:55:54,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 55 conjunts are in the unsatisfiable core [2024-06-27 16:55:54,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:54,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-06-27 16:55:55,005 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 23 treesize of output 1 [2024-06-27 16:55:55,048 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-06-27 16:55:55,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-06-27 16:55:55,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-27 16:55:55,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-27 16:55:55,879 INFO L349 Elim1Store]: treesize reduction 89, result has 35.5 percent of original size [2024-06-27 16:55:55,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 64 [2024-06-27 16:55:55,952 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:55:55,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:56:03,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:56:03,230 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 113 [2024-06-27 16:56:03,420 INFO L349 Elim1Store]: treesize reduction 20, result has 90.4 percent of original size [2024-06-27 16:56:03,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 337 treesize of output 420 [2024-06-27 16:56:03,452 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 16:56:03,460 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 16:56:03,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:56:03,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 219 treesize of output 307 [2024-06-27 16:56:32,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:56:32,653 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 118 [2024-06-27 16:56:32,787 INFO L349 Elim1Store]: treesize reduction 16, result has 92.3 percent of original size [2024-06-27 16:56:32,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 297 treesize of output 390 [2024-06-27 16:56:32,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 16:56:32,819 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 16:56:32,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:56:32,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 182 treesize of output 275 [2024-06-27 16:56:59,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:56:59,113 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 118 [2024-06-27 16:56:59,253 INFO L349 Elim1Store]: treesize reduction 8, result has 96.1 percent of original size [2024-06-27 16:56:59,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 297 treesize of output 398 [2024-06-27 16:56:59,283 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 16:56:59,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:56:59,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 182 treesize of output 283 [2024-06-27 16:57:36,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:57:36,357 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 113 [2024-06-27 16:57:36,500 INFO L349 Elim1Store]: treesize reduction 12, result has 94.2 percent of original size [2024-06-27 16:57:36,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 337 treesize of output 428 [2024-06-27 16:57:36,548 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 16:57:36,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:57:36,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 219 treesize of output 315 [2024-06-27 16:58:28,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:58:28,971 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 90 [2024-06-27 16:58:29,028 INFO L349 Elim1Store]: treesize reduction 8, result has 91.4 percent of original size [2024-06-27 16:58:29,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 248 treesize of output 252 [2024-06-27 16:58:29,043 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 16:58:29,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:58:29,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 162 treesize of output 174 [2024-06-27 16:58:29,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:58:29,971 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 90 [2024-06-27 16:58:30,043 INFO L349 Elim1Store]: treesize reduction 8, result has 91.4 percent of original size [2024-06-27 16:58:30,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 248 treesize of output 252 [2024-06-27 16:58:30,054 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 16:58:30,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:58:30,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 162 treesize of output 174 [2024-06-27 16:58:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:58:31,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052701473] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:58:31,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:58:31,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 52 [2024-06-27 16:58:31,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12017105] [2024-06-27 16:58:31,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:58:31,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-06-27 16:58:31,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:58:31,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-06-27 16:58:31,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=2406, Unknown=7, NotChecked=0, Total=2756 [2024-06-27 16:58:31,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-27 16:58:31,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 59 transitions, 378 flow. Second operand has 53 states, 53 states have (on average 6.9245283018867925) internal successors, (367), 53 states have internal predecessors, (367), 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 16:58:31,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:58:31,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-27 16:58:31,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:58:44,123 INFO L124 PetriNetUnfolderBase]: 2210/3855 cut-off events. [2024-06-27 16:58:44,124 INFO L125 PetriNetUnfolderBase]: For 15486/15486 co-relation queries the response was YES. [2024-06-27 16:58:44,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15910 conditions, 3855 events. 2210/3855 cut-off events. For 15486/15486 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 20607 event pairs, 325 based on Foata normal form. 122/3758 useless extension candidates. Maximal degree in co-relation 15867. Up to 978 conditions per place. [2024-06-27 16:58:44,148 INFO L140 encePairwiseOnDemand]: 12/31 looper letters, 209 selfloop transitions, 79 changer transitions 103/394 dead transitions. [2024-06-27 16:58:44,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 394 transitions, 3156 flow [2024-06-27 16:58:44,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-06-27 16:58:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2024-06-27 16:58:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 633 transitions. [2024-06-27 16:58:44,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3781362007168459 [2024-06-27 16:58:44,151 INFO L175 Difference]: Start difference. First operand has 111 places, 59 transitions, 378 flow. Second operand 54 states and 633 transitions. [2024-06-27 16:58:44,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 394 transitions, 3156 flow [2024-06-27 16:58:44,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 394 transitions, 2577 flow, removed 285 selfloop flow, removed 21 redundant places. [2024-06-27 16:58:44,172 INFO L231 Difference]: Finished difference. Result has 151 places, 139 transitions, 1313 flow [2024-06-27 16:58:44,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=1313, PETRI_PLACES=151, PETRI_TRANSITIONS=139} [2024-06-27 16:58:44,172 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 121 predicate places. [2024-06-27 16:58:44,173 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 139 transitions, 1313 flow [2024-06-27 16:58:44,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 6.9245283018867925) internal successors, (367), 53 states have internal predecessors, (367), 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 16:58:44,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:58:44,173 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:58:44,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-06-27 16:58:44,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:58:44,379 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 16:58:44,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:58:44,379 INFO L85 PathProgramCache]: Analyzing trace with hash -220225461, now seen corresponding path program 5 times [2024-06-27 16:58:44,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:58:44,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772147522] [2024-06-27 16:58:44,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:58:44,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:58:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:58:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:58:45,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:58:45,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772147522] [2024-06-27 16:58:45,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772147522] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:58:45,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890727049] [2024-06-27 16:58:45,570 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 16:58:45,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:58:45,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:58:45,571 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:58:45,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-06-27 16:58:45,672 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-06-27 16:58:45,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:58:45,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 45 conjunts are in the unsatisfiable core [2024-06-27 16:58:45,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:58:46,436 INFO L349 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2024-06-27 16:58:46,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 50 [2024-06-27 16:58:46,498 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:58:46,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:58:48,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:58:48,182 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 12 new quantified variables, introduced 66 case distinctions, treesize of input 199 treesize of output 1015 [2024-06-27 16:59:09,807 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 16:59:09,808 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 16:59:09,809 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-06-27 16:59:09,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-06-27 16:59:10,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-06-27 16:59:10,022 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:140) 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.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.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) ... 68 more [2024-06-27 16:59:10,027 INFO L158 Benchmark]: Toolchain (without parser) took 206463.72ms. Allocated memory was 140.5MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 105.3MB in the beginning and 1.1GB in the end (delta: -991.6MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-06-27 16:59:10,027 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 72.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 16:59:10,027 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.65ms. Allocated memory is still 140.5MB. Free memory was 105.3MB in the beginning and 92.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-06-27 16:59:10,027 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.87ms. Allocated memory is still 140.5MB. Free memory was 91.9MB in the beginning and 89.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 16:59:10,028 INFO L158 Benchmark]: Boogie Preprocessor took 39.54ms. Allocated memory is still 140.5MB. Free memory was 89.8MB in the beginning and 87.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 16:59:10,028 INFO L158 Benchmark]: RCFGBuilder took 648.60ms. Allocated memory is still 140.5MB. Free memory was 87.7MB in the beginning and 104.4MB in the end (delta: -16.7MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2024-06-27 16:59:10,028 INFO L158 Benchmark]: TraceAbstraction took 205529.97ms. Allocated memory was 140.5MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 103.5MB in the beginning and 1.1GB in the end (delta: -993.4MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-06-27 16:59:10,030 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.14ms. Allocated memory is still 111.1MB. Free memory is still 72.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.65ms. Allocated memory is still 140.5MB. Free memory was 105.3MB in the beginning and 92.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.87ms. Allocated memory is still 140.5MB. Free memory was 91.9MB in the beginning and 89.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.54ms. Allocated memory is still 140.5MB. Free memory was 89.8MB in the beginning and 87.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 648.60ms. Allocated memory is still 140.5MB. Free memory was 87.7MB in the beginning and 104.4MB in the end (delta: -16.7MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. * TraceAbstraction took 205529.97ms. Allocated memory was 140.5MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 103.5MB in the beginning and 1.1GB in the end (delta: -993.4MB). Peak memory consumption was 1.0GB. 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/popl20-more-inc-subseq.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 69f7b2e4777088b02df05d348ae0a210dcd9618a97428b10acd3ef63d9199610 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:59:11,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:59:11,949 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-06-27 16:59:11,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:59:11,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:59:11,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:59:11,984 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:59:11,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:59:11,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:59:11,988 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:59:11,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:59:11,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:59:11,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:59:11,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:59:11,990 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:59:11,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:59:11,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:59:11,991 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:59:11,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:59:11,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:59:11,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:59:11,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:59:11,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:59:11,992 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-06-27 16:59:11,992 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-06-27 16:59:11,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:59:11,992 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-06-27 16:59:11,992 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:59:11,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:59:11,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:59:11,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:59:11,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:59:11,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:59:11,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:59:11,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:59:11,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:59:11,995 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:59:11,995 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:59:11,995 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-06-27 16:59:11,995 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-06-27 16:59:11,995 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:59:11,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:59:11,995 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:59:11,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:59:11,996 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:59:11,996 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-06-27 16:59:11,996 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 -> 69f7b2e4777088b02df05d348ae0a210dcd9618a97428b10acd3ef63d9199610 [2024-06-27 16:59:12,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:59:12,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:59:12,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:59:12,320 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:59:12,321 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:59:12,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-06-27 16:59:13,442 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:59:13,630 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:59:13,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-06-27 16:59:13,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b825453dd/835549387c4d4459bf30064e07fa6dec/FLAG472f7df37 [2024-06-27 16:59:13,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b825453dd/835549387c4d4459bf30064e07fa6dec [2024-06-27 16:59:13,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:59:13,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:59:13,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:59:13,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:59:13,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:59:13,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:59:13" (1/1) ... [2024-06-27 16:59:13,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7504fcc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:13, skipping insertion in model container [2024-06-27 16:59:13,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:59:13" (1/1) ... [2024-06-27 16:59:13,685 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:59:13,854 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/popl20-more-inc-subseq.wvr.c[2950,2963] [2024-06-27 16:59:13,868 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:59:13,888 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-06-27 16:59:13,890 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:59:13,913 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/popl20-more-inc-subseq.wvr.c[2950,2963] [2024-06-27 16:59:13,915 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:59:13,919 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:59:13,955 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/popl20-more-inc-subseq.wvr.c[2950,2963] [2024-06-27 16:59:13,957 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:59:13,977 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:59:13,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:13 WrapperNode [2024-06-27 16:59:13,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:59:13,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:59:13,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:59:13,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:59:13,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:13" (1/1) ... [2024-06-27 16:59:14,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:13" (1/1) ... [2024-06-27 16:59:14,031 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 182 [2024-06-27 16:59:14,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:59:14,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:59:14,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:59:14,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:59:14,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:13" (1/1) ... [2024-06-27 16:59:14,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:13" (1/1) ... [2024-06-27 16:59:14,055 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:13" (1/1) ... [2024-06-27 16:59:14,079 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-06-27 16:59:14,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:13" (1/1) ... [2024-06-27 16:59:14,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:13" (1/1) ... [2024-06-27 16:59:14,086 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:13" (1/1) ... [2024-06-27 16:59:14,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:13" (1/1) ... [2024-06-27 16:59:14,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:13" (1/1) ... [2024-06-27 16:59:14,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:13" (1/1) ... [2024-06-27 16:59:14,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:59:14,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:59:14,099 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:59:14,100 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:59:14,100 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:13" (1/1) ... [2024-06-27 16:59:14,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:59:14,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:59:14,137 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 16:59:14,155 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 16:59:14,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:59:14,224 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:59:14,224 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:59:14,224 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:59:14,225 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:59:14,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-06-27 16:59:14,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-06-27 16:59:14,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 16:59:14,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 16:59:14,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 16:59:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-06-27 16:59:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-06-27 16:59:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:59:14,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:59:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-06-27 16:59:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-06-27 16:59:14,228 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 16:59:14,344 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:59:14,346 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:59:14,683 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:59:14,683 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:59:14,946 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:59:14,947 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-27 16:59:14,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:59:14 BoogieIcfgContainer [2024-06-27 16:59:14,947 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:59:14,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:59:14,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:59:14,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:59:14,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:59:13" (1/3) ... [2024-06-27 16:59:14,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5534a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:59:14, skipping insertion in model container [2024-06-27 16:59:14,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:13" (2/3) ... [2024-06-27 16:59:14,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5534a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:59:14, skipping insertion in model container [2024-06-27 16:59:14,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:59:14" (3/3) ... [2024-06-27 16:59:14,955 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2024-06-27 16:59:14,962 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:59:14,978 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:59:14,978 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:59:14,979 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:59:15,026 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 16:59:15,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 31 transitions, 76 flow [2024-06-27 16:59:15,073 INFO L124 PetriNetUnfolderBase]: 5/29 cut-off events. [2024-06-27 16:59:15,073 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:59:15,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 29 events. 5/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2024-06-27 16:59:15,076 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 31 transitions, 76 flow [2024-06-27 16:59:15,078 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 28 transitions, 68 flow [2024-06-27 16:59:15,084 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:59:15,089 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;@468454bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:59:15,089 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 16:59:15,095 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:59:15,096 INFO L124 PetriNetUnfolderBase]: 5/27 cut-off events. [2024-06-27 16:59:15,096 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:59:15,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:15,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:15,097 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 16:59:15,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:15,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1554229503, now seen corresponding path program 1 times [2024-06-27 16:59:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:59:15,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104259961] [2024-06-27 16:59:15,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:15,110 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 16:59:15,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:59:15,112 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 16:59:15,143 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 16:59:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:15,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2024-06-27 16:59:15,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:15,239 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 16:59:15,239 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:59:15,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:59:15,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104259961] [2024-06-27 16:59:15,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104259961] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:59:15,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:59:15,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:59:15,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270983059] [2024-06-27 16:59:15,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:59:15,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:59:15,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:59:15,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:59:15,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:59:15,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:59:15,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 16:59:15,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:15,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:59:15,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:15,369 INFO L124 PetriNetUnfolderBase]: 175/325 cut-off events. [2024-06-27 16:59:15,369 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-06-27 16:59:15,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 325 events. 175/325 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1295 event pairs, 57 based on Foata normal form. 1/267 useless extension candidates. Maximal degree in co-relation 578. Up to 144 conditions per place. [2024-06-27 16:59:15,372 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 31 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2024-06-27 16:59:15,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 170 flow [2024-06-27 16:59:15,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:59:15,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:59:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-06-27 16:59:15,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2024-06-27 16:59:15,382 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 68 flow. Second operand 3 states and 60 transitions. [2024-06-27 16:59:15,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 170 flow [2024-06-27 16:59:15,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 41 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 16:59:15,386 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 72 flow [2024-06-27 16:59:15,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2024-06-27 16:59:15,390 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2024-06-27 16:59:15,390 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 72 flow [2024-06-27 16:59:15,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 16:59:15,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:15,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:15,396 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 16:59:15,592 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 16:59:15,593 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 16:59:15,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:15,593 INFO L85 PathProgramCache]: Analyzing trace with hash -850459484, now seen corresponding path program 1 times [2024-06-27 16:59:15,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:59:15,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983281000] [2024-06-27 16:59:15,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:15,594 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 16:59:15,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:59:15,595 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 16:59:15,640 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 16:59:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:15,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 16:59:15,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:15,797 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:59:15,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:59:15,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983281000] [2024-06-27 16:59:15,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983281000] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:59:15,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:59:15,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:59:15,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998705834] [2024-06-27 16:59:15,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:59:15,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:59:15,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:59:15,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:59:15,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 16:59:15,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-27 16:59:15,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:15,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:15,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-27 16:59:15,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:16,017 INFO L124 PetriNetUnfolderBase]: 322/541 cut-off events. [2024-06-27 16:59:16,017 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-06-27 16:59:16,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1136 conditions, 541 events. 322/541 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1878 event pairs, 92 based on Foata normal form. 13/439 useless extension candidates. Maximal degree in co-relation 718. Up to 307 conditions per place. [2024-06-27 16:59:16,020 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 42 selfloop transitions, 3 changer transitions 20/68 dead transitions. [2024-06-27 16:59:16,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 68 transitions, 286 flow [2024-06-27 16:59:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 16:59:16,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 16:59:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-06-27 16:59:16,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4700460829493088 [2024-06-27 16:59:16,027 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 72 flow. Second operand 7 states and 102 transitions. [2024-06-27 16:59:16,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 68 transitions, 286 flow [2024-06-27 16:59:16,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 68 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:59:16,031 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 96 flow [2024-06-27 16:59:16,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=96, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-27 16:59:16,036 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2024-06-27 16:59:16,037 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 96 flow [2024-06-27 16:59:16,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:59:16,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:16,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:16,043 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 16:59:16,240 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 16:59:16,241 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 16:59:16,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:16,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1396031472, now seen corresponding path program 1 times [2024-06-27 16:59:16,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:59:16,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343261679] [2024-06-27 16:59:16,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:16,242 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 16:59:16,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:59:16,243 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 16:59:16,244 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 16:59:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:16,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 16:59:16,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:16,380 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:59:16,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:59:16,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343261679] [2024-06-27 16:59:16,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343261679] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:59:16,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:59:16,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:59:16,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399959615] [2024-06-27 16:59:16,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:59:16,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:59:16,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:59:16,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:59:16,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:59:16,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:59:16,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 16:59:16,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:16,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:59:16,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:16,521 INFO L124 PetriNetUnfolderBase]: 177/353 cut-off events. [2024-06-27 16:59:16,521 INFO L125 PetriNetUnfolderBase]: For 169/188 co-relation queries the response was YES. [2024-06-27 16:59:16,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 353 events. 177/353 cut-off events. For 169/188 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1307 event pairs, 125 based on Foata normal form. 4/328 useless extension candidates. Maximal degree in co-relation 661. Up to 277 conditions per place. [2024-06-27 16:59:16,523 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 23 selfloop transitions, 2 changer transitions 11/42 dead transitions. [2024-06-27 16:59:16,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 194 flow [2024-06-27 16:59:16,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:59:16,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:59:16,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2024-06-27 16:59:16,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2024-06-27 16:59:16,525 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 96 flow. Second operand 4 states and 67 transitions. [2024-06-27 16:59:16,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 194 flow [2024-06-27 16:59:16,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 184 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 16:59:16,535 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 100 flow [2024-06-27 16:59:16,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2024-06-27 16:59:16,535 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-06-27 16:59:16,536 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 100 flow [2024-06-27 16:59:16,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 16:59:16,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:16,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:16,548 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 16:59:16,739 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 16:59:16,740 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 16:59:16,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:16,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1038636198, now seen corresponding path program 1 times [2024-06-27 16:59:16,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:59:16,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490972224] [2024-06-27 16:59:16,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:16,741 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 16:59:16,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:59:16,761 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 16:59:16,764 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 16:59:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:16,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 16:59:16,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:16,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:59:16,900 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:59:16,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:59:16,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490972224] [2024-06-27 16:59:16,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490972224] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:59:16,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:59:16,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:59:16,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103396223] [2024-06-27 16:59:16,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:59:16,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:59:16,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:59:16,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:59:16,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:59:16,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:59:16,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 16:59:16,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:16,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:59:16,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:17,027 INFO L124 PetriNetUnfolderBase]: 215/393 cut-off events. [2024-06-27 16:59:17,028 INFO L125 PetriNetUnfolderBase]: For 90/105 co-relation queries the response was YES. [2024-06-27 16:59:17,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 393 events. 215/393 cut-off events. For 90/105 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1574 event pairs, 35 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 936. Up to 284 conditions per place. [2024-06-27 16:59:17,029 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 35 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-06-27 16:59:17,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 220 flow [2024-06-27 16:59:17,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:59:17,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:59:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2024-06-27 16:59:17,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2024-06-27 16:59:17,033 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 100 flow. Second operand 4 states and 68 transitions. [2024-06-27 16:59:17,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 220 flow [2024-06-27 16:59:17,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 212 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 16:59:17,037 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 118 flow [2024-06-27 16:59:17,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2024-06-27 16:59:17,039 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-27 16:59:17,039 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 118 flow [2024-06-27 16:59:17,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 16:59:17,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:17,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:17,043 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 16:59:17,242 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 16:59:17,242 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 16:59:17,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:17,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1682000395, now seen corresponding path program 1 times [2024-06-27 16:59:17,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:59:17,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046527172] [2024-06-27 16:59:17,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:17,243 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 16:59:17,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:59:17,245 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 16:59:17,246 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 16:59:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:17,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-27 16:59:17,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:59:17,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:59:17,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:59:17,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046527172] [2024-06-27 16:59:17,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046527172] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:17,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:59:17,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2024-06-27 16:59:17,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732394767] [2024-06-27 16:59:17,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:17,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:59:17,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:59:17,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:59:17,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 16:59:17,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-27 16:59:17,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 16:59:17,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:17,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-27 16:59:17,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:17,614 INFO L124 PetriNetUnfolderBase]: 580/974 cut-off events. [2024-06-27 16:59:17,614 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2024-06-27 16:59:17,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2388 conditions, 974 events. 580/974 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4034 event pairs, 54 based on Foata normal form. 34/946 useless extension candidates. Maximal degree in co-relation 2363. Up to 298 conditions per place. [2024-06-27 16:59:17,618 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 59 selfloop transitions, 15 changer transitions 0/77 dead transitions. [2024-06-27 16:59:17,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 77 transitions, 401 flow [2024-06-27 16:59:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 16:59:17,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 16:59:17,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2024-06-27 16:59:17,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45622119815668205 [2024-06-27 16:59:17,620 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 118 flow. Second operand 7 states and 99 transitions. [2024-06-27 16:59:17,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 77 transitions, 401 flow [2024-06-27 16:59:17,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 77 transitions, 395 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 16:59:17,621 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 208 flow [2024-06-27 16:59:17,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=208, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2024-06-27 16:59:17,622 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2024-06-27 16:59:17,622 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 208 flow [2024-06-27 16:59:17,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 16:59:17,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:17,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:17,628 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 16:59:17,826 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 16:59:17,827 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 16:59:17,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:17,827 INFO L85 PathProgramCache]: Analyzing trace with hash -716706239, now seen corresponding path program 2 times [2024-06-27 16:59:17,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:59:17,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313138859] [2024-06-27 16:59:17,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:59:17,828 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 16:59:17,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:59:17,829 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 16:59:17,848 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 16:59:18,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:59:18,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:59:18,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 16:59:18,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:19,094 INFO L349 Elim1Store]: treesize reduction 80, result has 76.0 percent of original size [2024-06-27 16:59:19,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 174 treesize of output 286 [2024-06-27 16:59:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:59:19,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:35,373 WARN L293 SmtUtils]: Spent 7.38s on a formula simplification. DAG size of input: 394 DAG size of output: 346 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-27 16:59:35,374 INFO L349 Elim1Store]: treesize reduction 168, result has 90.0 percent of original size [2024-06-27 16:59:35,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 269 treesize of output 1571 [2024-06-27 16:59:38,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:59:38,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:59:38,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313138859] [2024-06-27 16:59:38,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313138859] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:38,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:59:38,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-06-27 16:59:38,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884616418] [2024-06-27 16:59:38,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:38,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-06-27 16:59:38,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:59:38,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-06-27 16:59:38,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=176, Unknown=2, NotChecked=0, Total=240 [2024-06-27 16:59:42,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:59:47,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:59:47,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-27 16:59:47,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 208 flow. Second operand has 16 states, 16 states have (on average 8.875) internal successors, (142), 16 states have internal predecessors, (142), 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 16:59:47,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:47,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-27 16:59:47,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:51,371 INFO L124 PetriNetUnfolderBase]: 636/1110 cut-off events. [2024-06-27 16:59:51,371 INFO L125 PetriNetUnfolderBase]: For 946/952 co-relation queries the response was YES. [2024-06-27 16:59:51,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3268 conditions, 1110 events. 636/1110 cut-off events. For 946/952 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4784 event pairs, 60 based on Foata normal form. 7/1050 useless extension candidates. Maximal degree in co-relation 3240. Up to 317 conditions per place. [2024-06-27 16:59:51,377 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 100 selfloop transitions, 11 changer transitions 4/121 dead transitions. [2024-06-27 16:59:51,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 121 transitions, 786 flow [2024-06-27 16:59:51,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 16:59:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 16:59:51,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2024-06-27 16:59:51,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2024-06-27 16:59:51,379 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 208 flow. Second operand 9 states and 132 transitions. [2024-06-27 16:59:51,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 121 transitions, 786 flow [2024-06-27 16:59:51,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 121 transitions, 786 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:59:51,384 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 292 flow [2024-06-27 16:59:51,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=292, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2024-06-27 16:59:51,386 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2024-06-27 16:59:51,386 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 292 flow [2024-06-27 16:59:51,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.875) internal successors, (142), 16 states have internal predecessors, (142), 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 16:59:51,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:51,387 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:51,391 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 (7)] Forceful destruction successful, exit code 0 [2024-06-27 16:59:51,591 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 16:59:51,591 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 16:59:51,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:51,592 INFO L85 PathProgramCache]: Analyzing trace with hash -592713162, now seen corresponding path program 3 times [2024-06-27 16:59:51,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:59:51,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213181533] [2024-06-27 16:59:51,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:59:51,593 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 16:59:51,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:59:51,594 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 16:59:51,603 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 16:59:51,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 16:59:51,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:59:51,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 16:59:51,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:59:51,943 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:59:52,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:59:52,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213181533] [2024-06-27 16:59:52,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213181533] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:52,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:59:52,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-06-27 16:59:52,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454470187] [2024-06-27 16:59:52,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:52,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 16:59:52,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:59:52,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 16:59:52,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-27 16:59:52,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:59:52,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 292 flow. Second operand has 10 states, 10 states have (on average 12.2) internal successors, (122), 10 states have internal predecessors, (122), 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 16:59:52,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:52,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:59:52,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:52,980 INFO L124 PetriNetUnfolderBase]: 859/1601 cut-off events. [2024-06-27 16:59:52,980 INFO L125 PetriNetUnfolderBase]: For 2708/2804 co-relation queries the response was YES. [2024-06-27 16:59:52,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5364 conditions, 1601 events. 859/1601 cut-off events. For 2708/2804 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8344 event pairs, 228 based on Foata normal form. 64/1576 useless extension candidates. Maximal degree in co-relation 3989. Up to 780 conditions per place. [2024-06-27 16:59:52,988 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 47 selfloop transitions, 4 changer transitions 58/121 dead transitions. [2024-06-27 16:59:52,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 121 transitions, 892 flow [2024-06-27 16:59:52,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 16:59:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 16:59:52,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-27 16:59:52,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5443548387096774 [2024-06-27 16:59:52,990 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 292 flow. Second operand 8 states and 135 transitions. [2024-06-27 16:59:52,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 121 transitions, 892 flow [2024-06-27 16:59:52,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 121 transitions, 884 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 16:59:52,997 INFO L231 Difference]: Finished difference. Result has 68 places, 54 transitions, 310 flow [2024-06-27 16:59:52,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=310, PETRI_PLACES=68, PETRI_TRANSITIONS=54} [2024-06-27 16:59:52,998 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2024-06-27 16:59:52,998 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 54 transitions, 310 flow [2024-06-27 16:59:52,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 10 states have internal predecessors, (122), 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 16:59:52,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:52,999 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:53,019 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 (8)] Ended with exit code 0 [2024-06-27 16:59:53,202 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 16:59:53,202 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 16:59:53,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:53,203 INFO L85 PathProgramCache]: Analyzing trace with hash -166118970, now seen corresponding path program 4 times [2024-06-27 16:59:53,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:59:53,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038317632] [2024-06-27 16:59:53,203 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 16:59:53,203 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 16:59:53,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:59:53,206 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 16:59:53,207 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 16:59:53,297 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 16:59:53,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:59:53,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjunts are in the unsatisfiable core [2024-06-27 16:59:53,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:53,681 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:59:53,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:59:54,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:59:54,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038317632] [2024-06-27 16:59:54,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038317632] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:54,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:59:54,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2024-06-27 16:59:54,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104066046] [2024-06-27 16:59:54,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:54,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-06-27 16:59:54,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:59:54,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-06-27 16:59:54,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-06-27 16:59:54,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-27 16:59:54,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 54 transitions, 310 flow. Second operand has 18 states, 18 states have (on average 7.777777777777778) internal successors, (140), 18 states have internal predecessors, (140), 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 16:59:54,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:54,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-27 16:59:54,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:56,450 INFO L124 PetriNetUnfolderBase]: 2210/3762 cut-off events. [2024-06-27 16:59:56,451 INFO L125 PetriNetUnfolderBase]: For 5754/5754 co-relation queries the response was YES. [2024-06-27 16:59:56,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12900 conditions, 3762 events. 2210/3762 cut-off events. For 5754/5754 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 19362 event pairs, 410 based on Foata normal form. 98/3679 useless extension candidates. Maximal degree in co-relation 9776. Up to 869 conditions per place. [2024-06-27 16:59:56,475 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 199 selfloop transitions, 25 changer transitions 42/269 dead transitions. [2024-06-27 16:59:56,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 269 transitions, 1970 flow [2024-06-27 16:59:56,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-06-27 16:59:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-06-27 16:59:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 274 transitions. [2024-06-27 16:59:56,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46519524617996605 [2024-06-27 16:59:56,478 INFO L175 Difference]: Start difference. First operand has 68 places, 54 transitions, 310 flow. Second operand 19 states and 274 transitions. [2024-06-27 16:59:56,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 269 transitions, 1970 flow [2024-06-27 16:59:56,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 269 transitions, 1928 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 16:59:56,499 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 553 flow [2024-06-27 16:59:56,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=553, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2024-06-27 16:59:56,502 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 58 predicate places. [2024-06-27 16:59:56,502 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 553 flow [2024-06-27 16:59:56,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.777777777777778) internal successors, (140), 18 states have internal predecessors, (140), 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 16:59:56,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:56,502 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:56,507 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 (9)] Ended with exit code 0 [2024-06-27 16:59:56,703 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 16:59:56,704 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 16:59:56,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:56,704 INFO L85 PathProgramCache]: Analyzing trace with hash 886953320, now seen corresponding path program 5 times [2024-06-27 16:59:56,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:59:56,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007419797] [2024-06-27 16:59:56,705 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 16:59:56,705 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 16:59:56,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:59:56,706 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 16:59:56,727 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 16:59:56,875 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-06-27 16:59:56,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:59:56,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjunts are in the unsatisfiable core [2024-06-27 16:59:56,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:57,048 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-27 16:59:57,048 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:59:57,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:59:57,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007419797] [2024-06-27 16:59:57,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007419797] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:57,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:59:57,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 17 [2024-06-27 16:59:57,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585183085] [2024-06-27 16:59:57,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:57,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-06-27 16:59:57,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:59:57,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-06-27 16:59:57,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-06-27 16:59:57,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-27 16:59:57,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 553 flow. Second operand has 18 states, 18 states have (on average 8.333333333333334) internal successors, (150), 18 states have internal predecessors, (150), 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 16:59:57,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:57,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-27 16:59:57,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:59,460 INFO L124 PetriNetUnfolderBase]: 3408/5888 cut-off events. [2024-06-27 16:59:59,461 INFO L125 PetriNetUnfolderBase]: For 14414/14414 co-relation queries the response was YES. [2024-06-27 16:59:59,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22285 conditions, 5888 events. 3408/5888 cut-off events. For 14414/14414 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 34183 event pairs, 213 based on Foata normal form. 234/5874 useless extension candidates. Maximal degree in co-relation 19013. Up to 1729 conditions per place. [2024-06-27 16:59:59,496 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 172 selfloop transitions, 44 changer transitions 62/281 dead transitions. [2024-06-27 16:59:59,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 281 transitions, 2530 flow [2024-06-27 16:59:59,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-06-27 16:59:59,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-06-27 16:59:59,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 241 transitions. [2024-06-27 16:59:59,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43189964157706096 [2024-06-27 16:59:59,500 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 553 flow. Second operand 18 states and 241 transitions. [2024-06-27 16:59:59,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 281 transitions, 2530 flow [2024-06-27 16:59:59,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 281 transitions, 2442 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-06-27 16:59:59,554 INFO L231 Difference]: Finished difference. Result has 111 places, 104 transitions, 976 flow [2024-06-27 16:59:59,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=976, PETRI_PLACES=111, PETRI_TRANSITIONS=104} [2024-06-27 16:59:59,555 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 81 predicate places. [2024-06-27 16:59:59,555 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 104 transitions, 976 flow [2024-06-27 16:59:59,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.333333333333334) internal successors, (150), 18 states have internal predecessors, (150), 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 16:59:59,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:59,556 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:59,560 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 (10)] Ended with exit code 0 [2024-06-27 16:59:59,757 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 16:59:59,757 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 16:59:59,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:59,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1832026411, now seen corresponding path program 6 times [2024-06-27 16:59:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:59:59,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302441630] [2024-06-27 16:59:59,758 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 16:59:59,759 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 16:59:59,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:59:59,781 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 16:59:59,817 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:00:00,076 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-06-27 17:00:00,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:00:00,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 22 conjunts are in the unsatisfiable core [2024-06-27 17:00:00,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:04,625 INFO L349 Elim1Store]: treesize reduction 268, result has 79.7 percent of original size [2024-06-27 17:00:04,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 6 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 298 treesize of output 1112 [2024-06-27 17:00:07,251 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 17:00:07,251 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:00:48,260 WARN L293 SmtUtils]: Spent 19.00s on a formula simplification. DAG size of input: 779 DAG size of output: 513 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-27 17:00:48,260 INFO L349 Elim1Store]: treesize reduction 1085, result has 70.2 percent of original size [2024-06-27 17:00:48,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 0 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 276 case distinctions, treesize of input 346 treesize of output 2619 [2024-06-27 17:01:07,263 INFO L349 Elim1Store]: treesize reduction 324, result has 78.2 percent of original size [2024-06-27 17:01:07,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 260 treesize of output 1213 [2024-06-27 17:01:20,184 WARN L293 SmtUtils]: Spent 12.31s on a formula simplification. DAG size of input: 843 DAG size of output: 399 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-27 17:01:20,184 INFO L349 Elim1Store]: treesize reduction 1986, result has 46.0 percent of original size [2024-06-27 17:01:20,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 0 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 276 case distinctions, treesize of input 332 treesize of output 1754 [2024-06-27 17:01:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 17:01:26,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:01:26,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302441630] [2024-06-27 17:01:26,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [302441630] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:01:26,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:01:26,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2024-06-27 17:01:26,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234174465] [2024-06-27 17:01:26,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:01:26,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-06-27 17:01:26,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:01:26,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-06-27 17:01:26,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=482, Unknown=4, NotChecked=0, Total=600 [2024-06-27 17:01:30,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:01:35,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:01:35,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-27 17:01:35,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 104 transitions, 976 flow. Second operand has 25 states, 25 states have (on average 8.48) internal successors, (212), 25 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:01:35,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:01:35,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-27 17:01:35,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:02:01,006 WARN L293 SmtUtils]: Spent 20.12s on a formula simplification. DAG size of input: 109 DAG size of output: 91 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 17:02:46,411 WARN L293 SmtUtils]: Spent 44.21s on a formula simplification. DAG size of input: 118 DAG size of output: 112 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 17:03:03,362 WARN L293 SmtUtils]: Spent 12.08s on a formula simplification. DAG size of input: 97 DAG size of output: 91 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 17:03:09,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:03:14,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:03:23,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 17:03:36,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-06-27 17:03:40,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-06-27 17:03:44,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 17:03:48,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:03:55,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-06-27 17:03:59,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-06-27 17:04:06,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 17:04:10,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-06-27 17:04:17,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-06-27 17:04:21,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-06-27 17:04:25,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-06-27 17:04:29,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:04:33,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:04:38,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 17:04:42,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-06-27 17:04:47,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:04:51,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 17:05:03,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-06-27 17:05:12,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-27 17:05:12,458 INFO L124 PetriNetUnfolderBase]: 5795/10217 cut-off events. [2024-06-27 17:05:12,459 INFO L125 PetriNetUnfolderBase]: For 46549/46555 co-relation queries the response was YES. [2024-06-27 17:05:12,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44364 conditions, 10217 events. 5795/10217 cut-off events. For 46549/46555 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 66695 event pairs, 509 based on Foata normal form. 11/9601 useless extension candidates. Maximal degree in co-relation 42606. Up to 2083 conditions per place. [2024-06-27 17:05:12,650 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 354 selfloop transitions, 109 changer transitions 84/556 dead transitions. [2024-06-27 17:05:12,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 556 transitions, 6013 flow [2024-06-27 17:05:12,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-06-27 17:05:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2024-06-27 17:05:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 455 transitions. [2024-06-27 17:05:12,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4447702834799609 [2024-06-27 17:05:12,656 INFO L175 Difference]: Start difference. First operand has 111 places, 104 transitions, 976 flow. Second operand 33 states and 455 transitions. [2024-06-27 17:05:12,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 556 transitions, 6013 flow [2024-06-27 17:05:12,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 556 transitions, 5699 flow, removed 136 selfloop flow, removed 8 redundant places. [2024-06-27 17:05:12,880 INFO L231 Difference]: Finished difference. Result has 151 places, 204 transitions, 2215 flow [2024-06-27 17:05:12,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=2215, PETRI_PLACES=151, PETRI_TRANSITIONS=204} [2024-06-27 17:05:12,881 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 121 predicate places. [2024-06-27 17:05:12,881 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 204 transitions, 2215 flow [2024-06-27 17:05:12,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.48) internal successors, (212), 25 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:05:12,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:05:12,881 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:05:12,893 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:05:13,086 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:05:13,087 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:05:13,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:05:13,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1092139225, now seen corresponding path program 7 times [2024-06-27 17:05:13,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:05:13,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352695745] [2024-06-27 17:05:13,088 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-06-27 17:05:13,088 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:05:13,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:05:13,089 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:05:13,090 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:05:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:05:13,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjunts are in the unsatisfiable core [2024-06-27 17:05:13,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:05:29,835 WARN L293 SmtUtils]: Spent 5.80s on a formula simplification. DAG size of input: 280 DAG size of output: 217 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-27 17:05:29,835 INFO L349 Elim1Store]: treesize reduction 332, result has 78.6 percent of original size [2024-06-27 17:05:29,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 346 treesize of output 1284 [2024-06-27 17:05:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 17:05:42,782 INFO L327 TraceCheckSpWp]: Computing backward predicates... Killed by 15