./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-prod-cons-eq.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-prod-cons-eq.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 1ecd7c8e693c00e4ad1aa87421fd475cfc129d605eef5f310568fee0c97eadf4 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:02:56,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:02:56,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:02:56,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:02:56,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:02:56,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:02:56,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:02:56,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:02:56,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:02:56,786 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:02:56,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:02:56,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:02:56,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:02:56,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:02:56,788 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:02:56,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:02:56,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:02:56,789 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:02:56,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:02:56,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:02:56,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:02:56,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:02:56,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:02:56,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:02:56,791 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:02:56,791 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:02:56,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:02:56,791 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:02:56,792 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:02:56,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:02:56,793 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:02:56,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:02:56,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:02:56,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:02:56,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:02:56,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:02:56,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:02:56,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:02:56,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:02:56,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:02:56,795 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:02:56,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:02:56,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:02:56,795 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 -> 1ecd7c8e693c00e4ad1aa87421fd475cfc129d605eef5f310568fee0c97eadf4 [2024-06-27 17:02:57,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:02:57,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:02:57,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:02:57,036 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:02:57,036 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:02:57,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c [2024-06-27 17:02:58,051 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:02:58,227 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:02:58,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c [2024-06-27 17:02:58,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af384ea2e/8f41a708607240f39d7b90250afc8144/FLAG90bf4949d [2024-06-27 17:02:58,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af384ea2e/8f41a708607240f39d7b90250afc8144 [2024-06-27 17:02:58,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:02:58,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:02:58,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:02:58,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:02:58,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:02:58,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:02:58" (1/1) ... [2024-06-27 17:02:58,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25cc4b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:58, skipping insertion in model container [2024-06-27 17:02:58,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:02:58" (1/1) ... [2024-06-27 17:02:58,267 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:02:58,395 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-prod-cons-eq.wvr.c[4419,4432] [2024-06-27 17:02:58,410 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:02:58,417 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:02:58,437 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-prod-cons-eq.wvr.c[4419,4432] [2024-06-27 17:02:58,440 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:02:58,453 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:02:58,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:58 WrapperNode [2024-06-27 17:02:58,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:02:58,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:02:58,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:02:58,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:02:58,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:58" (1/1) ... [2024-06-27 17:02:58,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:58" (1/1) ... [2024-06-27 17:02:58,497 INFO L138 Inliner]: procedures = 27, calls = 65, calls flagged for inlining = 26, calls inlined = 32, statements flattened = 397 [2024-06-27 17:02:58,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:02:58,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:02:58,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:02:58,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:02:58,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:58" (1/1) ... [2024-06-27 17:02:58,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:58" (1/1) ... [2024-06-27 17:02:58,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:58" (1/1) ... [2024-06-27 17:02:58,553 INFO L175 MemorySlicer]: Split 24 memory accesses to 4 slices as follows [2, 3, 3, 16]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 6 writes are split as follows [0, 1, 1, 4]. [2024-06-27 17:02:58,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:58" (1/1) ... [2024-06-27 17:02:58,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:58" (1/1) ... [2024-06-27 17:02:58,562 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:58" (1/1) ... [2024-06-27 17:02:58,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:58" (1/1) ... [2024-06-27 17:02:58,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:58" (1/1) ... [2024-06-27 17:02:58,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:58" (1/1) ... [2024-06-27 17:02:58,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:02:58,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:02:58,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:02:58,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:02:58,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:58" (1/1) ... [2024-06-27 17:02:58,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:02:58,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:02:58,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 17:02:58,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 17:02:58,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:02:58,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-06-27 17:02:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-06-27 17:02:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-06-27 17:02:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-06-27 17:02:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 17:02:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 17:02:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-27 17:02:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-06-27 17:02:58,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 17:02:58,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 17:02:58,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-27 17:02:58,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-06-27 17:02:58,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-06-27 17:02:58,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-06-27 17:02:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-06-27 17:02:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-06-27 17:02:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 17:02:58,662 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 17:02:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 17:02:58,663 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 17:02:58,663 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 17:02:58,663 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 17:02:58,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:02:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 17:02:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-27 17:02:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-27 17:02:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:02:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:02:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 17:02:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:02:58,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:02:58,669 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:02:58,807 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:02:58,809 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:02:59,220 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:02:59,221 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:02:59,644 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:02:59,644 INFO L320 CfgBuilder]: Removed 9 assume(true) statements. [2024-06-27 17:02:59,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:02:59 BoogieIcfgContainer [2024-06-27 17:02:59,645 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:02:59,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:02:59,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:02:59,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:02:59,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:02:58" (1/3) ... [2024-06-27 17:02:59,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135b691e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:02:59, skipping insertion in model container [2024-06-27 17:02:59,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:58" (2/3) ... [2024-06-27 17:02:59,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135b691e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:02:59, skipping insertion in model container [2024-06-27 17:02:59,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:02:59" (3/3) ... [2024-06-27 17:02:59,651 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2024-06-27 17:02:59,658 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:02:59,664 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:02:59,665 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 17:02:59,665 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:02:59,710 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-06-27 17:02:59,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 107 flow [2024-06-27 17:02:59,768 INFO L124 PetriNetUnfolderBase]: 9/40 cut-off events. [2024-06-27 17:02:59,768 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 17:02:59,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 40 events. 9/40 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-06-27 17:02:59,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 43 transitions, 107 flow [2024-06-27 17:02:59,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 39 transitions, 96 flow [2024-06-27 17:02:59,785 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:02:59,791 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;@5e9e0c31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:02:59,791 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 17:02:59,805 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:02:59,805 INFO L124 PetriNetUnfolderBase]: 9/38 cut-off events. [2024-06-27 17:02:59,805 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 17:02:59,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:02:59,806 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 17:02:59,806 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:02:59,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:02:59,811 INFO L85 PathProgramCache]: Analyzing trace with hash -981209084, now seen corresponding path program 1 times [2024-06-27 17:02:59,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:02:59,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830711142] [2024-06-27 17:02:59,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:02:59,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:02:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:03:00,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:03:00,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:03:00,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830711142] [2024-06-27 17:03:00,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830711142] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:03:00,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:03:00,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:03:00,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743720729] [2024-06-27 17:03:00,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:03:00,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:03:00,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:03:00,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:03:00,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:03:00,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 17:03:00,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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 17:03:00,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:03:00,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 17:03:00,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:03:00,319 INFO L124 PetriNetUnfolderBase]: 503/792 cut-off events. [2024-06-27 17:03:00,319 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2024-06-27 17:03:00,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1567 conditions, 792 events. 503/792 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3506 event pairs, 91 based on Foata normal form. 1/683 useless extension candidates. Maximal degree in co-relation 1400. Up to 493 conditions per place. [2024-06-27 17:03:00,329 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 41 selfloop transitions, 3 changer transitions 1/53 dead transitions. [2024-06-27 17:03:00,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 226 flow [2024-06-27 17:03:00,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:03:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:03:00,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-06-27 17:03:00,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6124031007751938 [2024-06-27 17:03:00,340 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 96 flow. Second operand 3 states and 79 transitions. [2024-06-27 17:03:00,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 226 flow [2024-06-27 17:03:00,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 53 transitions, 206 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 17:03:00,347 INFO L231 Difference]: Finished difference. Result has 37 places, 41 transitions, 103 flow [2024-06-27 17:03:00,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=37, PETRI_TRANSITIONS=41} [2024-06-27 17:03:00,351 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2024-06-27 17:03:00,351 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 41 transitions, 103 flow [2024-06-27 17:03:00,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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 17:03:00,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:03:00,352 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 17:03:00,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:03:00,353 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:03:00,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:03:00,354 INFO L85 PathProgramCache]: Analyzing trace with hash 971552426, now seen corresponding path program 1 times [2024-06-27 17:03:00,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:03:00,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752486972] [2024-06-27 17:03:00,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:03:00,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:03:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:03:00,553 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 17:03:00,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:03:00,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752486972] [2024-06-27 17:03:00,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752486972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:03:00,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:03:00,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:03:00,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791426716] [2024-06-27 17:03:00,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:03:00,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:03:00,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:03:00,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:03:00,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:03:00,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 17:03:00,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 41 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:03:00,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:03:00,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 17:03:00,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:03:00,718 INFO L124 PetriNetUnfolderBase]: 582/929 cut-off events. [2024-06-27 17:03:00,719 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2024-06-27 17:03:00,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2038 conditions, 929 events. 582/929 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4638 event pairs, 357 based on Foata normal form. 36/920 useless extension candidates. Maximal degree in co-relation 896. Up to 652 conditions per place. [2024-06-27 17:03:00,723 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 34 selfloop transitions, 2 changer transitions 16/60 dead transitions. [2024-06-27 17:03:00,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 60 transitions, 251 flow [2024-06-27 17:03:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:03:00,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:03:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2024-06-27 17:03:00,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2024-06-27 17:03:00,725 INFO L175 Difference]: Start difference. First operand has 37 places, 41 transitions, 103 flow. Second operand 4 states and 96 transitions. [2024-06-27 17:03:00,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 60 transitions, 251 flow [2024-06-27 17:03:00,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 60 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:03:00,726 INFO L231 Difference]: Finished difference. Result has 41 places, 42 transitions, 116 flow [2024-06-27 17:03:00,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=41, PETRI_TRANSITIONS=42} [2024-06-27 17:03:00,727 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-06-27 17:03:00,727 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 42 transitions, 116 flow [2024-06-27 17:03:00,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:03:00,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:03:00,728 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 17:03:00,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:03:00,728 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:03:00,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:03:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2021955472, now seen corresponding path program 1 times [2024-06-27 17:03:00,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:03:00,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431990705] [2024-06-27 17:03:00,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:03:00,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:03:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:03:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:03:00,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:03:00,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431990705] [2024-06-27 17:03:00,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431990705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:03:00,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:03:00,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:03:00,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436826816] [2024-06-27 17:03:00,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:03:00,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:03:00,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:03:00,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:03:00,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:03:00,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 17:03:00,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 42 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:03:00,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:03:00,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 17:03:00,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:03:01,017 INFO L124 PetriNetUnfolderBase]: 559/898 cut-off events. [2024-06-27 17:03:01,017 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2024-06-27 17:03:01,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2033 conditions, 898 events. 559/898 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4498 event pairs, 341 based on Foata normal form. 39/884 useless extension candidates. Maximal degree in co-relation 1577. Up to 655 conditions per place. [2024-06-27 17:03:01,021 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 55 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2024-06-27 17:03:01,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 70 transitions, 320 flow [2024-06-27 17:03:01,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:03:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:03:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2024-06-27 17:03:01,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5302325581395348 [2024-06-27 17:03:01,023 INFO L175 Difference]: Start difference. First operand has 41 places, 42 transitions, 116 flow. Second operand 5 states and 114 transitions. [2024-06-27 17:03:01,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 70 transitions, 320 flow [2024-06-27 17:03:01,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 70 transitions, 310 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 17:03:01,025 INFO L231 Difference]: Finished difference. Result has 45 places, 48 transitions, 170 flow [2024-06-27 17:03:01,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=45, PETRI_TRANSITIONS=48} [2024-06-27 17:03:01,026 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2024-06-27 17:03:01,026 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 48 transitions, 170 flow [2024-06-27 17:03:01,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:03:01,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:03:01,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, 1] [2024-06-27 17:03:01,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:03:01,027 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:03:01,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:03:01,027 INFO L85 PathProgramCache]: Analyzing trace with hash 491854487, now seen corresponding path program 1 times [2024-06-27 17:03:01,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:03:01,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816398278] [2024-06-27 17:03:01,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:03:01,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:03:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:03:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:03:01,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:03:01,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816398278] [2024-06-27 17:03:01,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816398278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:03:01,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:03:01,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:03:01,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120997021] [2024-06-27 17:03:01,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:03:01,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:03:01,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:03:01,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:03:01,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:03:01,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 17:03:01,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 48 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:03:01,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:03:01,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 17:03:01,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:03:01,414 INFO L124 PetriNetUnfolderBase]: 807/1390 cut-off events. [2024-06-27 17:03:01,415 INFO L125 PetriNetUnfolderBase]: For 529/529 co-relation queries the response was YES. [2024-06-27 17:03:01,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3202 conditions, 1390 events. 807/1390 cut-off events. For 529/529 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8125 event pairs, 537 based on Foata normal form. 44/1340 useless extension candidates. Maximal degree in co-relation 2336. Up to 832 conditions per place. [2024-06-27 17:03:01,421 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 64 selfloop transitions, 14 changer transitions 1/87 dead transitions. [2024-06-27 17:03:01,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 87 transitions, 482 flow [2024-06-27 17:03:01,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:03:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:03:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2024-06-27 17:03:01,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5441860465116279 [2024-06-27 17:03:01,424 INFO L175 Difference]: Start difference. First operand has 45 places, 48 transitions, 170 flow. Second operand 5 states and 117 transitions. [2024-06-27 17:03:01,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 87 transitions, 482 flow [2024-06-27 17:03:01,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 87 transitions, 478 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:03:01,429 INFO L231 Difference]: Finished difference. Result has 51 places, 60 transitions, 305 flow [2024-06-27 17:03:01,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=305, PETRI_PLACES=51, PETRI_TRANSITIONS=60} [2024-06-27 17:03:01,430 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2024-06-27 17:03:01,430 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 60 transitions, 305 flow [2024-06-27 17:03:01,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:03:01,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:03:01,431 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, 1, 1] [2024-06-27 17:03:01,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:03:01,431 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:03:01,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:03:01,432 INFO L85 PathProgramCache]: Analyzing trace with hash 147203735, now seen corresponding path program 1 times [2024-06-27 17:03:01,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:03:01,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306011995] [2024-06-27 17:03:01,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:03:01,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:03:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:03:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:03:01,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:03:01,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306011995] [2024-06-27 17:03:01,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306011995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:03:01,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:03:01,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:03:01,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894831288] [2024-06-27 17:03:01,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:03:01,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:03:01,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:03:01,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:03:01,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:03:01,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 17:03:01,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 60 transitions, 305 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:03:01,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:03:01,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 17:03:01,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:03:01,671 INFO L124 PetriNetUnfolderBase]: 638/1138 cut-off events. [2024-06-27 17:03:01,673 INFO L125 PetriNetUnfolderBase]: For 669/669 co-relation queries the response was YES. [2024-06-27 17:03:01,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2826 conditions, 1138 events. 638/1138 cut-off events. For 669/669 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6152 event pairs, 200 based on Foata normal form. 50/1144 useless extension candidates. Maximal degree in co-relation 2355. Up to 621 conditions per place. [2024-06-27 17:03:01,678 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 49 selfloop transitions, 2 changer transitions 16/75 dead transitions. [2024-06-27 17:03:01,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 75 transitions, 490 flow [2024-06-27 17:03:01,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:03:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:03:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-06-27 17:03:01,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6124031007751938 [2024-06-27 17:03:01,681 INFO L175 Difference]: Start difference. First operand has 51 places, 60 transitions, 305 flow. Second operand 3 states and 79 transitions. [2024-06-27 17:03:01,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 75 transitions, 490 flow [2024-06-27 17:03:01,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 75 transitions, 485 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:03:01,688 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 174 flow [2024-06-27 17:03:01,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2024-06-27 17:03:01,690 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2024-06-27 17:03:01,690 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 174 flow [2024-06-27 17:03:01,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:03:01,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:03:01,691 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, 1, 1] [2024-06-27 17:03:01,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:03:01,691 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:03:01,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:03:01,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1850563707, now seen corresponding path program 1 times [2024-06-27 17:03:01,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:03:01,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764983312] [2024-06-27 17:03:01,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:03:01,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:03:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:03:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:03:01,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:03:01,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764983312] [2024-06-27 17:03:01,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764983312] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:03:01,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184535519] [2024-06-27 17:03:01,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:03:01,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:03:01,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:03:01,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:03:01,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-27 17:03:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:03:02,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 17:03:02,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:03:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:03:02,082 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:03:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:03:02,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184535519] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:03:02,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:03:02,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2024-06-27 17:03:02,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127200104] [2024-06-27 17:03:02,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:03:02,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:03:02,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:03:02,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:03:02,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 17:03:02,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 17:03:02,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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:03:02,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:03:02,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 17:03:02,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:03:02,256 INFO L124 PetriNetUnfolderBase]: 454/737 cut-off events. [2024-06-27 17:03:02,256 INFO L125 PetriNetUnfolderBase]: For 819/819 co-relation queries the response was YES. [2024-06-27 17:03:02,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 737 events. 454/737 cut-off events. For 819/819 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3550 event pairs, 298 based on Foata normal form. 1/693 useless extension candidates. Maximal degree in co-relation 2003. Up to 672 conditions per place. [2024-06-27 17:03:02,260 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 34 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2024-06-27 17:03:02,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 46 transitions, 252 flow [2024-06-27 17:03:02,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:03:02,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:03:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-06-27 17:03:02,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.413953488372093 [2024-06-27 17:03:02,262 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 174 flow. Second operand 5 states and 89 transitions. [2024-06-27 17:03:02,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 46 transitions, 252 flow [2024-06-27 17:03:02,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 46 transitions, 230 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-27 17:03:02,264 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 168 flow [2024-06-27 17:03:02,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2024-06-27 17:03:02,265 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2024-06-27 17:03:02,265 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 168 flow [2024-06-27 17:03:02,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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:03:02,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:03:02,265 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, 1, 1, 1] [2024-06-27 17:03:02,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-27 17:03:02,479 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 17:03:02,482 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:03:02,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:03:02,483 INFO L85 PathProgramCache]: Analyzing trace with hash 732343031, now seen corresponding path program 1 times [2024-06-27 17:03:02,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:03:02,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239855638] [2024-06-27 17:03:02,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:03:02,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:03:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:03:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 17:03:02,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:03:02,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239855638] [2024-06-27 17:03:02,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239855638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:03:02,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:03:02,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:03:02,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881202399] [2024-06-27 17:03:02,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:03:02,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:03:02,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:03:02,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:03:02,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:03:02,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 17:03:02,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:03:02,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:03:02,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 17:03:02,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:03:02,791 INFO L124 PetriNetUnfolderBase]: 562/922 cut-off events. [2024-06-27 17:03:02,792 INFO L125 PetriNetUnfolderBase]: For 890/890 co-relation queries the response was YES. [2024-06-27 17:03:02,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2466 conditions, 922 events. 562/922 cut-off events. For 890/890 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4544 event pairs, 139 based on Foata normal form. 22/908 useless extension candidates. Maximal degree in co-relation 2440. Up to 548 conditions per place. [2024-06-27 17:03:02,797 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 49 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2024-06-27 17:03:02,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 320 flow [2024-06-27 17:03:02,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:03:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:03:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-06-27 17:03:02,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5968992248062015 [2024-06-27 17:03:02,798 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 168 flow. Second operand 3 states and 77 transitions. [2024-06-27 17:03:02,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 320 flow [2024-06-27 17:03:02,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 312 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-27 17:03:02,800 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 172 flow [2024-06-27 17:03:02,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2024-06-27 17:03:02,801 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2024-06-27 17:03:02,801 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 172 flow [2024-06-27 17:03:02,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:03:02,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:03:02,802 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, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:03:02,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:03:02,802 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:03:02,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:03:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash 333029632, now seen corresponding path program 1 times [2024-06-27 17:03:02,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:03:02,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860830572] [2024-06-27 17:03:02,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:03:02,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:03:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:03:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 17:03:02,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:03:02,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860830572] [2024-06-27 17:03:02,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860830572] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:03:02,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:03:02,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:03:02,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547135187] [2024-06-27 17:03:02,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:03:02,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:03:02,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:03:02,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:03:02,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:03:02,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 17:03:02,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:03:02,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:03:02,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 17:03:02,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:03:03,071 INFO L124 PetriNetUnfolderBase]: 587/940 cut-off events. [2024-06-27 17:03:03,071 INFO L125 PetriNetUnfolderBase]: For 1099/1099 co-relation queries the response was YES. [2024-06-27 17:03:03,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 940 events. 587/940 cut-off events. For 1099/1099 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4544 event pairs, 380 based on Foata normal form. 21/938 useless extension candidates. Maximal degree in co-relation 2683. Up to 817 conditions per place. [2024-06-27 17:03:03,076 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 38 selfloop transitions, 2 changer transitions 22/70 dead transitions. [2024-06-27 17:03:03,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 375 flow [2024-06-27 17:03:03,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:03:03,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:03:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-06-27 17:03:03,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930232558139535 [2024-06-27 17:03:03,078 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 172 flow. Second operand 5 states and 106 transitions. [2024-06-27 17:03:03,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 375 flow [2024-06-27 17:03:03,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 373 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:03:03,080 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 192 flow [2024-06-27 17:03:03,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-06-27 17:03:03,080 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2024-06-27 17:03:03,080 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 192 flow [2024-06-27 17:03:03,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:03:03,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:03:03,081 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:03:03,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 17:03:03,081 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:03:03,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:03:03,082 INFO L85 PathProgramCache]: Analyzing trace with hash -211148251, now seen corresponding path program 1 times [2024-06-27 17:03:03,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:03:03,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331039585] [2024-06-27 17:03:03,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:03:03,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:03:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:03:03,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 17:03:03,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:03:03,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331039585] [2024-06-27 17:03:03,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331039585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:03:03,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:03:03,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:03:03,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287656051] [2024-06-27 17:03:03,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:03:03,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:03:03,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:03:03,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:03:03,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:03:03,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 17:03:03,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:03:03,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:03:03,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 17:03:03,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:03:03,518 INFO L124 PetriNetUnfolderBase]: 710/1159 cut-off events. [2024-06-27 17:03:03,518 INFO L125 PetriNetUnfolderBase]: For 1509/1509 co-relation queries the response was YES. [2024-06-27 17:03:03,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3269 conditions, 1159 events. 710/1159 cut-off events. For 1509/1509 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6042 event pairs, 497 based on Foata normal form. 57/1188 useless extension candidates. Maximal degree in co-relation 3239. Up to 818 conditions per place. [2024-06-27 17:03:03,523 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 39 selfloop transitions, 2 changer transitions 22/71 dead transitions. [2024-06-27 17:03:03,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 71 transitions, 406 flow [2024-06-27 17:03:03,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:03:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:03:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2024-06-27 17:03:03,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069767441860465 [2024-06-27 17:03:03,524 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 192 flow. Second operand 5 states and 109 transitions. [2024-06-27 17:03:03,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 71 transitions, 406 flow [2024-06-27 17:03:03,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 380 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-27 17:03:03,526 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 200 flow [2024-06-27 17:03:03,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2024-06-27 17:03:03,526 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2024-06-27 17:03:03,527 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 200 flow [2024-06-27 17:03:03,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:03:03,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:03:03,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:03:03,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 17:03:03,527 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:03:03,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:03:03,528 INFO L85 PathProgramCache]: Analyzing trace with hash 567869195, now seen corresponding path program 1 times [2024-06-27 17:03:03,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:03:03,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818112573] [2024-06-27 17:03:03,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:03:03,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:03:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:03:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 17:03:03,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:03:03,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818112573] [2024-06-27 17:03:03,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818112573] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:03:03,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:03:03,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:03:03,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772944882] [2024-06-27 17:03:03,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:03:03,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:03:03,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:03:03,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:03:03,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:03:03,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-27 17:03:03,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:03:03,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:03:03,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-27 17:03:03,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:03:03,921 INFO L124 PetriNetUnfolderBase]: 1156/1788 cut-off events. [2024-06-27 17:03:03,921 INFO L125 PetriNetUnfolderBase]: For 2318/2318 co-relation queries the response was YES. [2024-06-27 17:03:03,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5123 conditions, 1788 events. 1156/1788 cut-off events. For 2318/2318 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 8721 event pairs, 242 based on Foata normal form. 123/1902 useless extension candidates. Maximal degree in co-relation 5094. Up to 540 conditions per place. [2024-06-27 17:03:03,929 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 75 selfloop transitions, 10 changer transitions 0/90 dead transitions. [2024-06-27 17:03:03,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 90 transitions, 545 flow [2024-06-27 17:03:03,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:03:03,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:03:03,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2024-06-27 17:03:03,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069767441860465 [2024-06-27 17:03:03,930 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 200 flow. Second operand 5 states and 109 transitions. [2024-06-27 17:03:03,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 90 transitions, 545 flow [2024-06-27 17:03:03,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 90 transitions, 521 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-27 17:03:03,933 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 260 flow [2024-06-27 17:03:03,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2024-06-27 17:03:03,933 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2024-06-27 17:03:03,933 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 260 flow [2024-06-27 17:03:03,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:03:03,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:03:03,934 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:03:03,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 17:03:03,934 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:03:03,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:03:03,934 INFO L85 PathProgramCache]: Analyzing trace with hash 396331039, now seen corresponding path program 2 times [2024-06-27 17:03:03,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:03:03,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749837595] [2024-06-27 17:03:03,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:03:03,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:03:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:03:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 17:03:04,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:03:04,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749837595] [2024-06-27 17:03:04,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749837595] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:03:04,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332140480] [2024-06-27 17:03:04,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:03:04,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:03:04,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:03:04,169 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:03:04,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-27 17:03:04,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:03:04,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:03:04,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 17:03:04,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:03:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 17:03:04,428 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:03:04,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332140480] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:03:04,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 17:03:04,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-06-27 17:03:04,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918138861] [2024-06-27 17:03:04,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:03:04,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:03:04,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:03:04,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:03:04,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 17:03:04,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-06-27 17:03:04,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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:03:04,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:03:04,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-06-27 17:03:04,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:03:04,878 INFO L124 PetriNetUnfolderBase]: 2125/3230 cut-off events. [2024-06-27 17:03:04,878 INFO L125 PetriNetUnfolderBase]: For 5246/5254 co-relation queries the response was YES. [2024-06-27 17:03:04,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10755 conditions, 3230 events. 2125/3230 cut-off events. For 5246/5254 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16752 event pairs, 165 based on Foata normal form. 69/3282 useless extension candidates. Maximal degree in co-relation 10721. Up to 908 conditions per place. [2024-06-27 17:03:04,897 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 89 selfloop transitions, 16 changer transitions 0/113 dead transitions. [2024-06-27 17:03:04,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 113 transitions, 759 flow [2024-06-27 17:03:04,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:03:04,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:03:04,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2024-06-27 17:03:04,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5038759689922481 [2024-06-27 17:03:04,898 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 260 flow. Second operand 6 states and 130 transitions. [2024-06-27 17:03:04,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 113 transitions, 759 flow [2024-06-27 17:03:04,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 113 transitions, 755 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-27 17:03:04,904 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 415 flow [2024-06-27 17:03:04,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=415, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2024-06-27 17:03:04,905 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 31 predicate places. [2024-06-27 17:03:04,905 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 415 flow [2024-06-27 17:03:04,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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:03:04,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:03:04,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:03:04,932 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 17:03:05,117 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,SelfDestructingSolverStorable10 [2024-06-27 17:03:05,118 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:03:05,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:03:05,118 INFO L85 PathProgramCache]: Analyzing trace with hash 75926374, now seen corresponding path program 1 times [2024-06-27 17:03:05,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:03:05,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161567789] [2024-06-27 17:03:05,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:03:05,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:03:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:03:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-06-27 17:03:05,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:03:05,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161567789] [2024-06-27 17:03:05,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161567789] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:03:05,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:03:05,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:03:05,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55747575] [2024-06-27 17:03:05,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:03:05,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:03:05,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:03:05,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:03:05,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:03:05,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 17:03:05,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:03:05,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:03:05,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 17:03:05,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:03:05,525 INFO L124 PetriNetUnfolderBase]: 1519/2409 cut-off events. [2024-06-27 17:03:05,525 INFO L125 PetriNetUnfolderBase]: For 8150/8370 co-relation queries the response was YES. [2024-06-27 17:03:05,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9700 conditions, 2409 events. 1519/2409 cut-off events. For 8150/8370 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 12349 event pairs, 387 based on Foata normal form. 284/2628 useless extension candidates. Maximal degree in co-relation 9660. Up to 1173 conditions per place. [2024-06-27 17:03:05,542 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 63 selfloop transitions, 3 changer transitions 0/86 dead transitions. [2024-06-27 17:03:05,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 86 transitions, 679 flow [2024-06-27 17:03:05,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:03:05,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:03:05,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-06-27 17:03:05,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2024-06-27 17:03:05,543 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 415 flow. Second operand 3 states and 75 transitions. [2024-06-27 17:03:05,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 86 transitions, 679 flow [2024-06-27 17:03:05,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 86 transitions, 674 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 17:03:05,553 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 433 flow [2024-06-27 17:03:05,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2024-06-27 17:03:05,554 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2024-06-27 17:03:05,554 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 433 flow [2024-06-27 17:03:05,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:03:05,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:03:05,554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:03:05,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 17:03:05,555 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:03:05,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:03:05,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1040107322, now seen corresponding path program 1 times [2024-06-27 17:03:05,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:03:05,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971951666] [2024-06-27 17:03:05,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:03:05,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:03:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:03:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:03:06,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:03:06,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971951666] [2024-06-27 17:03:06,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971951666] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:03:06,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694770323] [2024-06-27 17:03:06,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:03:06,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:03:06,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:03:06,761 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:03:06,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-27 17:03:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:03:06,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 34 conjunts are in the unsatisfiable core [2024-06-27 17:03:06,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:03:07,018 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 17:03:07,055 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 17:03:07,058 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 17:03:07,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2024-06-27 17:03:07,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-06-27 17:03:07,276 INFO L349 Elim1Store]: treesize reduction 20, result has 62.3 percent of original size [2024-06-27 17:03:07,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 45 [2024-06-27 17:03:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 17:03:07,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:03:07,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 91 [2024-06-27 17:03:07,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:03:07,885 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 314 treesize of output 298 [2024-06-27 17:03:07,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 274 [2024-06-27 17:03:07,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:03:07,904 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 806 treesize of output 718 [2024-06-27 17:03:11,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:03:11,777 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 2065 treesize of output 1965 [2024-06-27 17:03:12,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 867 treesize of output 753 [2024-06-27 17:08:33,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-06-27 17:08:33,732 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-06-27 17:08:33,733 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-06-27 17:08:33,746 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 17:08:33,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:08:33,937 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.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) 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.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 76 more [2024-06-27 17:08:33,942 INFO L158 Benchmark]: Toolchain (without parser) took 335696.54ms. Allocated memory was 125.8MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 71.6MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-06-27 17:08:33,942 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory was 100.2MB in the beginning and 100.1MB in the end (delta: 100.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:08:33,942 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.94ms. Allocated memory is still 125.8MB. Free memory was 71.4MB in the beginning and 57.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-06-27 17:08:33,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.14ms. Allocated memory is still 125.8MB. Free memory was 57.1MB in the beginning and 54.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:08:33,943 INFO L158 Benchmark]: Boogie Preprocessor took 85.05ms. Allocated memory was 125.8MB in the beginning and 192.9MB in the end (delta: 67.1MB). Free memory was 53.8MB in the beginning and 163.0MB in the end (delta: -109.2MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2024-06-27 17:08:33,943 INFO L158 Benchmark]: RCFGBuilder took 1056.59ms. Allocated memory is still 192.9MB. Free memory was 163.0MB in the beginning and 119.6MB in the end (delta: 43.4MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. [2024-06-27 17:08:33,943 INFO L158 Benchmark]: TraceAbstraction took 334295.75ms. Allocated memory was 192.9MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 119.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-06-27 17:08:33,944 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 125.8MB. Free memory was 100.2MB in the beginning and 100.1MB in the end (delta: 100.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.94ms. Allocated memory is still 125.8MB. Free memory was 71.4MB in the beginning and 57.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.14ms. Allocated memory is still 125.8MB. Free memory was 57.1MB in the beginning and 54.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.05ms. Allocated memory was 125.8MB in the beginning and 192.9MB in the end (delta: 67.1MB). Free memory was 53.8MB in the beginning and 163.0MB in the end (delta: -109.2MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1056.59ms. Allocated memory is still 192.9MB. Free memory was 163.0MB in the beginning and 119.6MB in the end (delta: 43.4MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. * TraceAbstraction took 334295.75ms. Allocated memory was 192.9MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 119.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. 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-prod-cons-eq.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 1ecd7c8e693c00e4ad1aa87421fd475cfc129d605eef5f310568fee0c97eadf4 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:08:36,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:08:36,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-06-27 17:08:36,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:08:36,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:08:36,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:08:36,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:08:36,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:08:36,200 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:08:36,204 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:08:36,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:08:36,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:08:36,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:08:36,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:08:36,206 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:08:36,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:08:36,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:08:36,207 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:08:36,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:08:36,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:08:36,208 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:08:36,208 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:08:36,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:08:36,209 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-06-27 17:08:36,209 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-06-27 17:08:36,209 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:08:36,209 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-06-27 17:08:36,209 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:08:36,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:08:36,210 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:08:36,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:08:36,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:08:36,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:08:36,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:08:36,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:08:36,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:08:36,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:08:36,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:08:36,213 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-06-27 17:08:36,213 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-06-27 17:08:36,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:08:36,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:08:36,214 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:08:36,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:08:36,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:08:36,214 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-06-27 17:08:36,214 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 -> 1ecd7c8e693c00e4ad1aa87421fd475cfc129d605eef5f310568fee0c97eadf4 [2024-06-27 17:08:36,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:08:36,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:08:36,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:08:36,524 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:08:36,525 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:08:36,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c [2024-06-27 17:08:37,741 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:08:37,939 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:08:37,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c [2024-06-27 17:08:37,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0affda10f/17bb322125a143c2ae4bb9b741b2fee6/FLAGcd546dff8 [2024-06-27 17:08:37,956 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0affda10f/17bb322125a143c2ae4bb9b741b2fee6 [2024-06-27 17:08:37,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:08:37,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:08:37,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:08:37,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:08:37,964 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:08:37,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:08:37" (1/1) ... [2024-06-27 17:08:37,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a153937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:08:37, skipping insertion in model container [2024-06-27 17:08:37,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:08:37" (1/1) ... [2024-06-27 17:08:37,998 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:08:38,171 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-prod-cons-eq.wvr.c[4419,4432] [2024-06-27 17:08:38,180 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:08:38,189 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-06-27 17:08:38,191 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:08:38,208 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-prod-cons-eq.wvr.c[4419,4432] [2024-06-27 17:08:38,212 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:08:38,216 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:08:38,240 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-prod-cons-eq.wvr.c[4419,4432] [2024-06-27 17:08:38,244 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:08:38,258 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:08:38,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:08:38 WrapperNode [2024-06-27 17:08:38,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:08:38,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:08:38,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:08:38,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:08:38,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:08:38" (1/1) ... [2024-06-27 17:08:38,287 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:08:38" (1/1) ... [2024-06-27 17:08:38,314 INFO L138 Inliner]: procedures = 29, calls = 65, calls flagged for inlining = 26, calls inlined = 32, statements flattened = 385 [2024-06-27 17:08:38,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:08:38,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:08:38,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:08:38,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:08:38,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:08:38" (1/1) ... [2024-06-27 17:08:38,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:08:38" (1/1) ... [2024-06-27 17:08:38,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:08:38" (1/1) ... [2024-06-27 17:08:38,374 INFO L175 MemorySlicer]: Split 24 memory accesses to 4 slices as follows [2, 3, 16, 3]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 6 writes are split as follows [0, 1, 4, 1]. [2024-06-27 17:08:38,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:08:38" (1/1) ... [2024-06-27 17:08:38,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:08:38" (1/1) ... [2024-06-27 17:08:38,388 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:08:38" (1/1) ... [2024-06-27 17:08:38,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:08:38" (1/1) ... [2024-06-27 17:08:38,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:08:38" (1/1) ... [2024-06-27 17:08:38,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:08:38" (1/1) ... [2024-06-27 17:08:38,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:08:38,403 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:08:38,403 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:08:38,403 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:08:38,404 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:08:38" (1/1) ... [2024-06-27 17:08:38,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:08:38,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:08:38,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 17:08:38,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 17:08:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:08:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-06-27 17:08:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-06-27 17:08:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-06-27 17:08:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-06-27 17:08:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-06-27 17:08:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-06-27 17:08:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-06-27 17:08:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-06-27 17:08:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-06-27 17:08:38,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-06-27 17:08:38,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-06-27 17:08:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-06-27 17:08:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-06-27 17:08:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-06-27 17:08:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-06-27 17:08:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-06-27 17:08:38,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-06-27 17:08:38,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-06-27 17:08:38,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-06-27 17:08:38,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-06-27 17:08:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 17:08:38,588 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 17:08:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 17:08:38,588 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 17:08:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 17:08:38,589 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 17:08:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:08:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:08:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 17:08:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:08:38,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:08:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-06-27 17:08:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-06-27 17:08:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-06-27 17:08:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-06-27 17:08:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-06-27 17:08:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-06-27 17:08:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-06-27 17:08:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-06-27 17:08:38,592 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:08:38,742 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:08:38,744 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:08:39,438 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:08:39,439 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:08:39,871 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:08:39,873 INFO L320 CfgBuilder]: Removed 9 assume(true) statements. [2024-06-27 17:08:39,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:08:39 BoogieIcfgContainer [2024-06-27 17:08:39,873 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:08:39,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:08:39,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:08:39,878 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:08:39,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:08:37" (1/3) ... [2024-06-27 17:08:39,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647488ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:08:39, skipping insertion in model container [2024-06-27 17:08:39,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:08:38" (2/3) ... [2024-06-27 17:08:39,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647488ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:08:39, skipping insertion in model container [2024-06-27 17:08:39,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:08:39" (3/3) ... [2024-06-27 17:08:39,882 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2024-06-27 17:08:39,890 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:08:39,898 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:08:39,898 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 17:08:39,898 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:08:39,948 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-06-27 17:08:39,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 107 flow [2024-06-27 17:08:40,010 INFO L124 PetriNetUnfolderBase]: 9/40 cut-off events. [2024-06-27 17:08:40,010 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 17:08:40,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 40 events. 9/40 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-06-27 17:08:40,013 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 43 transitions, 107 flow [2024-06-27 17:08:40,015 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 39 transitions, 96 flow [2024-06-27 17:08:40,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:08:40,026 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;@5c3484e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:08:40,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 17:08:40,036 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:08:40,036 INFO L124 PetriNetUnfolderBase]: 9/38 cut-off events. [2024-06-27 17:08:40,036 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 17:08:40,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:08:40,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] [2024-06-27 17:08:40,038 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:08:40,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:08:40,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1141560316, now seen corresponding path program 1 times [2024-06-27 17:08:40,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:08:40,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283300639] [2024-06-27 17:08:40,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:08:40,052 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:08:40,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:08:40,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:08:40,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-06-27 17:08:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:08:40,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2024-06-27 17:08:40,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:08:40,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:08:40,264 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:08:40,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:08:40,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283300639] [2024-06-27 17:08:40,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283300639] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:08:40,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:08:40,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:08:40,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128548784] [2024-06-27 17:08:40,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:08:40,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:08:40,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:08:40,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:08:40,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:08:40,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 17:08:40,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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 17:08:40,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:08:40,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 17:08:40,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:08:40,547 INFO L124 PetriNetUnfolderBase]: 307/491 cut-off events. [2024-06-27 17:08:40,548 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-06-27 17:08:40,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 491 events. 307/491 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2148 event pairs, 83 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 892. Up to 259 conditions per place. [2024-06-27 17:08:40,553 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 39 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2024-06-27 17:08:40,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 204 flow [2024-06-27 17:08:40,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:08:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:08:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-06-27 17:08:40,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2024-06-27 17:08:40,564 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 96 flow. Second operand 3 states and 75 transitions. [2024-06-27 17:08:40,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 204 flow [2024-06-27 17:08:40,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 188 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 17:08:40,568 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 96 flow [2024-06-27 17:08:40,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2024-06-27 17:08:40,572 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2024-06-27 17:08:40,572 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 96 flow [2024-06-27 17:08:40,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 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 17:08:40,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:08:40,573 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 17:08:40,578 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 (2)] Ended with exit code 0 [2024-06-27 17:08:40,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:08:40,782 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:08:40,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:08:40,783 INFO L85 PathProgramCache]: Analyzing trace with hash 565499726, now seen corresponding path program 1 times [2024-06-27 17:08:40,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:08:40,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216444556] [2024-06-27 17:08:40,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:08:40,784 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:08:40,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:08:40,797 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:08:40,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-06-27 17:08:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:08:40,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2024-06-27 17:08:40,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:08:40,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:08:40,934 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:08:40,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:08:40,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216444556] [2024-06-27 17:08:40,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216444556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:08:40,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:08:40,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:08:40,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583367064] [2024-06-27 17:08:40,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:08:40,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:08:40,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:08:40,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:08:40,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:08:40,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 17:08:40,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:08:40,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:08:40,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 17:08:40,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:08:41,120 INFO L124 PetriNetUnfolderBase]: 333/530 cut-off events. [2024-06-27 17:08:41,120 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-06-27 17:08:41,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 530 events. 333/530 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2423 event pairs, 155 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 480. Up to 322 conditions per place. [2024-06-27 17:08:41,124 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 41 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2024-06-27 17:08:41,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 51 transitions, 215 flow [2024-06-27 17:08:41,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:08:41,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:08:41,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-06-27 17:08:41,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5658914728682171 [2024-06-27 17:08:41,126 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 96 flow. Second operand 3 states and 73 transitions. [2024-06-27 17:08:41,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 51 transitions, 215 flow [2024-06-27 17:08:41,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:08:41,128 INFO L231 Difference]: Finished difference. Result has 40 places, 41 transitions, 112 flow [2024-06-27 17:08:41,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=40, PETRI_TRANSITIONS=41} [2024-06-27 17:08:41,128 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2024-06-27 17:08:41,129 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 112 flow [2024-06-27 17:08:41,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:08:41,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:08:41,129 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, 1, 1] [2024-06-27 17:08:41,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-06-27 17:08:41,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:08:41,335 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:08:41,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:08:41,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1755225697, now seen corresponding path program 1 times [2024-06-27 17:08:41,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:08:41,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78364244] [2024-06-27 17:08:41,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:08:41,337 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:08:41,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:08:41,338 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:08:41,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-06-27 17:08:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:08:41,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-27 17:08:41,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:08:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:08:41,505 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:08:41,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:08:41,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78364244] [2024-06-27 17:08:41,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78364244] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:08:41,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:08:41,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:08:41,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946579024] [2024-06-27 17:08:41,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:08:41,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:08:41,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:08:41,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:08:41,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:08:41,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-27 17:08:41,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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:08:41,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:08:41,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-27 17:08:41,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:08:41,855 INFO L124 PetriNetUnfolderBase]: 685/1047 cut-off events. [2024-06-27 17:08:41,855 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2024-06-27 17:08:41,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2581 conditions, 1047 events. 685/1047 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4357 event pairs, 149 based on Foata normal form. 51/1014 useless extension candidates. Maximal degree in co-relation 1041. Up to 325 conditions per place. [2024-06-27 17:08:41,859 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 63 selfloop transitions, 8 changer transitions 0/76 dead transitions. [2024-06-27 17:08:41,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 76 transitions, 359 flow [2024-06-27 17:08:41,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:08:41,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:08:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2024-06-27 17:08:41,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069767441860465 [2024-06-27 17:08:41,864 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 112 flow. Second operand 5 states and 109 transitions. [2024-06-27 17:08:41,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 76 transitions, 359 flow [2024-06-27 17:08:41,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 76 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:08:41,867 INFO L231 Difference]: Finished difference. Result has 45 places, 46 transitions, 158 flow [2024-06-27 17:08:41,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=45, PETRI_TRANSITIONS=46} [2024-06-27 17:08:41,868 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2024-06-27 17:08:41,868 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 158 flow [2024-06-27 17:08:41,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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:08:41,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:08:41,869 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, 1, 1] [2024-06-27 17:08:41,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-06-27 17:08:42,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:08:42,073 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:08:42,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:08:42,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2023809251, now seen corresponding path program 2 times [2024-06-27 17:08:42,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:08:42,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710703663] [2024-06-27 17:08:42,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:08:42,075 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:08:42,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:08:42,076 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:08:42,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-06-27 17:08:42,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:08:42,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:08:42,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 17:08:42,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:08:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:08:42,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:08:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:08:42,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:08:42,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710703663] [2024-06-27 17:08:42,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1710703663] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:08:42,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:08:42,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-06-27 17:08:42,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373159560] [2024-06-27 17:08:42,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:08:42,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 17:08:42,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:08:42,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 17:08:42,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 17:08:42,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2024-06-27 17:08:42,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 158 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 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:08:42,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:08:42,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2024-06-27 17:08:42,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:08:44,342 INFO L124 PetriNetUnfolderBase]: 6132/9106 cut-off events. [2024-06-27 17:08:44,343 INFO L125 PetriNetUnfolderBase]: For 6072/6072 co-relation queries the response was YES. [2024-06-27 17:08:44,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25954 conditions, 9106 events. 6132/9106 cut-off events. For 6072/6072 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 50069 event pairs, 141 based on Foata normal form. 194/8627 useless extension candidates. Maximal degree in co-relation 10369. Up to 1975 conditions per place. [2024-06-27 17:08:44,450 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 262 selfloop transitions, 63 changer transitions 0/332 dead transitions. [2024-06-27 17:08:44,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 332 transitions, 1899 flow [2024-06-27 17:08:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-06-27 17:08:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-06-27 17:08:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 421 transitions. [2024-06-27 17:08:44,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152998776009792 [2024-06-27 17:08:44,453 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 158 flow. Second operand 19 states and 421 transitions. [2024-06-27 17:08:44,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 332 transitions, 1899 flow [2024-06-27 17:08:44,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 332 transitions, 1899 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 17:08:44,464 INFO L231 Difference]: Finished difference. Result has 67 places, 120 transitions, 653 flow [2024-06-27 17:08:44,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=653, PETRI_PLACES=67, PETRI_TRANSITIONS=120} [2024-06-27 17:08:44,465 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2024-06-27 17:08:44,465 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 120 transitions, 653 flow [2024-06-27 17:08:44,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 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:08:44,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:08:44,466 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, 1, 1, 1, 1, 1] [2024-06-27 17:08:44,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-06-27 17:08:44,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:08:44,670 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:08:44,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:08:44,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1910481432, now seen corresponding path program 1 times [2024-06-27 17:08:44,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:08:44,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221932596] [2024-06-27 17:08:44,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:08:44,672 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:08:44,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:08:44,673 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:08:44,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-06-27 17:08:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:08:44,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-27 17:08:44,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:08:44,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:08:44,912 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:08:44,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:08:44,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221932596] [2024-06-27 17:08:44,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221932596] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:08:44,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:08:44,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:08:44,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655235936] [2024-06-27 17:08:44,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:08:44,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:08:44,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:08:44,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:08:44,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:08:44,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 17:08:44,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 120 transitions, 653 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:08:44,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:08:44,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 17:08:44,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:08:46,108 INFO L124 PetriNetUnfolderBase]: 4468/7159 cut-off events. [2024-06-27 17:08:46,108 INFO L125 PetriNetUnfolderBase]: For 10649/10851 co-relation queries the response was YES. [2024-06-27 17:08:46,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23014 conditions, 7159 events. 4468/7159 cut-off events. For 10649/10851 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 44427 event pairs, 2514 based on Foata normal form. 60/6444 useless extension candidates. Maximal degree in co-relation 17753. Up to 5928 conditions per place. [2024-06-27 17:08:46,155 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 57 selfloop transitions, 2 changer transitions 17/138 dead transitions. [2024-06-27 17:08:46,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 138 transitions, 844 flow [2024-06-27 17:08:46,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:08:46,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:08:46,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-06-27 17:08:46,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5523255813953488 [2024-06-27 17:08:46,157 INFO L175 Difference]: Start difference. First operand has 67 places, 120 transitions, 653 flow. Second operand 4 states and 95 transitions. [2024-06-27 17:08:46,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 138 transitions, 844 flow [2024-06-27 17:08:46,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 138 transitions, 844 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 17:08:46,183 INFO L231 Difference]: Finished difference. Result has 72 places, 121 transitions, 671 flow [2024-06-27 17:08:46,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=671, PETRI_PLACES=72, PETRI_TRANSITIONS=121} [2024-06-27 17:08:46,184 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 32 predicate places. [2024-06-27 17:08:46,184 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 121 transitions, 671 flow [2024-06-27 17:08:46,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:08:46,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:08:46,185 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, 1, 1, 1, 1, 1, 1] [2024-06-27 17:08:46,189 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 (6)] Ended with exit code 0 [2024-06-27 17:08:46,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:08:46,391 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:08:46,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:08:46,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2065186069, now seen corresponding path program 1 times [2024-06-27 17:08:46,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:08:46,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777574507] [2024-06-27 17:08:46,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:08:46,393 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:08:46,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:08:46,394 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:08:46,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-06-27 17:08:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:08:46,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-27 17:08:46,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:08:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:08:46,736 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:08:46,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:08:46,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777574507] [2024-06-27 17:08:46,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777574507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:08:46,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:08:46,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:08:46,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400982172] [2024-06-27 17:08:46,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:08:46,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:08:46,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:08:46,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:08:46,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:08:46,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 17:08:46,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 121 transitions, 671 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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:08:46,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:08:46,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 17:08:46,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:08:47,982 INFO L124 PetriNetUnfolderBase]: 4489/7218 cut-off events. [2024-06-27 17:08:47,982 INFO L125 PetriNetUnfolderBase]: For 11907/12109 co-relation queries the response was YES. [2024-06-27 17:08:48,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23807 conditions, 7218 events. 4489/7218 cut-off events. For 11907/12109 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 45016 event pairs, 2514 based on Foata normal form. 78/6516 useless extension candidates. Maximal degree in co-relation 23780. Up to 5929 conditions per place. [2024-06-27 17:08:48,034 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 58 selfloop transitions, 2 changer transitions 24/146 dead transitions. [2024-06-27 17:08:48,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 146 transitions, 907 flow [2024-06-27 17:08:48,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:08:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:08:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2024-06-27 17:08:48,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5209302325581395 [2024-06-27 17:08:48,036 INFO L175 Difference]: Start difference. First operand has 72 places, 121 transitions, 671 flow. Second operand 5 states and 112 transitions. [2024-06-27 17:08:48,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 146 transitions, 907 flow [2024-06-27 17:08:48,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 146 transitions, 903 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:08:48,062 INFO L231 Difference]: Finished difference. Result has 77 places, 122 transitions, 689 flow [2024-06-27 17:08:48,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=689, PETRI_PLACES=77, PETRI_TRANSITIONS=122} [2024-06-27 17:08:48,062 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2024-06-27 17:08:48,063 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 122 transitions, 689 flow [2024-06-27 17:08:48,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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:08:48,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:08:48,063 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, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:08:48,080 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 17:08:48,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:08:48,268 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:08:48,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:08:48,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1768257067, now seen corresponding path program 1 times [2024-06-27 17:08:48,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:08:48,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917142676] [2024-06-27 17:08:48,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:08:48,271 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:08:48,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:08:48,272 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:08:48,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-06-27 17:08:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:08:48,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-27 17:08:48,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:08:48,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 17:08:48,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:08:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 17:08:48,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:08:48,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917142676] [2024-06-27 17:08:48,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917142676] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:08:48,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:08:48,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-06-27 17:08:48,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612969141] [2024-06-27 17:08:48,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:08:48,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:08:48,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:08:48,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:08:48,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:08:48,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 17:08:48,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 122 transitions, 689 flow. Second operand has 10 states, 10 states have (on average 14.1) internal successors, (141), 10 states have internal predecessors, (141), 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:08:48,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:08:48,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 17:08:48,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:08:51,046 INFO L124 PetriNetUnfolderBase]: 8924/14271 cut-off events. [2024-06-27 17:08:51,046 INFO L125 PetriNetUnfolderBase]: For 30979/31379 co-relation queries the response was YES. [2024-06-27 17:08:51,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50231 conditions, 14271 events. 8924/14271 cut-off events. For 30979/31379 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 99347 event pairs, 5028 based on Foata normal form. 98/12821 useless extension candidates. Maximal degree in co-relation 50196. Up to 5925 conditions per place. [2024-06-27 17:08:51,187 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 109 selfloop transitions, 8 changer transitions 0/179 dead transitions. [2024-06-27 17:08:51,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 179 transitions, 1160 flow [2024-06-27 17:08:51,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:08:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:08:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-27 17:08:51,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2024-06-27 17:08:51,189 INFO L175 Difference]: Start difference. First operand has 77 places, 122 transitions, 689 flow. Second operand 8 states and 152 transitions. [2024-06-27 17:08:51,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 179 transitions, 1160 flow [2024-06-27 17:08:51,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 179 transitions, 1144 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-27 17:08:51,272 INFO L231 Difference]: Finished difference. Result has 83 places, 127 transitions, 728 flow [2024-06-27 17:08:51,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=728, PETRI_PLACES=83, PETRI_TRANSITIONS=127} [2024-06-27 17:08:51,273 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 43 predicate places. [2024-06-27 17:08:51,274 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 127 transitions, 728 flow [2024-06-27 17:08:51,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.1) internal successors, (141), 10 states have internal predecessors, (141), 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:08:51,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:08:51,274 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:08:51,290 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 17:08:51,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:08:51,479 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:08:51,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:08:51,480 INFO L85 PathProgramCache]: Analyzing trace with hash 571543947, now seen corresponding path program 1 times [2024-06-27 17:08:51,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:08:51,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218176883] [2024-06-27 17:08:51,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:08:51,481 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:08:51,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:08:51,482 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:08:51,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-06-27 17:08:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:08:51,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:08:51,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:08:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 17:08:51,821 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:08:51,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:08:51,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218176883] [2024-06-27 17:08:51,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218176883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:08:51,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:08:51,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:08:51,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066271026] [2024-06-27 17:08:51,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:08:51,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:08:51,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:08:51,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:08:51,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:08:51,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 17:08:51,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 127 transitions, 728 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:08:51,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:08:51,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 17:08:51,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:08:53,858 INFO L124 PetriNetUnfolderBase]: 8938/14329 cut-off events. [2024-06-27 17:08:53,858 INFO L125 PetriNetUnfolderBase]: For 26866/27278 co-relation queries the response was YES. [2024-06-27 17:08:53,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49211 conditions, 14329 events. 8938/14329 cut-off events. For 26866/27278 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 99358 event pairs, 5032 based on Foata normal form. 142/12925 useless extension candidates. Maximal degree in co-relation 49173. Up to 11856 conditions per place. [2024-06-27 17:08:53,952 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 63 selfloop transitions, 3 changer transitions 19/147 dead transitions. [2024-06-27 17:08:53,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 147 transitions, 971 flow [2024-06-27 17:08:53,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:08:53,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:08:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-06-27 17:08:53,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5348837209302325 [2024-06-27 17:08:53,953 INFO L175 Difference]: Start difference. First operand has 83 places, 127 transitions, 728 flow. Second operand 4 states and 92 transitions. [2024-06-27 17:08:53,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 147 transitions, 971 flow [2024-06-27 17:08:54,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 147 transitions, 954 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-27 17:08:54,025 INFO L231 Difference]: Finished difference. Result has 86 places, 128 transitions, 736 flow [2024-06-27 17:08:54,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=736, PETRI_PLACES=86, PETRI_TRANSITIONS=128} [2024-06-27 17:08:54,026 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 46 predicate places. [2024-06-27 17:08:54,026 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 128 transitions, 736 flow [2024-06-27 17:08:54,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:08:54,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:08:54,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:08:54,048 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 17:08:54,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:08:54,232 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:08:54,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:08:54,232 INFO L85 PathProgramCache]: Analyzing trace with hash 975089856, now seen corresponding path program 1 times [2024-06-27 17:08:54,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:08:54,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387120368] [2024-06-27 17:08:54,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:08:54,233 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:08:54,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:08:54,234 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:08:54,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-06-27 17:08:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:08:54,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 17:08:54,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:08:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 17:08:54,603 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:08:54,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:08:54,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387120368] [2024-06-27 17:08:54,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387120368] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:08:54,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:08:54,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:08:54,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013249563] [2024-06-27 17:08:54,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:08:54,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:08:54,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:08:54,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:08:54,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:08:54,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 17:08:54,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 128 transitions, 736 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:08:54,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:08:54,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 17:08:54,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:08:56,953 INFO L124 PetriNetUnfolderBase]: 10206/17019 cut-off events. [2024-06-27 17:08:56,954 INFO L125 PetriNetUnfolderBase]: For 32329/32667 co-relation queries the response was YES. [2024-06-27 17:08:57,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57887 conditions, 17019 events. 10206/17019 cut-off events. For 32329/32667 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 125170 event pairs, 6056 based on Foata normal form. 912/16483 useless extension candidates. Maximal degree in co-relation 57848. Up to 12404 conditions per place. [2024-06-27 17:08:57,109 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 67 selfloop transitions, 2 changer transitions 28/159 dead transitions. [2024-06-27 17:08:57,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 159 transitions, 1066 flow [2024-06-27 17:08:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:08:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:08:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2024-06-27 17:08:57,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5465116279069767 [2024-06-27 17:08:57,112 INFO L175 Difference]: Start difference. First operand has 86 places, 128 transitions, 736 flow. Second operand 4 states and 94 transitions. [2024-06-27 17:08:57,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 159 transitions, 1066 flow [2024-06-27 17:08:57,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 159 transitions, 1053 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-27 17:08:57,227 INFO L231 Difference]: Finished difference. Result has 88 places, 129 transitions, 757 flow [2024-06-27 17:08:57,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=757, PETRI_PLACES=88, PETRI_TRANSITIONS=129} [2024-06-27 17:08:57,228 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 48 predicate places. [2024-06-27 17:08:57,228 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 129 transitions, 757 flow [2024-06-27 17:08:57,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:08:57,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:08:57,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:08:57,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-06-27 17:08:57,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:08:57,437 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:08:57,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:08:57,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1032143410, now seen corresponding path program 1 times [2024-06-27 17:08:57,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:08:57,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673838647] [2024-06-27 17:08:57,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:08:57,438 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:08:57,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:08:57,439 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:08:57,443 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:08:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:08:58,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 17:08:58,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:08:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 17:08:58,249 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:08:58,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:08:58,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673838647] [2024-06-27 17:08:58,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673838647] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:08:58,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:08:58,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:08:58,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255920915] [2024-06-27 17:08:58,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:08:58,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:08:58,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:08:58,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:08:58,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:08:58,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2024-06-27 17:08:58,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 129 transitions, 757 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:08:58,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:08:58,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2024-06-27 17:08:58,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:00,961 INFO L124 PetriNetUnfolderBase]: 10152/16867 cut-off events. [2024-06-27 17:09:00,962 INFO L125 PetriNetUnfolderBase]: For 40354/40720 co-relation queries the response was YES. [2024-06-27 17:09:01,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59582 conditions, 16867 events. 10152/16867 cut-off events. For 40354/40720 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 124012 event pairs, 5972 based on Foata normal form. 908/16299 useless extension candidates. Maximal degree in co-relation 59542. Up to 12338 conditions per place. [2024-06-27 17:09:01,176 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 66 selfloop transitions, 2 changer transitions 32/162 dead transitions. [2024-06-27 17:09:01,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 162 transitions, 1102 flow [2024-06-27 17:09:01,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:09:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:09:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-06-27 17:09:01,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49767441860465117 [2024-06-27 17:09:01,178 INFO L175 Difference]: Start difference. First operand has 88 places, 129 transitions, 757 flow. Second operand 5 states and 107 transitions. [2024-06-27 17:09:01,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 162 transitions, 1102 flow [2024-06-27 17:09:01,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 162 transitions, 1099 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:09:01,309 INFO L231 Difference]: Finished difference. Result has 93 places, 130 transitions, 791 flow [2024-06-27 17:09:01,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=791, PETRI_PLACES=93, PETRI_TRANSITIONS=130} [2024-06-27 17:09:01,310 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 53 predicate places. [2024-06-27 17:09:01,310 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 130 transitions, 791 flow [2024-06-27 17:09:01,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:09:01,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:01,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:01,316 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 (11)] Ended with exit code 0 [2024-06-27 17:09:01,516 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:09:01,517 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:09:01,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:01,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1956752214, now seen corresponding path program 1 times [2024-06-27 17:09:01,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:09:01,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875060876] [2024-06-27 17:09:01,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:01,518 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:09:01,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:09:01,519 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:09:01,521 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:09:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:02,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 44 conjunts are in the unsatisfiable core [2024-06-27 17:09:02,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:09:02,766 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 11 treesize of output 7 [2024-06-27 17:09:04,841 INFO L349 Elim1Store]: treesize reduction 1514, result has 22.2 percent of original size [2024-06-27 17:09:04,841 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 24 new quantified variables, introduced 120 case distinctions, treesize of input 651 treesize of output 642 [2024-06-27 17:09:04,888 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 17:09:04,889 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 628 treesize of output 528 [2024-06-27 17:09:04,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 555 treesize of output 435 [2024-06-27 17:09:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:09:18,225 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:09:19,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:09:19,493 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 541 treesize of output 490 [2024-06-27 17:10:31,421 WARN L293 SmtUtils]: Spent 1.19m on a formula simplification. DAG size of input: 1710 DAG size of output: 1341 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-27 17:10:31,422 INFO L349 Elim1Store]: treesize reduction 1233, result has 82.8 percent of original size [2024-06-27 17:10:31,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 32 select indices, 32 select index equivalence classes, 0 disjoint index pairs (out of 496 index pairs), introduced 40 new quantified variables, introduced 496 case distinctions, treesize of input 1152 treesize of output 6173 Killed by 15