./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-commit-1.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-commit-1.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 73c55a951ef2b92a665c2c32d76e33a5a03bdbde67ee3c8e6748faf493088c7e --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:48:35,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:48:35,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 16:48:35,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:48:35,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:48:35,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:48:35,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:48:35,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:48:35,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:48:35,306 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:48:35,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:48:35,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:48:35,308 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:48:35,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:48:35,310 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:48:35,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:48:35,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:48:35,311 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:48:35,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:48:35,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:48:35,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:48:35,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:48:35,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:48:35,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:48:35,313 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:48:35,313 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:48:35,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:48:35,315 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:48:35,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:48:35,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:48:35,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:48:35,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:48:35,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:48:35,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:48:35,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:48:35,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:48:35,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:48:35,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:48:35,319 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:48:35,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:48:35,319 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:48:35,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:48:35,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:48:35,320 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 -> 73c55a951ef2b92a665c2c32d76e33a5a03bdbde67ee3c8e6748faf493088c7e [2024-06-27 16:48:35,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:48:35,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:48:35,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:48:35,570 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:48:35,570 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:48:35,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2024-06-27 16:48:36,776 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:48:36,964 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:48:36,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2024-06-27 16:48:36,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6936742bc/de7bbc1d90514e64bf17b8c4a49d6312/FLAG2b4ce5a1e [2024-06-27 16:48:36,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6936742bc/de7bbc1d90514e64bf17b8c4a49d6312 [2024-06-27 16:48:36,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:48:36,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:48:36,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:48:36,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:48:36,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:48:36,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:48:36" (1/1) ... [2024-06-27 16:48:36,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b3f542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:48:36, skipping insertion in model container [2024-06-27 16:48:36,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:48:36" (1/1) ... [2024-06-27 16:48:37,017 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:48:37,210 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-commit-1.wvr.c[4643,4656] [2024-06-27 16:48:37,219 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:48:37,228 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:48:37,254 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-commit-1.wvr.c[4643,4656] [2024-06-27 16:48:37,257 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:48:37,273 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:48:37,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:48:37 WrapperNode [2024-06-27 16:48:37,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:48:37,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:48:37,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:48:37,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:48:37,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:48:37" (1/1) ... [2024-06-27 16:48:37,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:48:37" (1/1) ... [2024-06-27 16:48:37,335 INFO L138 Inliner]: procedures = 24, calls = 53, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 337 [2024-06-27 16:48:37,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:48:37,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:48:37,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:48:37,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:48:37,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:48:37" (1/1) ... [2024-06-27 16:48:37,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:48:37" (1/1) ... [2024-06-27 16:48:37,351 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:48:37" (1/1) ... [2024-06-27 16:48:37,377 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-06-27 16:48:37,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:48:37" (1/1) ... [2024-06-27 16:48:37,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:48:37" (1/1) ... [2024-06-27 16:48:37,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:48:37" (1/1) ... [2024-06-27 16:48:37,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:48:37" (1/1) ... [2024-06-27 16:48:37,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:48:37" (1/1) ... [2024-06-27 16:48:37,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:48:37" (1/1) ... [2024-06-27 16:48:37,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:48:37,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:48:37,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:48:37,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:48:37,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:48:37" (1/1) ... [2024-06-27 16:48:37,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:48:37,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:48:37,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 16:48:37,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 16:48:37,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:48:37,483 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:48:37,483 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:48:37,483 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:48:37,483 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:48:37,483 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 16:48:37,484 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 16:48:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:48:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 16:48:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 16:48:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 16:48:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 16:48:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 16:48:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 16:48:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:48:37,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:48:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 16:48:37,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 16:48:37,489 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 16:48:37,595 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:48:37,597 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:48:37,988 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:48:37,989 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:48:38,313 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:48:38,314 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-06-27 16:48:38,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:48:38 BoogieIcfgContainer [2024-06-27 16:48:38,315 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:48:38,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:48:38,318 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:48:38,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:48:38,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:48:36" (1/3) ... [2024-06-27 16:48:38,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347df504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:48:38, skipping insertion in model container [2024-06-27 16:48:38,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:48:37" (2/3) ... [2024-06-27 16:48:38,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347df504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:48:38, skipping insertion in model container [2024-06-27 16:48:38,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:48:38" (3/3) ... [2024-06-27 16:48:38,324 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2024-06-27 16:48:38,332 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:48:38,340 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:48:38,341 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:48:38,341 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:48:38,463 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-06-27 16:48:38,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 48 transitions, 117 flow [2024-06-27 16:48:38,538 INFO L124 PetriNetUnfolderBase]: 9/45 cut-off events. [2024-06-27 16:48:38,538 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:48:38,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 9/45 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 81 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2024-06-27 16:48:38,542 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 48 transitions, 117 flow [2024-06-27 16:48:38,545 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 44 transitions, 106 flow [2024-06-27 16:48:38,553 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:48:38,560 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;@15a8d009, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:48:38,560 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 16:48:38,575 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:48:38,576 INFO L124 PetriNetUnfolderBase]: 9/43 cut-off events. [2024-06-27 16:48:38,576 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:48:38,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:48:38,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:48:38,578 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 16:48:38,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:48:38,584 INFO L85 PathProgramCache]: Analyzing trace with hash -102076622, now seen corresponding path program 1 times [2024-06-27 16:48:38,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:48:38,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142590926] [2024-06-27 16:48:38,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:38,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:48:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:48:38,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:48:38,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142590926] [2024-06-27 16:48:38,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142590926] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:48:38,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:48:38,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:48:38,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490102771] [2024-06-27 16:48:38,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:48:38,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-06-27 16:48:38,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:48:38,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-06-27 16:48:38,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-06-27 16:48:38,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:48:38,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 106 flow. Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:48:38,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:48:38,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:48:38,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:48:39,419 INFO L124 PetriNetUnfolderBase]: 2548/3637 cut-off events. [2024-06-27 16:48:39,419 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2024-06-27 16:48:39,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7470 conditions, 3637 events. 2548/3637 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 16635 event pairs, 2146 based on Foata normal form. 0/3229 useless extension candidates. Maximal degree in co-relation 7063. Up to 3626 conditions per place. [2024-06-27 16:48:39,440 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 37 selfloop transitions, 0 changer transitions 0/41 dead transitions. [2024-06-27 16:48:39,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 41 transitions, 174 flow [2024-06-27 16:48:39,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-06-27 16:48:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-06-27 16:48:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2024-06-27 16:48:39,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-06-27 16:48:39,453 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 106 flow. Second operand 2 states and 54 transitions. [2024-06-27 16:48:39,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 41 transitions, 174 flow [2024-06-27 16:48:39,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 162 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 16:48:39,459 INFO L231 Difference]: Finished difference. Result has 40 places, 41 transitions, 88 flow [2024-06-27 16:48:39,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=88, PETRI_PLACES=40, PETRI_TRANSITIONS=41} [2024-06-27 16:48:39,464 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2024-06-27 16:48:39,465 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 88 flow [2024-06-27 16:48:39,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:48:39,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:48:39,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:48:39,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:48:39,466 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 16:48:39,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:48:39,467 INFO L85 PathProgramCache]: Analyzing trace with hash 665032564, now seen corresponding path program 1 times [2024-06-27 16:48:39,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:48:39,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722857072] [2024-06-27 16:48:39,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:39,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:48:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:48:39,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:48:39,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722857072] [2024-06-27 16:48:39,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722857072] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:48:39,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:48:39,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:48:39,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108927546] [2024-06-27 16:48:39,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:48:39,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:48:39,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:48:39,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:48:39,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:48:39,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:48:39,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:48:39,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:48:39,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:48:39,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:48:40,269 INFO L124 PetriNetUnfolderBase]: 3499/4990 cut-off events. [2024-06-27 16:48:40,270 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-06-27 16:48:40,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10072 conditions, 4990 events. 3499/4990 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 25016 event pairs, 876 based on Foata normal form. 1/4374 useless extension candidates. Maximal degree in co-relation 10069. Up to 3852 conditions per place. [2024-06-27 16:48:40,292 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 56 selfloop transitions, 4 changer transitions 1/65 dead transitions. [2024-06-27 16:48:40,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 263 flow [2024-06-27 16:48:40,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:48:40,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:48:40,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-06-27 16:48:40,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2024-06-27 16:48:40,296 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 88 flow. Second operand 3 states and 83 transitions. [2024-06-27 16:48:40,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 263 flow [2024-06-27 16:48:40,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 65 transitions, 263 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:48:40,300 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 114 flow [2024-06-27 16:48:40,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2024-06-27 16:48:40,301 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-06-27 16:48:40,302 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 114 flow [2024-06-27 16:48:40,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:48:40,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:48:40,302 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:48:40,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 16:48:40,303 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 16:48:40,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:48:40,306 INFO L85 PathProgramCache]: Analyzing trace with hash -886347784, now seen corresponding path program 1 times [2024-06-27 16:48:40,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:48:40,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615939355] [2024-06-27 16:48:40,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:40,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:48:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:48:40,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:48:40,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615939355] [2024-06-27 16:48:40,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615939355] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:48:40,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:48:40,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:48:40,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286546096] [2024-06-27 16:48:40,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:48:40,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:48:40,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:48:40,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:48:40,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:48:40,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:48:40,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:48:40,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:48:40,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:48:40,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:48:41,112 INFO L124 PetriNetUnfolderBase]: 4888/7036 cut-off events. [2024-06-27 16:48:41,113 INFO L125 PetriNetUnfolderBase]: For 579/579 co-relation queries the response was YES. [2024-06-27 16:48:41,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15083 conditions, 7036 events. 4888/7036 cut-off events. For 579/579 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 35526 event pairs, 2384 based on Foata normal form. 165/6301 useless extension candidates. Maximal degree in co-relation 15078. Up to 3648 conditions per place. [2024-06-27 16:48:41,145 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 65 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-06-27 16:48:41,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 71 transitions, 310 flow [2024-06-27 16:48:41,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:48:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:48:41,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-06-27 16:48:41,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-06-27 16:48:41,147 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 114 flow. Second operand 3 states and 87 transitions. [2024-06-27 16:48:41,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 71 transitions, 310 flow [2024-06-27 16:48:41,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 307 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:48:41,150 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 118 flow [2024-06-27 16:48:41,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2024-06-27 16:48:41,151 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-06-27 16:48:41,151 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 118 flow [2024-06-27 16:48:41,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:48:41,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:48:41,151 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:48:41,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 16:48:41,152 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 16:48:41,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:48:41,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1401038186, now seen corresponding path program 1 times [2024-06-27 16:48:41,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:48:41,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072065878] [2024-06-27 16:48:41,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:41,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:48:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:48:41,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:48:41,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072065878] [2024-06-27 16:48:41,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072065878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:48:41,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:48:41,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:48:41,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111797691] [2024-06-27 16:48:41,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:48:41,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:48:41,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:48:41,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:48:41,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:48:41,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:48:41,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:48:41,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:48:41,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:48:41,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:48:41,844 INFO L124 PetriNetUnfolderBase]: 3703/5358 cut-off events. [2024-06-27 16:48:41,845 INFO L125 PetriNetUnfolderBase]: For 658/658 co-relation queries the response was YES. [2024-06-27 16:48:41,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11733 conditions, 5358 events. 3703/5358 cut-off events. For 658/658 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 25780 event pairs, 1275 based on Foata normal form. 90/4779 useless extension candidates. Maximal degree in co-relation 11727. Up to 4000 conditions per place. [2024-06-27 16:48:41,865 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 54 selfloop transitions, 2 changer transitions 5/65 dead transitions. [2024-06-27 16:48:41,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 285 flow [2024-06-27 16:48:41,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:48:41,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:48:41,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-06-27 16:48:41,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2024-06-27 16:48:41,867 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 118 flow. Second operand 3 states and 82 transitions. [2024-06-27 16:48:41,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 285 flow [2024-06-27 16:48:41,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 65 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:48:41,869 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 124 flow [2024-06-27 16:48:41,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2024-06-27 16:48:41,870 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2024-06-27 16:48:41,871 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 124 flow [2024-06-27 16:48:41,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:48:41,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:48:41,871 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:48:41,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 16:48:41,872 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 16:48:41,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:48:41,872 INFO L85 PathProgramCache]: Analyzing trace with hash -664395841, now seen corresponding path program 1 times [2024-06-27 16:48:41,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:48:41,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780083751] [2024-06-27 16:48:41,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:41,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:48:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:41,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:48:41,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:48:41,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780083751] [2024-06-27 16:48:41,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780083751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:48:41,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:48:41,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:48:41,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510693045] [2024-06-27 16:48:41,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:48:41,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:48:41,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:48:41,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:48:41,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:48:41,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:48:41,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 124 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 16:48:41,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:48:41,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:48:41,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:48:42,246 INFO L124 PetriNetUnfolderBase]: 2561/3734 cut-off events. [2024-06-27 16:48:42,247 INFO L125 PetriNetUnfolderBase]: For 801/801 co-relation queries the response was YES. [2024-06-27 16:48:42,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8246 conditions, 3734 events. 2561/3734 cut-off events. For 801/801 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 16251 event pairs, 1346 based on Foata normal form. 62/3266 useless extension candidates. Maximal degree in co-relation 8239. Up to 2767 conditions per place. [2024-06-27 16:48:42,264 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 48 selfloop transitions, 2 changer transitions 7/61 dead transitions. [2024-06-27 16:48:42,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 61 transitions, 275 flow [2024-06-27 16:48:42,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:48:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:48:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-06-27 16:48:42,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-27 16:48:42,266 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 124 flow. Second operand 3 states and 76 transitions. [2024-06-27 16:48:42,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 61 transitions, 275 flow [2024-06-27 16:48:42,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 61 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:48:42,268 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 134 flow [2024-06-27 16:48:42,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2024-06-27 16:48:42,269 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2024-06-27 16:48:42,269 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 134 flow [2024-06-27 16:48:42,269 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 16:48:42,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:48:42,270 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:48:42,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 16:48:42,270 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 16:48:42,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:48:42,271 INFO L85 PathProgramCache]: Analyzing trace with hash -802486131, now seen corresponding path program 1 times [2024-06-27 16:48:42,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:48:42,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897318380] [2024-06-27 16:48:42,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:42,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:48:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:42,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:48:42,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:48:42,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897318380] [2024-06-27 16:48:42,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897318380] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:48:42,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:48:42,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:48:42,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014393775] [2024-06-27 16:48:42,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:48:42,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:48:42,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:48:42,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:48:42,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:48:42,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:48:42,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:48:42,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:48:42,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:48:42,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:48:42,797 INFO L124 PetriNetUnfolderBase]: 3173/4706 cut-off events. [2024-06-27 16:48:42,798 INFO L125 PetriNetUnfolderBase]: For 773/773 co-relation queries the response was YES. [2024-06-27 16:48:42,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10442 conditions, 4706 events. 3173/4706 cut-off events. For 773/773 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 22250 event pairs, 2856 based on Foata normal form. 56/4044 useless extension candidates. Maximal degree in co-relation 10434. Up to 3723 conditions per place. [2024-06-27 16:48:42,818 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 40 selfloop transitions, 2 changer transitions 30/76 dead transitions. [2024-06-27 16:48:42,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 76 transitions, 346 flow [2024-06-27 16:48:42,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:48:42,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:48:42,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2024-06-27 16:48:42,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-27 16:48:42,820 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 134 flow. Second operand 5 states and 104 transitions. [2024-06-27 16:48:42,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 76 transitions, 346 flow [2024-06-27 16:48:42,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 76 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:48:42,823 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 154 flow [2024-06-27 16:48:42,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2024-06-27 16:48:42,824 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2024-06-27 16:48:42,824 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 154 flow [2024-06-27 16:48:42,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:48:42,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:48:42,824 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:48:42,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 16:48:42,825 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 16:48:42,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:48:42,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1658302438, now seen corresponding path program 1 times [2024-06-27 16:48:42,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:48:42,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411012374] [2024-06-27 16:48:42,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:42,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:48:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:48:43,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:48:43,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411012374] [2024-06-27 16:48:43,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411012374] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:48:43,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:48:43,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:48:43,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176863865] [2024-06-27 16:48:43,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:48:43,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:48:43,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:48:43,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:48:43,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:48:43,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:48:43,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:48:43,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:48:43,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:48:43,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:48:43,500 INFO L124 PetriNetUnfolderBase]: 3336/4961 cut-off events. [2024-06-27 16:48:43,500 INFO L125 PetriNetUnfolderBase]: For 908/908 co-relation queries the response was YES. [2024-06-27 16:48:43,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11118 conditions, 4961 events. 3336/4961 cut-off events. For 908/908 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 23602 event pairs, 3018 based on Foata normal form. 14/4235 useless extension candidates. Maximal degree in co-relation 11107. Up to 3721 conditions per place. [2024-06-27 16:48:43,518 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 40 selfloop transitions, 3 changer transitions 30/77 dead transitions. [2024-06-27 16:48:43,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 77 transitions, 390 flow [2024-06-27 16:48:43,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:48:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:48:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-06-27 16:48:43,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052083333333334 [2024-06-27 16:48:43,520 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 154 flow. Second operand 4 states and 97 transitions. [2024-06-27 16:48:43,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 77 transitions, 390 flow [2024-06-27 16:48:43,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 77 transitions, 366 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-27 16:48:43,528 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 158 flow [2024-06-27 16:48:43,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-06-27 16:48:43,529 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2024-06-27 16:48:43,529 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 158 flow [2024-06-27 16:48:43,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:48:43,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:48:43,530 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:48:43,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 16:48:43,530 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 16:48:43,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:48:43,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2115243705, now seen corresponding path program 1 times [2024-06-27 16:48:43,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:48:43,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374297833] [2024-06-27 16:48:43,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:43,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:48:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:48:43,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:48:43,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374297833] [2024-06-27 16:48:43,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374297833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:48:43,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:48:43,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:48:43,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967312971] [2024-06-27 16:48:43,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:48:43,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:48:43,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:48:43,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:48:43,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:48:43,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:48:43,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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 16:48:43,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:48:43,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:48:43,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:48:44,260 INFO L124 PetriNetUnfolderBase]: 3297/4894 cut-off events. [2024-06-27 16:48:44,260 INFO L125 PetriNetUnfolderBase]: For 809/809 co-relation queries the response was YES. [2024-06-27 16:48:44,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10865 conditions, 4894 events. 3297/4894 cut-off events. For 809/809 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 23330 event pairs, 2984 based on Foata normal form. 10/4168 useless extension candidates. Maximal degree in co-relation 10854. Up to 3719 conditions per place. [2024-06-27 16:48:44,282 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 41 selfloop transitions, 3 changer transitions 24/72 dead transitions. [2024-06-27 16:48:44,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 356 flow [2024-06-27 16:48:44,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:48:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:48:44,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2024-06-27 16:48:44,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4739583333333333 [2024-06-27 16:48:44,285 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 158 flow. Second operand 4 states and 91 transitions. [2024-06-27 16:48:44,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 356 flow [2024-06-27 16:48:44,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 346 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 16:48:44,289 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 166 flow [2024-06-27 16:48:44,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-06-27 16:48:44,291 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2024-06-27 16:48:44,292 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 166 flow [2024-06-27 16:48:44,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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 16:48:44,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:48:44,293 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:48:44,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 16:48:44,294 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 16:48:44,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:48:44,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1670686615, now seen corresponding path program 1 times [2024-06-27 16:48:44,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:48:44,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910932944] [2024-06-27 16:48:44,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:44,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:48:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:48:44,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:48:44,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910932944] [2024-06-27 16:48:44,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910932944] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:48:44,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779038061] [2024-06-27 16:48:44,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:44,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:48:44,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:48:44,530 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:48:44,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-27 16:48:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:44,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 16:48:44,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:48:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:48:44,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:48:44,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779038061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:48:44,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 16:48:44,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-06-27 16:48:44,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682229584] [2024-06-27 16:48:44,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:48:44,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:48:44,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:48:44,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:48:44,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 16:48:44,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:48:44,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 166 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 16:48:44,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:48:44,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:48:44,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:48:45,427 INFO L124 PetriNetUnfolderBase]: 5255/7615 cut-off events. [2024-06-27 16:48:45,427 INFO L125 PetriNetUnfolderBase]: For 2102/2102 co-relation queries the response was YES. [2024-06-27 16:48:45,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17550 conditions, 7615 events. 5255/7615 cut-off events. For 2102/2102 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 35172 event pairs, 2749 based on Foata normal form. 156/6710 useless extension candidates. Maximal degree in co-relation 17538. Up to 2981 conditions per place. [2024-06-27 16:48:45,479 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 85 selfloop transitions, 9 changer transitions 0/98 dead transitions. [2024-06-27 16:48:45,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 98 transitions, 498 flow [2024-06-27 16:48:45,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:48:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:48:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-06-27 16:48:45,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2024-06-27 16:48:45,481 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 166 flow. Second operand 4 states and 115 transitions. [2024-06-27 16:48:45,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 98 transitions, 498 flow [2024-06-27 16:48:45,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 98 transitions, 488 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 16:48:45,485 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 219 flow [2024-06-27 16:48:45,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2024-06-27 16:48:45,486 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2024-06-27 16:48:45,486 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 219 flow [2024-06-27 16:48:45,486 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 16:48:45,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:48:45,487 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:48:45,510 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 16:48:45,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:48:45,702 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 16:48:45,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:48:45,703 INFO L85 PathProgramCache]: Analyzing trace with hash -695731987, now seen corresponding path program 1 times [2024-06-27 16:48:45,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:48:45,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64935881] [2024-06-27 16:48:45,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:45,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:48:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:48:45,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:48:45,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64935881] [2024-06-27 16:48:45,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64935881] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:48:45,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27566954] [2024-06-27 16:48:45,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:45,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:48:45,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:48:45,904 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:48:45,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-27 16:48:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:46,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 16:48:46,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:48:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:48:46,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:48:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:48:46,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27566954] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:48:46,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:48:46,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-06-27 16:48:46,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570471231] [2024-06-27 16:48:46,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:48:46,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 16:48:46,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:48:46,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 16:48:46,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-06-27 16:48:46,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:48:46,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 219 flow. Second operand has 12 states, 12 states have (on average 11.666666666666666) internal successors, (140), 12 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:48:46,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:48:46,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:48:46,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:48:47,179 INFO L124 PetriNetUnfolderBase]: 6007/8805 cut-off events. [2024-06-27 16:48:47,180 INFO L125 PetriNetUnfolderBase]: For 4179/4179 co-relation queries the response was YES. [2024-06-27 16:48:47,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21967 conditions, 8805 events. 6007/8805 cut-off events. For 4179/4179 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 42986 event pairs, 5125 based on Foata normal form. 2/7537 useless extension candidates. Maximal degree in co-relation 21954. Up to 7601 conditions per place. [2024-06-27 16:48:47,219 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 48 selfloop transitions, 3 changer transitions 43/98 dead transitions. [2024-06-27 16:48:47,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 98 transitions, 539 flow [2024-06-27 16:48:47,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 16:48:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 16:48:47,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-27 16:48:47,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3869047619047619 [2024-06-27 16:48:47,221 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 219 flow. Second operand 7 states and 130 transitions. [2024-06-27 16:48:47,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 98 transitions, 539 flow [2024-06-27 16:48:47,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 98 transitions, 531 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-27 16:48:47,230 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 235 flow [2024-06-27 16:48:47,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2024-06-27 16:48:47,232 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2024-06-27 16:48:47,232 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 235 flow [2024-06-27 16:48:47,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.666666666666666) internal successors, (140), 12 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:48:47,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:48:47,232 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:48:47,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-27 16:48:47,447 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,SelfDestructingSolverStorable9 [2024-06-27 16:48:47,448 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 16:48:47,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:48:47,449 INFO L85 PathProgramCache]: Analyzing trace with hash 231276410, now seen corresponding path program 2 times [2024-06-27 16:48:47,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:48:47,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772375781] [2024-06-27 16:48:47,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:47,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:48:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 16:48:47,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:48:47,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772375781] [2024-06-27 16:48:47,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772375781] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:48:47,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761155574] [2024-06-27 16:48:47,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:48:47,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:48:47,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:48:47,663 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:48:47,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-27 16:48:47,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:48:47,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:48:47,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 16:48:47,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:48:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 16:48:47,956 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:48:48,276 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 16:48:48,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761155574] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:48:48,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:48:48,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-06-27 16:48:48,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010944972] [2024-06-27 16:48:48,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:48:48,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-27 16:48:48,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:48:48,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-27 16:48:48,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-06-27 16:48:48,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:48:48,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 235 flow. Second operand has 14 states, 14 states have (on average 14.357142857142858) internal successors, (201), 14 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:48:48,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:48:48,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:48:48,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:48:49,340 INFO L124 PetriNetUnfolderBase]: 6488/9654 cut-off events. [2024-06-27 16:48:49,341 INFO L125 PetriNetUnfolderBase]: For 5770/5770 co-relation queries the response was YES. [2024-06-27 16:48:49,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24156 conditions, 9654 events. 6488/9654 cut-off events. For 5770/5770 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 48938 event pairs, 5339 based on Foata normal form. 345/8634 useless extension candidates. Maximal degree in co-relation 24138. Up to 7598 conditions per place. [2024-06-27 16:48:49,397 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 46 selfloop transitions, 6 changer transitions 55/111 dead transitions. [2024-06-27 16:48:49,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 111 transitions, 659 flow [2024-06-27 16:48:49,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 16:48:49,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 16:48:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-27 16:48:49,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2024-06-27 16:48:49,399 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 235 flow. Second operand 9 states and 153 transitions. [2024-06-27 16:48:49,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 111 transitions, 659 flow [2024-06-27 16:48:49,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 111 transitions, 637 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 16:48:49,412 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 249 flow [2024-06-27 16:48:49,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=249, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2024-06-27 16:48:49,412 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 27 predicate places. [2024-06-27 16:48:49,413 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 249 flow [2024-06-27 16:48:49,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.357142857142858) internal successors, (201), 14 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:48:49,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:48:49,413 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:48:49,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-27 16:48:49,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:48:49,632 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 16:48:49,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:48:49,632 INFO L85 PathProgramCache]: Analyzing trace with hash 906033355, now seen corresponding path program 3 times [2024-06-27 16:48:49,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:48:49,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872604012] [2024-06-27 16:48:49,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:48:49,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:48:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:48:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:48:54,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:48:54,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872604012] [2024-06-27 16:48:54,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872604012] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:48:54,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89770695] [2024-06-27 16:48:54,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:48:54,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:48:54,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:48:54,009 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:48:54,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-27 16:48:54,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-06-27 16:48:54,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:48:54,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 91 conjunts are in the unsatisfiable core [2024-06-27 16:48:54,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:48:54,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-06-27 16:48:54,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-06-27 16:48:54,395 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-06-27 16:48:54,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-06-27 16:48:54,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-27 16:48:54,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-27 16:48:54,622 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-06-27 16:48:54,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-06-27 16:48:54,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 16:48:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:48:56,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:49:07,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:49:07,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 84 [2024-06-27 16:49:07,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:49:07,519 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 2541 treesize of output 2343 [2024-06-27 16:49:07,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:49:07,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1377 treesize of output 1180 [2024-06-27 16:49:09,085 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 13 treesize of output 11 [2024-06-27 16:49:09,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:49:09,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 131 [2024-06-27 16:49:09,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:49:09,128 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 3326 treesize of output 3084 [2024-06-27 16:49:09,237 INFO L349 Elim1Store]: treesize reduction 15, result has 73.2 percent of original size [2024-06-27 16:49:09,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1720 treesize of output 1466 [2024-06-27 16:49:12,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-06-27 16:49:12,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-06-27 16:49:12,618 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 6 treesize of output 4 [2024-06-27 16:49:12,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-06-27 16:49:13,043 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-06-27 16:49:13,043 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 380 treesize of output 314 [2024-06-27 16:49:13,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:49:13,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 337 treesize of output 181 [2024-06-27 16:49:13,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:49:13,258 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 3716 treesize of output 3446 [2024-06-27 16:49:13,377 INFO L349 Elim1Store]: treesize reduction 23, result has 73.6 percent of original size [2024-06-27 16:49:13,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2148 treesize of output 1833 [2024-06-27 16:49:22,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-06-27 16:49:22,412 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 16:49:22,446 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 16:49:22,453 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 16:49:22,485 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 16:49:22,495 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 16:49:22,579 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 16:49:22,626 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 16:49:22,666 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 16:49:22,750 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 16:49:22,760 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 16:49:22,778 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 16:49:22,789 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 16:49:23,744 INFO L349 Elim1Store]: treesize reduction 27, result has 27.0 percent of original size [2024-06-27 16:49:23,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 531 treesize of output 419 [2024-06-27 16:49:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:49:24,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89770695] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:49:24,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:49:24,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 20] total 56 [2024-06-27 16:49:24,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300883141] [2024-06-27 16:49:24,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:49:24,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-06-27 16:49:24,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:49:24,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-06-27 16:49:24,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=2759, Unknown=2, NotChecked=0, Total=3192 [2024-06-27 16:49:24,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:49:24,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 249 flow. Second operand has 57 states, 57 states have (on average 9.210526315789474) internal successors, (525), 57 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:49:24,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:49:24,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:49:24,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:49:38,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:49:42,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:49:46,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:49:59,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:50:02,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:50:05,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:50:09,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:50:13,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:50:32,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:50:35,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:50:37,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:50:40,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:50:41,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:50:46,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 16:50:50,551 INFO L124 PetriNetUnfolderBase]: 14331/21220 cut-off events. [2024-06-27 16:50:50,552 INFO L125 PetriNetUnfolderBase]: For 11395/11395 co-relation queries the response was YES. [2024-06-27 16:50:50,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52077 conditions, 21220 events. 14331/21220 cut-off events. For 11395/11395 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 122617 event pairs, 7075 based on Foata normal form. 60/17981 useless extension candidates. Maximal degree in co-relation 52059. Up to 7320 conditions per place. [2024-06-27 16:50:50,652 INFO L140 encePairwiseOnDemand]: 26/48 looper letters, 307 selfloop transitions, 121 changer transitions 110/542 dead transitions. [2024-06-27 16:50:50,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 542 transitions, 2854 flow [2024-06-27 16:50:50,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-06-27 16:50:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2024-06-27 16:50:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 951 transitions. [2024-06-27 16:50:50,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32479508196721313 [2024-06-27 16:50:50,657 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 249 flow. Second operand 61 states and 951 transitions. [2024-06-27 16:50:50,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 542 transitions, 2854 flow [2024-06-27 16:50:50,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 542 transitions, 2784 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-27 16:50:50,685 INFO L231 Difference]: Finished difference. Result has 134 places, 170 transitions, 1236 flow [2024-06-27 16:50:50,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=1236, PETRI_PLACES=134, PETRI_TRANSITIONS=170} [2024-06-27 16:50:50,686 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 89 predicate places. [2024-06-27 16:50:50,686 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 170 transitions, 1236 flow [2024-06-27 16:50:50,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 9.210526315789474) internal successors, (525), 57 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:50:50,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:50:50,687 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:50:50,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-06-27 16:50:50,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:50:50,901 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 16:50:50,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:50:50,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1658179194, now seen corresponding path program 4 times [2024-06-27 16:50:50,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:50:50,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788401288] [2024-06-27 16:50:50,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:50:50,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:50:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:50:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:50:54,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:50:54,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788401288] [2024-06-27 16:50:54,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788401288] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:50:54,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959278529] [2024-06-27 16:50:54,534 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 16:50:54,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:50:54,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:50:54,541 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:50:54,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-06-27 16:50:54,704 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 16:50:54,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:50:54,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 67 conjunts are in the unsatisfiable core [2024-06-27 16:50:54,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:50:54,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 16:50:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 16:50:55,748 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:53:01,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:53:01,465 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 377 treesize of output 379 [2024-06-27 16:53:01,547 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 36 treesize of output 30 [2024-06-27 16:53:01,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:53:01,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 195 treesize of output 190 [2024-06-27 16:53:01,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 111 [2024-06-27 16:53:02,137 INFO L349 Elim1Store]: treesize reduction 5, result has 96.4 percent of original size [2024-06-27 16:53:02,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 773 treesize of output 703 [2024-06-27 16:53:11,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:53:11,243 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 233 treesize of output 243 [2024-06-27 16:53:11,268 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 36 treesize of output 30 [2024-06-27 16:53:11,845 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 17 treesize of output 11 [2024-06-27 16:53:11,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 16:53:11,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-06-27 16:53:11,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:53:11,878 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 611 treesize of output 599 [2024-06-27 16:53:12,000 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 10 treesize of output 4 [2024-06-27 16:53:12,019 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 17 treesize of output 11 [2024-06-27 16:53:12,088 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-06-27 16:53:12,088 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 73 treesize of output 61 [2024-06-27 16:53:12,224 INFO L349 Elim1Store]: treesize reduction 13, result has 92.7 percent of original size [2024-06-27 16:53:12,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 451 treesize of output 502 [2024-06-27 16:53:20,210 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-06-27 16:53:20,210 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 519 treesize of output 1 [2024-06-27 16:53:20,220 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-06-27 16:53:20,220 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 375 treesize of output 1 [2024-06-27 16:53:20,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:53:20,252 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 759 treesize of output 739 [2024-06-27 16:53:20,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:53:20,312 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 73 treesize of output 69 [2024-06-27 16:53:22,662 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-06-27 16:53:22,662 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 34 treesize of output 25 [2024-06-27 16:53:22,685 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-06-27 16:53:22,685 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 34 treesize of output 25 [2024-06-27 16:53:22,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 16:53:22,703 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 1 [2024-06-27 16:53:22,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 16:53:22,712 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 1 [2024-06-27 16:53:22,722 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-06-27 16:53:22,722 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 43 treesize of output 1 [2024-06-27 16:53:22,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 16:53:22,737 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 1 [2024-06-27 16:53:22,752 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-06-27 16:53:22,753 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 34 treesize of output 1 [2024-06-27 16:53:22,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 16:53:22,767 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 1 [2024-06-27 16:53:22,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 16:53:22,778 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 1 [2024-06-27 16:53:22,806 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-06-27 16:53:22,807 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 20 treesize of output 11 [2024-06-27 16:53:22,833 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-06-27 16:53:22,833 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 20 treesize of output 1 [2024-06-27 16:53:22,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 16:53:22,844 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2024-06-27 16:53:22,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 16:53:22,860 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2024-06-27 16:53:22,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 16:53:22,872 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2024-06-27 16:53:22,886 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-06-27 16:53:22,887 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 36 treesize of output 1 [2024-06-27 16:53:33,950 WARN L293 SmtUtils]: Spent 10.97s on a formula simplification. DAG size of input: 811 DAG size of output: 784 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-27 16:53:33,951 INFO L349 Elim1Store]: treesize reduction 69, result has 97.3 percent of original size [2024-06-27 16:53:33,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 611 treesize of output 2930 [2024-06-27 16:55:31,330 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-06-27 16:55:31,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-06-27 16:55:31,332 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-06-27 16:55:31,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-06-27 16:55:31,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-06-27 16:55:31,533 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:287) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:519) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:609) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.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.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) ... 87 more [2024-06-27 16:55:31,539 INFO L158 Benchmark]: Toolchain (without parser) took 414551.51ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 71.4MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-06-27 16:55:31,539 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 16:55:31,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.92ms. Allocated memory was 142.6MB in the beginning and 199.2MB in the end (delta: 56.6MB). Free memory was 71.2MB in the beginning and 167.4MB in the end (delta: -96.2MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-06-27 16:55:31,539 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.94ms. Allocated memory is still 199.2MB. Free memory was 167.4MB in the beginning and 164.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 16:55:31,539 INFO L158 Benchmark]: Boogie Preprocessor took 74.81ms. Allocated memory is still 199.2MB. Free memory was 164.3MB in the beginning and 161.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 16:55:31,540 INFO L158 Benchmark]: RCFGBuilder took 903.08ms. Allocated memory is still 199.2MB. Free memory was 161.1MB in the beginning and 64.7MB in the end (delta: 96.5MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2024-06-27 16:55:31,540 INFO L158 Benchmark]: TraceAbstraction took 413221.16ms. Allocated memory was 199.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 63.6MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-06-27 16:55:31,541 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.17ms. Allocated memory is still 142.6MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.92ms. Allocated memory was 142.6MB in the beginning and 199.2MB in the end (delta: 56.6MB). Free memory was 71.2MB in the beginning and 167.4MB in the end (delta: -96.2MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.94ms. Allocated memory is still 199.2MB. Free memory was 167.4MB in the beginning and 164.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.81ms. Allocated memory is still 199.2MB. Free memory was 164.3MB in the beginning and 161.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 903.08ms. Allocated memory is still 199.2MB. Free memory was 161.1MB in the beginning and 64.7MB in the end (delta: 96.5MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. * TraceAbstraction took 413221.16ms. Allocated memory was 199.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 63.6MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.3GB. 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-commit-1.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 73c55a951ef2b92a665c2c32d76e33a5a03bdbde67ee3c8e6748faf493088c7e --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:55:33,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:55:33,803 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-06-27 16:55:33,809 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:55:33,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:55:33,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:55:33,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:55:33,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:55:33,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:55:33,856 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:55:33,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:55:33,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:55:33,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:55:33,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:55:33,858 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:55:33,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:55:33,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:55:33,859 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:55:33,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:55:33,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:55:33,860 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:55:33,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:55:33,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:55:33,865 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-06-27 16:55:33,869 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-06-27 16:55:33,869 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:55:33,869 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-06-27 16:55:33,870 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:55:33,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:55:33,870 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:55:33,871 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:55:33,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:55:33,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:55:33,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:55:33,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:55:33,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:55:33,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:55:33,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:55:33,873 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-06-27 16:55:33,874 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-06-27 16:55:33,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:55:33,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:55:33,874 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:55:33,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:55:33,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:55:33,875 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-06-27 16:55:33,876 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 -> 73c55a951ef2b92a665c2c32d76e33a5a03bdbde67ee3c8e6748faf493088c7e [2024-06-27 16:55:34,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:55:34,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:55:34,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:55:34,248 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:55:34,248 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:55:34,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2024-06-27 16:55:35,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:55:35,729 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:55:35,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2024-06-27 16:55:35,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5982dfc/4b6f2b00a29c4040bfa6344675cf6943/FLAGfe593d6be [2024-06-27 16:55:35,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5982dfc/4b6f2b00a29c4040bfa6344675cf6943 [2024-06-27 16:55:35,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:55:35,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:55:35,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:55:35,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:55:35,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:55:35,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:55:35" (1/1) ... [2024-06-27 16:55:35,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c1f09e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:35, skipping insertion in model container [2024-06-27 16:55:35,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:55:35" (1/1) ... [2024-06-27 16:55:35,787 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:55:35,983 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c[4643,4656] [2024-06-27 16:55:35,998 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:55:36,014 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-06-27 16:55:36,022 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:55:36,054 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-commit-1.wvr.c[4643,4656] [2024-06-27 16:55:36,061 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:55:36,072 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:55:36,117 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-commit-1.wvr.c[4643,4656] [2024-06-27 16:55:36,127 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:55:36,146 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:55:36,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:36 WrapperNode [2024-06-27 16:55:36,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:55:36,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:55:36,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:55:36,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:55:36,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:36" (1/1) ... [2024-06-27 16:55:36,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:36" (1/1) ... [2024-06-27 16:55:36,219 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 326 [2024-06-27 16:55:36,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:55:36,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:55:36,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:55:36,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:55:36,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:36" (1/1) ... [2024-06-27 16:55:36,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:36" (1/1) ... [2024-06-27 16:55:36,254 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:36" (1/1) ... [2024-06-27 16:55:36,283 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-06-27 16:55:36,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:36" (1/1) ... [2024-06-27 16:55:36,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:36" (1/1) ... [2024-06-27 16:55:36,298 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:36" (1/1) ... [2024-06-27 16:55:36,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:36" (1/1) ... [2024-06-27 16:55:36,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:36" (1/1) ... [2024-06-27 16:55:36,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:36" (1/1) ... [2024-06-27 16:55:36,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:55:36,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:55:36,330 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:55:36,330 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:55:36,331 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:36" (1/1) ... [2024-06-27 16:55:36,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:55:36,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:55:36,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 16:55:36,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 16:55:36,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:55:36,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-06-27 16:55:36,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-06-27 16:55:36,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-06-27 16:55:36,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-06-27 16:55:36,419 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:55:36,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:55:36,419 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:55:36,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:55:36,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 16:55:36,420 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 16:55:36,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 16:55:36,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 16:55:36,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 16:55:36,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:55:36,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:55:36,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-06-27 16:55:36,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-06-27 16:55:36,424 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 16:55:36,573 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:55:36,575 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:55:37,123 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:55:37,124 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:55:37,574 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:55:37,574 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-06-27 16:55:37,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:55:37 BoogieIcfgContainer [2024-06-27 16:55:37,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:55:37,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:55:37,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:55:37,580 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:55:37,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:55:35" (1/3) ... [2024-06-27 16:55:37,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517f6881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:55:37, skipping insertion in model container [2024-06-27 16:55:37,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:36" (2/3) ... [2024-06-27 16:55:37,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517f6881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:55:37, skipping insertion in model container [2024-06-27 16:55:37,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:55:37" (3/3) ... [2024-06-27 16:55:37,584 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2024-06-27 16:55:37,593 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:55:37,602 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:55:37,602 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:55:37,602 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:55:37,684 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-06-27 16:55:37,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 48 transitions, 117 flow [2024-06-27 16:55:37,740 INFO L124 PetriNetUnfolderBase]: 9/45 cut-off events. [2024-06-27 16:55:37,740 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:55:37,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 9/45 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2024-06-27 16:55:37,744 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 48 transitions, 117 flow [2024-06-27 16:55:37,746 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 44 transitions, 106 flow [2024-06-27 16:55:37,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:55:37,760 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;@5237c476, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:55:37,761 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 16:55:37,773 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:55:37,774 INFO L124 PetriNetUnfolderBase]: 9/43 cut-off events. [2024-06-27 16:55:37,774 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:55:37,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:37,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:37,775 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 16:55:37,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:37,780 INFO L85 PathProgramCache]: Analyzing trace with hash -669768202, now seen corresponding path program 1 times [2024-06-27 16:55:37,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:55:37,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239183316] [2024-06-27 16:55:37,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:37,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:55:37,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:55:37,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 16:55:37,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-06-27 16:55:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:37,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 1 conjunts are in the unsatisfiable core [2024-06-27 16:55:37,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:37,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:55:37,944 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:55:37,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:55:37,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239183316] [2024-06-27 16:55:37,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239183316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:55:37,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:55:37,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:55:37,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106726078] [2024-06-27 16:55:37,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:55:37,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-06-27 16:55:37,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:55:37,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-06-27 16:55:37,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-06-27 16:55:37,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:55:37,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 106 flow. Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:37,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:37,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:55:37,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:38,623 INFO L124 PetriNetUnfolderBase]: 2548/3637 cut-off events. [2024-06-27 16:55:38,624 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2024-06-27 16:55:38,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7470 conditions, 3637 events. 2548/3637 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 16578 event pairs, 2146 based on Foata normal form. 0/3221 useless extension candidates. Maximal degree in co-relation 7063. Up to 3626 conditions per place. [2024-06-27 16:55:38,645 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 37 selfloop transitions, 0 changer transitions 0/41 dead transitions. [2024-06-27 16:55:38,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 41 transitions, 174 flow [2024-06-27 16:55:38,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-06-27 16:55:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-06-27 16:55:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2024-06-27 16:55:38,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-06-27 16:55:38,657 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 106 flow. Second operand 2 states and 54 transitions. [2024-06-27 16:55:38,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 41 transitions, 174 flow [2024-06-27 16:55:38,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 162 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 16:55:38,669 INFO L231 Difference]: Finished difference. Result has 40 places, 41 transitions, 88 flow [2024-06-27 16:55:38,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=88, PETRI_PLACES=40, PETRI_TRANSITIONS=41} [2024-06-27 16:55:38,674 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2024-06-27 16:55:38,674 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 88 flow [2024-06-27 16:55:38,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:38,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:38,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:38,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-06-27 16:55:38,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:55:38,878 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 16:55:38,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:38,879 INFO L85 PathProgramCache]: Analyzing trace with hash 44668122, now seen corresponding path program 1 times [2024-06-27 16:55:38,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:55:38,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112907704] [2024-06-27 16:55:38,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:38,880 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:55:38,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:55:38,881 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 16:55:38,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-06-27 16:55:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:39,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2024-06-27 16:55:39,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:39,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:55:39,084 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:55:39,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:55:39,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112907704] [2024-06-27 16:55:39,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112907704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:55:39,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:55:39,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:55:39,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997729699] [2024-06-27 16:55:39,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:55:39,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:55:39,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:55:39,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:55:39,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:55:39,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:55:39,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:39,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:39,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:55:39,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:39,721 INFO L124 PetriNetUnfolderBase]: 3499/4990 cut-off events. [2024-06-27 16:55:39,721 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-06-27 16:55:39,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10072 conditions, 4990 events. 3499/4990 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 24906 event pairs, 876 based on Foata normal form. 1/4366 useless extension candidates. Maximal degree in co-relation 10069. Up to 3852 conditions per place. [2024-06-27 16:55:39,746 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 56 selfloop transitions, 4 changer transitions 1/65 dead transitions. [2024-06-27 16:55:39,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 263 flow [2024-06-27 16:55:39,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:55:39,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:55:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-06-27 16:55:39,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2024-06-27 16:55:39,748 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 88 flow. Second operand 3 states and 83 transitions. [2024-06-27 16:55:39,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 263 flow [2024-06-27 16:55:39,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 65 transitions, 263 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:55:39,750 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 114 flow [2024-06-27 16:55:39,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2024-06-27 16:55:39,751 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-06-27 16:55:39,752 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 114 flow [2024-06-27 16:55:39,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:39,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:39,752 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:39,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-06-27 16:55:39,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:55:39,956 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 16:55:39,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:39,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1904349986, now seen corresponding path program 1 times [2024-06-27 16:55:39,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:55:39,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794247131] [2024-06-27 16:55:39,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:39,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:55:39,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:55:39,959 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 16:55:39,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-06-27 16:55:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:40,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2024-06-27 16:55:40,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:55:40,194 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:55:40,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:55:40,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794247131] [2024-06-27 16:55:40,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794247131] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:55:40,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:55:40,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:55:40,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354466217] [2024-06-27 16:55:40,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:55:40,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:55:40,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:55:40,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:55:40,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:55:40,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:55:40,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:40,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:40,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:55:40,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:41,058 INFO L124 PetriNetUnfolderBase]: 4888/7036 cut-off events. [2024-06-27 16:55:41,058 INFO L125 PetriNetUnfolderBase]: For 579/579 co-relation queries the response was YES. [2024-06-27 16:55:41,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15083 conditions, 7036 events. 4888/7036 cut-off events. For 579/579 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 35538 event pairs, 2384 based on Foata normal form. 165/6293 useless extension candidates. Maximal degree in co-relation 15078. Up to 3648 conditions per place. [2024-06-27 16:55:41,099 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 65 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-06-27 16:55:41,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 71 transitions, 310 flow [2024-06-27 16:55:41,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:55:41,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:55:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-06-27 16:55:41,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-06-27 16:55:41,102 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 114 flow. Second operand 3 states and 87 transitions. [2024-06-27 16:55:41,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 71 transitions, 310 flow [2024-06-27 16:55:41,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 307 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:55:41,104 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 118 flow [2024-06-27 16:55:41,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2024-06-27 16:55:41,105 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-06-27 16:55:41,105 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 118 flow [2024-06-27 16:55:41,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:41,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:41,105 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:41,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-06-27 16:55:41,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:55:41,309 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 16:55:41,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:41,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1875926908, now seen corresponding path program 1 times [2024-06-27 16:55:41,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:55:41,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104325830] [2024-06-27 16:55:41,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:41,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:55:41,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:55:41,312 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 16:55:41,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-06-27 16:55:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:41,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2024-06-27 16:55:41,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:41,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:55:41,447 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:55:41,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:55:41,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104325830] [2024-06-27 16:55:41,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104325830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:55:41,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:55:41,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:55:41,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143854439] [2024-06-27 16:55:41,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:55:41,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:55:41,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:55:41,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:55:41,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:55:41,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:55:41,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:41,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:41,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:55:41,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:41,997 INFO L124 PetriNetUnfolderBase]: 3703/5358 cut-off events. [2024-06-27 16:55:41,997 INFO L125 PetriNetUnfolderBase]: For 658/658 co-relation queries the response was YES. [2024-06-27 16:55:42,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11733 conditions, 5358 events. 3703/5358 cut-off events. For 658/658 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 25800 event pairs, 1275 based on Foata normal form. 90/4771 useless extension candidates. Maximal degree in co-relation 11727. Up to 4000 conditions per place. [2024-06-27 16:55:42,019 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 54 selfloop transitions, 2 changer transitions 5/65 dead transitions. [2024-06-27 16:55:42,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 285 flow [2024-06-27 16:55:42,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:55:42,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:55:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-06-27 16:55:42,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2024-06-27 16:55:42,021 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 118 flow. Second operand 3 states and 82 transitions. [2024-06-27 16:55:42,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 285 flow [2024-06-27 16:55:42,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 65 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:55:42,023 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 124 flow [2024-06-27 16:55:42,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2024-06-27 16:55:42,024 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2024-06-27 16:55:42,024 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 124 flow [2024-06-27 16:55:42,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:42,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:42,024 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:42,032 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 (5)] Forceful destruction successful, exit code 0 [2024-06-27 16:55:42,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:55:42,233 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 16:55:42,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:42,233 INFO L85 PathProgramCache]: Analyzing trace with hash 288030821, now seen corresponding path program 1 times [2024-06-27 16:55:42,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:55:42,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144861432] [2024-06-27 16:55:42,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:42,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:55:42,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:55:42,235 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 16:55:42,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-06-27 16:55:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:42,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2024-06-27 16:55:42,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:55:42,369 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:55:42,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:55:42,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144861432] [2024-06-27 16:55:42,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1144861432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:55:42,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:55:42,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:55:42,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167549849] [2024-06-27 16:55:42,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:55:42,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:55:42,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:55:42,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:55:42,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:55:42,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:55:42,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 124 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 16:55:42,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:42,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:55:42,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:42,760 INFO L124 PetriNetUnfolderBase]: 2561/3734 cut-off events. [2024-06-27 16:55:42,761 INFO L125 PetriNetUnfolderBase]: For 801/801 co-relation queries the response was YES. [2024-06-27 16:55:42,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8246 conditions, 3734 events. 2561/3734 cut-off events. For 801/801 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 16236 event pairs, 1346 based on Foata normal form. 62/3258 useless extension candidates. Maximal degree in co-relation 8239. Up to 2767 conditions per place. [2024-06-27 16:55:42,786 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 48 selfloop transitions, 2 changer transitions 7/61 dead transitions. [2024-06-27 16:55:42,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 61 transitions, 275 flow [2024-06-27 16:55:42,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:55:42,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:55:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-06-27 16:55:42,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-27 16:55:42,788 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 124 flow. Second operand 3 states and 76 transitions. [2024-06-27 16:55:42,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 61 transitions, 275 flow [2024-06-27 16:55:42,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 61 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:55:42,790 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 134 flow [2024-06-27 16:55:42,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2024-06-27 16:55:42,791 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2024-06-27 16:55:42,791 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 134 flow [2024-06-27 16:55:42,791 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 16:55:42,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:42,792 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:42,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-06-27 16:55:42,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:55:42,996 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 16:55:42,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:42,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1687736499, now seen corresponding path program 1 times [2024-06-27 16:55:42,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:55:42,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388257152] [2024-06-27 16:55:42,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:42,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:55:42,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:55:42,998 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 16:55:42,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-06-27 16:55:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:43,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 16:55:43,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:55:43,234 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:55:43,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:55:43,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388257152] [2024-06-27 16:55:43,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388257152] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:55:43,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:55:43,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:55:43,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994542918] [2024-06-27 16:55:43,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:55:43,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:55:43,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:55:43,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:55:43,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:55:43,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:55:43,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:43,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:43,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:55:43,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:43,782 INFO L124 PetriNetUnfolderBase]: 3171/4702 cut-off events. [2024-06-27 16:55:43,782 INFO L125 PetriNetUnfolderBase]: For 773/773 co-relation queries the response was YES. [2024-06-27 16:55:43,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10434 conditions, 4702 events. 3171/4702 cut-off events. For 773/773 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 22211 event pairs, 2856 based on Foata normal form. 56/4034 useless extension candidates. Maximal degree in co-relation 10426. Up to 3723 conditions per place. [2024-06-27 16:55:43,804 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 40 selfloop transitions, 2 changer transitions 26/72 dead transitions. [2024-06-27 16:55:43,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 330 flow [2024-06-27 16:55:43,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:55:43,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:55:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-06-27 16:55:43,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484375 [2024-06-27 16:55:43,808 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 134 flow. Second operand 4 states and 93 transitions. [2024-06-27 16:55:43,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 330 flow [2024-06-27 16:55:43,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:55:43,812 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 146 flow [2024-06-27 16:55:43,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-06-27 16:55:43,812 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2024-06-27 16:55:43,813 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 146 flow [2024-06-27 16:55:43,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:43,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:43,813 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:43,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-06-27 16:55:44,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:55:44,018 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 16:55:44,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:44,018 INFO L85 PathProgramCache]: Analyzing trace with hash -730029418, now seen corresponding path program 1 times [2024-06-27 16:55:44,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:55:44,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884678002] [2024-06-27 16:55:44,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:44,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:55:44,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:55:44,020 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 16:55:44,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-06-27 16:55:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:44,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-27 16:55:44,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:55:44,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:55:44,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:55:44,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:55:44,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884678002] [2024-06-27 16:55:44,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884678002] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:55:44,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:55:44,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-06-27 16:55:44,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192266249] [2024-06-27 16:55:44,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:55:44,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 16:55:44,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:55:44,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 16:55:44,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-06-27 16:55:44,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:55:44,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 146 flow. Second operand has 12 states, 12 states have (on average 11.666666666666666) internal successors, (140), 12 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:44,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:44,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:55:44,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:45,868 INFO L124 PetriNetUnfolderBase]: 3319/4941 cut-off events. [2024-06-27 16:55:45,868 INFO L125 PetriNetUnfolderBase]: For 917/917 co-relation queries the response was YES. [2024-06-27 16:55:45,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11071 conditions, 4941 events. 3319/4941 cut-off events. For 917/917 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 23764 event pairs, 2856 based on Foata normal form. 26/4216 useless extension candidates. Maximal degree in co-relation 11061. Up to 3723 conditions per place. [2024-06-27 16:55:45,885 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 40 selfloop transitions, 3 changer transitions 53/100 dead transitions. [2024-06-27 16:55:45,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 100 transitions, 476 flow [2024-06-27 16:55:45,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 16:55:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 16:55:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-27 16:55:45,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3932291666666667 [2024-06-27 16:55:45,893 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 146 flow. Second operand 8 states and 151 transitions. [2024-06-27 16:55:45,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 100 transitions, 476 flow [2024-06-27 16:55:45,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 100 transitions, 468 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 16:55:45,902 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 168 flow [2024-06-27 16:55:45,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=168, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2024-06-27 16:55:45,903 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2024-06-27 16:55:45,903 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 168 flow [2024-06-27 16:55:45,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.666666666666666) internal successors, (140), 12 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:45,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:45,903 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:45,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-06-27 16:55:46,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:55:46,111 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 16:55:46,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:46,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1989814089, now seen corresponding path program 2 times [2024-06-27 16:55:46,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:55:46,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540894472] [2024-06-27 16:55:46,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:55:46,113 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:55:46,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:55:46,114 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 16:55:46,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-06-27 16:55:46,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-06-27 16:55:46,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:55:46,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 16:55:46,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:46,329 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 16:55:46,329 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:55:46,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:55:46,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540894472] [2024-06-27 16:55:46,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540894472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:55:46,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:55:46,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:55:46,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383329029] [2024-06-27 16:55:46,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:55:46,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:55:46,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:55:46,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:55:46,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:55:46,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:55:46,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:46,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:46,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:55:46,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:46,754 INFO L124 PetriNetUnfolderBase]: 3336/4962 cut-off events. [2024-06-27 16:55:46,754 INFO L125 PetriNetUnfolderBase]: For 1226/1226 co-relation queries the response was YES. [2024-06-27 16:55:46,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11584 conditions, 4962 events. 3336/4962 cut-off events. For 1226/1226 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 23808 event pairs, 3018 based on Foata normal form. 14/4226 useless extension candidates. Maximal degree in co-relation 11570. Up to 3721 conditions per place. [2024-06-27 16:55:46,779 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 41 selfloop transitions, 3 changer transitions 30/78 dead transitions. [2024-06-27 16:55:46,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 78 transitions, 408 flow [2024-06-27 16:55:46,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:55:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:55:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-06-27 16:55:46,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052083333333334 [2024-06-27 16:55:46,783 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 168 flow. Second operand 4 states and 97 transitions. [2024-06-27 16:55:46,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 78 transitions, 408 flow [2024-06-27 16:55:46,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 78 transitions, 384 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-27 16:55:46,793 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 170 flow [2024-06-27 16:55:46,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2024-06-27 16:55:46,796 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2024-06-27 16:55:46,798 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 170 flow [2024-06-27 16:55:46,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:46,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:46,799 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:46,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-06-27 16:55:47,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:55:47,003 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 16:55:47,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:47,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1469099934, now seen corresponding path program 1 times [2024-06-27 16:55:47,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:55:47,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063525505] [2024-06-27 16:55:47,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:47,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:55:47,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:55:47,007 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 16:55:47,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-06-27 16:55:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:47,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-27 16:55:47,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:55:47,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:55:47,905 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:55:47,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:55:47,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063525505] [2024-06-27 16:55:47,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063525505] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:55:47,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:55:47,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-06-27 16:55:47,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455210302] [2024-06-27 16:55:47,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:55:47,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-27 16:55:47,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:55:47,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-27 16:55:47,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-06-27 16:55:47,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2024-06-27 16:55:47,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 170 flow. Second operand has 14 states, 14 states have (on average 11.285714285714286) internal successors, (158), 14 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:47,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:47,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2024-06-27 16:55:47,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:49,845 INFO L124 PetriNetUnfolderBase]: 8746/12821 cut-off events. [2024-06-27 16:55:49,846 INFO L125 PetriNetUnfolderBase]: For 4139/4139 co-relation queries the response was YES. [2024-06-27 16:55:49,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30126 conditions, 12821 events. 8746/12821 cut-off events. For 4139/4139 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 65968 event pairs, 4202 based on Foata normal form. 521/11502 useless extension candidates. Maximal degree in co-relation 30113. Up to 2979 conditions per place. [2024-06-27 16:55:49,897 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 150 selfloop transitions, 19 changer transitions 15/188 dead transitions. [2024-06-27 16:55:49,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 188 transitions, 957 flow [2024-06-27 16:55:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 16:55:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 16:55:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 256 transitions. [2024-06-27 16:55:49,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-06-27 16:55:49,900 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 170 flow. Second operand 11 states and 256 transitions. [2024-06-27 16:55:49,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 188 transitions, 957 flow [2024-06-27 16:55:49,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 188 transitions, 934 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-27 16:55:49,906 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 277 flow [2024-06-27 16:55:49,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=277, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2024-06-27 16:55:49,907 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2024-06-27 16:55:49,907 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 277 flow [2024-06-27 16:55:49,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.285714285714286) internal successors, (158), 14 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:55:49,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:49,908 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:49,915 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 16:55:50,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:55:50,113 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 16:55:50,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:50,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1290632382, now seen corresponding path program 1 times [2024-06-27 16:55:50,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:55:50,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696287930] [2024-06-27 16:55:50,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:50,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:55:50,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:55:50,119 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 16:55:50,152 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 16:55:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:50,269 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-27 16:55:50,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:56:03,575 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 16:56:03,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:57:16,333 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#1| c_~manager~0.base))) (let ((.cse7 (let ((.cse14 (bvmul (_ bv4 32) c_~manager_back~0))) (concat (concat (concat (select .cse5 (bvadd c_~manager~0.offset .cse14 (_ bv3 32))) (select .cse5 (bvadd c_~manager~0.offset (_ bv2 32) .cse14))) (select .cse5 (bvadd c_~manager~0.offset .cse14 (_ bv1 32)))) (select .cse5 (bvadd c_~manager~0.offset .cse14))))) (.cse11 (bvmul (_ bv4 32) c_~client_back~0))) (let ((.cse4 (forall ((~client~0.offset (_ BitVec 32)) (~client~0.base (_ BitVec 32))) (let ((.cse12 (select |c_#memory_int#1| ~client~0.base))) (or (= .cse7 (let ((.cse13 (bvmul (_ bv4 32) c_~client_front~0))) (concat (concat (concat (select .cse12 (bvadd .cse13 (_ bv3 32) ~client~0.offset)) (select .cse12 (bvadd .cse13 (_ bv2 32) ~client~0.offset))) (select .cse12 (bvadd .cse13 ~client~0.offset (_ bv1 32)))) (select .cse12 (bvadd .cse13 ~client~0.offset))))) (not (= .cse7 (concat (concat (concat (select .cse12 (bvadd (_ bv3 32) ~client~0.offset .cse11)) (select .cse12 (bvadd (_ bv2 32) ~client~0.offset .cse11))) (select .cse12 (bvadd ~client~0.offset (_ bv1 32) .cse11))) (select .cse12 (bvadd ~client~0.offset .cse11)))))))))) (let ((.cse0 (= c_~safe~0 (_ bv0 8))) (.cse1 (and (forall ((~client~0.offset (_ BitVec 32)) (~client~0.base (_ BitVec 32))) (not (= .cse7 (let ((.cse10 (select |c_#memory_int#1| ~client~0.base))) (concat (concat (concat (select .cse10 (bvadd (_ bv3 32) ~client~0.offset .cse11)) (select .cse10 (bvadd (_ bv2 32) ~client~0.offset .cse11))) (select .cse10 (bvadd ~client~0.offset (_ bv1 32) .cse11))) (select .cse10 (bvadd ~client~0.offset .cse11))))))) .cse4))) (and (or (not .cse0) .cse1) (or .cse0 (let ((.cse2 (= c_~update~0 (let ((.cse8 (select |c_#memory_int#1| c_~node~0.base)) (.cse9 (bvmul (_ bv4 32) c_~node_front~0))) (concat (concat (concat (select .cse8 (bvadd (_ bv3 32) c_~node~0.offset .cse9)) (select .cse8 (bvadd (_ bv2 32) c_~node~0.offset .cse9))) (select .cse8 (bvadd (_ bv1 32) c_~node~0.offset .cse9))) (select .cse8 (bvadd c_~node~0.offset .cse9))))))) (and (or (not .cse2) (let ((.cse3 (= (let ((.cse6 (bvmul (_ bv4 32) c_~manager_front~0))) (concat (concat (concat (select .cse5 (bvadd c_~manager~0.offset (_ bv3 32) .cse6)) (select .cse5 (bvadd c_~manager~0.offset (_ bv2 32) .cse6))) (select .cse5 (bvadd c_~manager~0.offset (_ bv1 32) .cse6))) (select .cse5 (bvadd c_~manager~0.offset .cse6)))) .cse7))) (and (or .cse1 .cse3) (or .cse4 (not .cse3))))) (or .cse1 .cse2))))))))) is different from false [2024-06-27 16:58:36,090 WARN L293 SmtUtils]: Spent 51.84s on a formula simplification. DAG size of input: 1195 DAG size of output: 1021 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-27 16:58:36,091 INFO L349 Elim1Store]: treesize reduction 682, result has 88.5 percent of original size [2024-06-27 16:58:36,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 28 select indices, 28 select index equivalence classes, 0 disjoint index pairs (out of 378 index pairs), introduced 28 new quantified variables, introduced 378 case distinctions, treesize of input 434 treesize of output 5327 Killed by 15