./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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-bad-dot-product-alt.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 6fdb5189ea0a06d32886b44c2108d225ef2901fa5113fdc3856a252d0f653190 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:34:30,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:34:30,233 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:34:30,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:34:30,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:34:30,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:34:30,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:34:30,269 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:34:30,270 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:34:30,270 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:34:30,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:34:30,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:34:30,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:34:30,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:34:30,273 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:34:30,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:34:30,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:34:30,274 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:34:30,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:34:30,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:34:30,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:34:30,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:34:30,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:34:30,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:34:30,281 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:34:30,281 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:34:30,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:34:30,282 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:34:30,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:34:30,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:34:30,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:34:30,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:34:30,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:34:30,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:34:30,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:34:30,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:34:30,285 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:34:30,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:34:30,285 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:34:30,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:34:30,286 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:34:30,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:34:30,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:34:30,286 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 -> 6fdb5189ea0a06d32886b44c2108d225ef2901fa5113fdc3856a252d0f653190 [2024-01-27 15:34:30,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:34:30,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:34:30,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:34:30,556 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:34:30,556 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:34:30,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2024-01-27 15:34:31,802 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:34:31,966 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:34:31,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2024-01-27 15:34:31,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2be2488a/4f8db214d47f419ba831d3fd44517d62/FLAG69eccee24 [2024-01-27 15:34:31,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2be2488a/4f8db214d47f419ba831d3fd44517d62 [2024-01-27 15:34:31,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:34:31,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:34:31,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:34:31,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:34:31,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:34:31,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:34:31" (1/1) ... [2024-01-27 15:34:31,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d9e558a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:31, skipping insertion in model container [2024-01-27 15:34:31,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:34:31" (1/1) ... [2024-01-27 15:34:32,015 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:34:32,219 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c[3221,3234] [2024-01-27 15:34:32,240 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:34:32,255 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:34:32,298 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c[3221,3234] [2024-01-27 15:34:32,306 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:34:32,324 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:34:32,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:32 WrapperNode [2024-01-27 15:34:32,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:34:32,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:34:32,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:34:32,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:34:32,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:32" (1/1) ... [2024-01-27 15:34:32,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:32" (1/1) ... [2024-01-27 15:34:32,376 INFO L138 Inliner]: procedures = 28, calls = 74, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 378 [2024-01-27 15:34:32,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:34:32,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:34:32,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:34:32,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:34:32,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:32" (1/1) ... [2024-01-27 15:34:32,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:32" (1/1) ... [2024-01-27 15:34:32,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:32" (1/1) ... [2024-01-27 15:34:32,417 INFO L175 MemorySlicer]: Split 36 memory accesses to 6 slices as follows [2, 24, 4, 2, 2, 2]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 7 writes are split as follows [0, 3, 1, 1, 1, 1]. [2024-01-27 15:34:32,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:32" (1/1) ... [2024-01-27 15:34:32,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:32" (1/1) ... [2024-01-27 15:34:32,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:32" (1/1) ... [2024-01-27 15:34:32,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:32" (1/1) ... [2024-01-27 15:34:32,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:32" (1/1) ... [2024-01-27 15:34:32,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:32" (1/1) ... [2024-01-27 15:34:32,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:34:32,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:34:32,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:34:32,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:34:32,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:32" (1/1) ... [2024-01-27 15:34:32,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:34:32,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:34:32,511 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-01-27 15:34:32,530 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-01-27 15:34:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:34:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-01-27 15:34:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-01-27 15:34:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-01-27 15:34:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-01-27 15:34:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-01-27 15:34:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-01-27 15:34:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:34:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:34:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:34:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:34:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 15:34:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 15:34:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-01-27 15:34:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:34:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:34:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:34:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 15:34:32,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 15:34:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-01-27 15:34:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-01-27 15:34:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-01-27 15:34:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-01-27 15:34:32,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-01-27 15:34:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-01-27 15:34:32,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-01-27 15:34:32,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:34:32,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:34:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:34:32,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:34:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 15:34:32,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 15:34:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:34:32,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:34:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:34:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 15:34:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 15:34:32,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-01-27 15:34:32,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:34:32,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:34:32,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 15:34:32,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:34:32,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:34:32,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:34:32,576 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:34:32,757 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:34:32,759 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:34:33,312 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:34:33,313 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:34:33,737 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:34:33,738 INFO L320 CfgBuilder]: Removed 7 assume(true) statements. [2024-01-27 15:34:33,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:34:33 BoogieIcfgContainer [2024-01-27 15:34:33,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:34:33,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:34:33,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:34:33,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:34:33,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:34:31" (1/3) ... [2024-01-27 15:34:33,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10501039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:34:33, skipping insertion in model container [2024-01-27 15:34:33,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:34:32" (2/3) ... [2024-01-27 15:34:33,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10501039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:34:33, skipping insertion in model container [2024-01-27 15:34:33,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:34:33" (3/3) ... [2024-01-27 15:34:33,747 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product-alt.wvr.c [2024-01-27 15:34:33,756 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:34:33,765 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:34:33,765 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:34:33,765 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:34:33,839 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-27 15:34:33,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 41 transitions, 103 flow [2024-01-27 15:34:33,921 INFO L124 PetriNetUnfolderBase]: 7/38 cut-off events. [2024-01-27 15:34:33,922 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:34:33,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 38 events. 7/38 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-01-27 15:34:33,926 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 41 transitions, 103 flow [2024-01-27 15:34:33,929 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 37 transitions, 92 flow [2024-01-27 15:34:33,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:34:33,947 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;@e0c2d4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:34:33,947 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-01-27 15:34:33,991 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:34:33,992 INFO L124 PetriNetUnfolderBase]: 7/36 cut-off events. [2024-01-27 15:34:33,992 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:34:33,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:34:33,993 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] [2024-01-27 15:34:33,993 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-01-27 15:34:33,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:34:33,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1766691864, now seen corresponding path program 1 times [2024-01-27 15:34:34,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:34:34,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139437167] [2024-01-27 15:34:34,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:34,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:34:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:34:34,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:34:34,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139437167] [2024-01-27 15:34:34,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139437167] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:34:34,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:34:34,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:34:34,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995743198] [2024-01-27 15:34:34,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:34:34,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:34:34,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:34:34,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:34:34,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:34:34,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 41 [2024-01-27 15:34:34,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-01-27 15:34:34,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:34:34,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 41 [2024-01-27 15:34:34,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:34:34,931 INFO L124 PetriNetUnfolderBase]: 1303/1884 cut-off events. [2024-01-27 15:34:34,931 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2024-01-27 15:34:34,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3922 conditions, 1884 events. 1303/1884 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7609 event pairs, 335 based on Foata normal form. 1/1555 useless extension candidates. Maximal degree in co-relation 3272. Up to 1333 conditions per place. [2024-01-27 15:34:34,948 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 53 selfloop transitions, 4 changer transitions 1/59 dead transitions. [2024-01-27 15:34:34,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 267 flow [2024-01-27 15:34:34,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:34:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:34:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-01-27 15:34:34,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5772357723577236 [2024-01-27 15:34:34,963 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 92 flow. Second operand 3 states and 71 transitions. [2024-01-27 15:34:34,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 267 flow [2024-01-27 15:34:34,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 59 transitions, 245 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-27 15:34:34,973 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 106 flow [2024-01-27 15:34:34,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2024-01-27 15:34:34,978 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2024-01-27 15:34:34,978 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 106 flow [2024-01-27 15:34:34,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-01-27 15:34:34,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:34:34,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:34:34,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:34:34,980 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-01-27 15:34:34,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:34:34,981 INFO L85 PathProgramCache]: Analyzing trace with hash 575993738, now seen corresponding path program 1 times [2024-01-27 15:34:34,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:34:34,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934597269] [2024-01-27 15:34:34,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:34,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:34:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:34:35,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:34:35,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934597269] [2024-01-27 15:34:35,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934597269] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:34:35,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:34:35,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:34:35,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137542891] [2024-01-27 15:34:35,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:34:35,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:34:35,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:34:35,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:34:35,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:34:35,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 41 [2024-01-27 15:34:35,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-01-27 15:34:35,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:34:35,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 41 [2024-01-27 15:34:35,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:34:35,661 INFO L124 PetriNetUnfolderBase]: 1309/1897 cut-off events. [2024-01-27 15:34:35,661 INFO L125 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2024-01-27 15:34:35,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4306 conditions, 1897 events. 1309/1897 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7356 event pairs, 955 based on Foata normal form. 0/1561 useless extension candidates. Maximal degree in co-relation 1607. Up to 1884 conditions per place. [2024-01-27 15:34:35,670 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 37 selfloop transitions, 4 changer transitions 11/53 dead transitions. [2024-01-27 15:34:35,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 236 flow [2024-01-27 15:34:35,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:34:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:34:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2024-01-27 15:34:35,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34146341463414637 [2024-01-27 15:34:35,672 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 106 flow. Second operand 5 states and 70 transitions. [2024-01-27 15:34:35,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 236 flow [2024-01-27 15:34:35,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:34:35,675 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 136 flow [2024-01-27 15:34:35,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2024-01-27 15:34:35,676 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-01-27 15:34:35,676 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 136 flow [2024-01-27 15:34:35,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-01-27 15:34:35,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:34:35,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:34:35,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:34:35,677 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-01-27 15:34:35,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:34:35,678 INFO L85 PathProgramCache]: Analyzing trace with hash 95214994, now seen corresponding path program 1 times [2024-01-27 15:34:35,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:34:35,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262143239] [2024-01-27 15:34:35,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:35,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:34:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:34:35,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:34:35,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262143239] [2024-01-27 15:34:35,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262143239] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:34:35,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:34:35,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:34:35,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779759712] [2024-01-27 15:34:35,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:34:35,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:34:35,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:34:35,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:34:35,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:34:35,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 41 [2024-01-27 15:34:35,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-01-27 15:34:35,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:34:35,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 41 [2024-01-27 15:34:35,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:34:36,119 INFO L124 PetriNetUnfolderBase]: 1347/1947 cut-off events. [2024-01-27 15:34:36,119 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2024-01-27 15:34:36,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4296 conditions, 1947 events. 1347/1947 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7708 event pairs, 451 based on Foata normal form. 0/1656 useless extension candidates. Maximal degree in co-relation 4271. Up to 1002 conditions per place. [2024-01-27 15:34:36,130 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 55 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2024-01-27 15:34:36,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 300 flow [2024-01-27 15:34:36,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:34:36,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:34:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2024-01-27 15:34:36,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-01-27 15:34:36,133 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 136 flow. Second operand 4 states and 69 transitions. [2024-01-27 15:34:36,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 300 flow [2024-01-27 15:34:36,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 60 transitions, 282 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-01-27 15:34:36,139 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 139 flow [2024-01-27 15:34:36,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2024-01-27 15:34:36,140 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-01-27 15:34:36,141 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 139 flow [2024-01-27 15:34:36,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-01-27 15:34:36,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:34:36,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:34:36,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 15:34:36,142 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-01-27 15:34:36,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:34:36,142 INFO L85 PathProgramCache]: Analyzing trace with hash 848886412, now seen corresponding path program 1 times [2024-01-27 15:34:36,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:34:36,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783246330] [2024-01-27 15:34:36,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:36,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:34:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:34:36,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:34:36,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783246330] [2024-01-27 15:34:36,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783246330] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:34:36,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814649116] [2024-01-27 15:34:36,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:36,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:34:36,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:34:36,301 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-01-27 15:34:36,320 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-01-27 15:34:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:36,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 15:34:36,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:34:36,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:34:36,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:34:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:34:36,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814649116] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 15:34:36,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:34:36,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-01-27 15:34:36,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034404337] [2024-01-27 15:34:36,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:34:36,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:34:36,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:34:36,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:34:36,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-01-27 15:34:36,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 41 [2024-01-27 15:34:36,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:36,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:34:36,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 41 [2024-01-27 15:34:36,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:34:36,980 INFO L124 PetriNetUnfolderBase]: 1371/1971 cut-off events. [2024-01-27 15:34:36,980 INFO L125 PetriNetUnfolderBase]: For 806/806 co-relation queries the response was YES. [2024-01-27 15:34:36,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4963 conditions, 1971 events. 1371/1971 cut-off events. For 806/806 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7832 event pairs, 419 based on Foata normal form. 0/1776 useless extension candidates. Maximal degree in co-relation 4934. Up to 1030 conditions per place. [2024-01-27 15:34:36,991 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 56 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2024-01-27 15:34:36,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 62 transitions, 325 flow [2024-01-27 15:34:36,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:34:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:34:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2024-01-27 15:34:36,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36097560975609755 [2024-01-27 15:34:36,995 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 139 flow. Second operand 5 states and 74 transitions. [2024-01-27 15:34:36,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 62 transitions, 325 flow [2024-01-27 15:34:36,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 15:34:36,998 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 158 flow [2024-01-27 15:34:36,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2024-01-27 15:34:36,999 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2024-01-27 15:34:36,999 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 158 flow [2024-01-27 15:34:37,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:34:37,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:34:37,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:34:37,013 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-01-27 15:34:37,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:34:37,204 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-01-27 15:34:37,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:34:37,205 INFO L85 PathProgramCache]: Analyzing trace with hash 144327312, now seen corresponding path program 1 times [2024-01-27 15:34:37,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:34:37,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401112935] [2024-01-27 15:34:37,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:37,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:34:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:34:37,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:34:37,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401112935] [2024-01-27 15:34:37,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401112935] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:34:37,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:34:37,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:34:37,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267648843] [2024-01-27 15:34:37,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:34:37,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:34:37,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:34:37,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:34:37,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:34:37,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 41 [2024-01-27 15:34:37,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-01-27 15:34:37,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:34:37,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 41 [2024-01-27 15:34:37,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:34:38,055 INFO L124 PetriNetUnfolderBase]: 1417/2060 cut-off events. [2024-01-27 15:34:38,055 INFO L125 PetriNetUnfolderBase]: For 1513/1513 co-relation queries the response was YES. [2024-01-27 15:34:38,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5697 conditions, 2060 events. 1417/2060 cut-off events. For 1513/1513 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7686 event pairs, 1058 based on Foata normal form. 32/1968 useless extension candidates. Maximal degree in co-relation 5664. Up to 1965 conditions per place. [2024-01-27 15:34:38,066 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 43 selfloop transitions, 3 changer transitions 11/58 dead transitions. [2024-01-27 15:34:38,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 312 flow [2024-01-27 15:34:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:34:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:34:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2024-01-27 15:34:38,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-01-27 15:34:38,068 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 158 flow. Second operand 4 states and 69 transitions. [2024-01-27 15:34:38,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 312 flow [2024-01-27 15:34:38,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 305 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-27 15:34:38,072 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 174 flow [2024-01-27 15:34:38,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2024-01-27 15:34:38,074 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2024-01-27 15:34:38,074 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 174 flow [2024-01-27 15:34:38,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-01-27 15:34:38,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:34:38,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:34:38,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 15:34:38,075 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-01-27 15:34:38,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:34:38,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1500510844, now seen corresponding path program 1 times [2024-01-27 15:34:38,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:34:38,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226904789] [2024-01-27 15:34:38,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:38,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:34:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:38,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:34:38,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:34:38,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226904789] [2024-01-27 15:34:38,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226904789] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:34:38,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:34:38,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:34:38,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823428396] [2024-01-27 15:34:38,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:34:38,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:34:38,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:34:38,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:34:38,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:34:38,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 41 [2024-01-27 15:34:38,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-01-27 15:34:38,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:34:38,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 41 [2024-01-27 15:34:38,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:34:38,810 INFO L124 PetriNetUnfolderBase]: 1421/2069 cut-off events. [2024-01-27 15:34:38,811 INFO L125 PetriNetUnfolderBase]: For 1802/1802 co-relation queries the response was YES. [2024-01-27 15:34:38,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5849 conditions, 2069 events. 1421/2069 cut-off events. For 1802/1802 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7708 event pairs, 1058 based on Foata normal form. 44/2112 useless extension candidates. Maximal degree in co-relation 5812. Up to 1968 conditions per place. [2024-01-27 15:34:38,822 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 38 selfloop transitions, 7 changer transitions 18/64 dead transitions. [2024-01-27 15:34:38,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 64 transitions, 360 flow [2024-01-27 15:34:38,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:34:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:34:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2024-01-27 15:34:38,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3853658536585366 [2024-01-27 15:34:38,824 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 174 flow. Second operand 5 states and 79 transitions. [2024-01-27 15:34:38,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 64 transitions, 360 flow [2024-01-27 15:34:38,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 64 transitions, 355 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 15:34:38,829 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 212 flow [2024-01-27 15:34:38,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2024-01-27 15:34:38,833 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2024-01-27 15:34:38,833 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 212 flow [2024-01-27 15:34:38,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-01-27 15:34:38,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:34:38,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:34:38,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 15:34:38,836 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-01-27 15:34:38,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:34:38,837 INFO L85 PathProgramCache]: Analyzing trace with hash 183238071, now seen corresponding path program 1 times [2024-01-27 15:34:38,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:34:38,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140480374] [2024-01-27 15:34:38,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:38,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:34:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:34:40,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:34:40,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140480374] [2024-01-27 15:34:40,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140480374] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:34:40,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43489016] [2024-01-27 15:34:40,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:40,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:34:40,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:34:40,615 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-01-27 15:34:40,627 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-01-27 15:34:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:40,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 82 conjunts are in the unsatisfiable core [2024-01-27 15:34:40,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:34:40,939 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-01-27 15:34:40,984 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-01-27 15:34:41,037 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-01-27 15:34:41,038 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-01-27 15:34:41,089 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-27 15:34:41,090 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 1 case distinctions, treesize of input 11 treesize of output 11 [2024-01-27 15:34:41,156 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 23 treesize of output 1 [2024-01-27 15:34:41,220 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-01-27 15:34:41,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-01-27 15:34:42,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 39 treesize of output 27 [2024-01-27 15:34:42,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 15 [2024-01-27 15:34:42,088 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2024-01-27 15:34:42,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 25 [2024-01-27 15:34:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:34:42,106 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:34:43,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 115 [2024-01-27 15:34:43,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:34:43,099 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 426 treesize of output 398 [2024-01-27 15:34:43,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 378 treesize of output 362 [2024-01-27 15:34:43,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:34:43,133 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 1102 treesize of output 930 [2024-01-27 15:36:32,195 WARN L293 SmtUtils]: Spent 7.23s on a formula simplification that was a NOOP. DAG size: 344 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:37:37,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:37:37,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 1716 treesize of output 1880 [2024-01-27 15:38:25,597 INFO L349 Elim1Store]: treesize reduction 82, result has 86.7 percent of original size [2024-01-27 15:38:25,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 45 case distinctions, treesize of input 32317 treesize of output 28540 [2024-01-27 15:39:38,312 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-01-27 15:39:38,315 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-01-27 15:39:38,313 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-01-27 15:39:38,328 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-01-27 15:39:38,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-01-27 15:39:38,516 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:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:516) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:500) 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:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$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) ... 78 more [2024-01-27 15:39:38,521 INFO L158 Benchmark]: Toolchain (without parser) took 306534.72ms. Allocated memory was 159.4MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 103.6MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-01-27 15:39:38,521 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 15:39:38,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.30ms. Allocated memory is still 159.4MB. Free memory was 103.2MB in the beginning and 89.4MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-01-27 15:39:38,521 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.43ms. Allocated memory is still 159.4MB. Free memory was 89.4MB in the beginning and 86.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 15:39:38,522 INFO L158 Benchmark]: Boogie Preprocessor took 96.56ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 81.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 15:39:38,522 INFO L158 Benchmark]: RCFGBuilder took 1263.72ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 81.8MB in the beginning and 81.9MB in the end (delta: -19.0kB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2024-01-27 15:39:38,522 INFO L158 Benchmark]: TraceAbstraction took 304779.67ms. Allocated memory was 211.8MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 81.9MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-01-27 15:39:38,524 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.18ms. Allocated memory is still 159.4MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.30ms. Allocated memory is still 159.4MB. Free memory was 103.2MB in the beginning and 89.4MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.43ms. Allocated memory is still 159.4MB. Free memory was 89.4MB in the beginning and 86.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.56ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 81.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1263.72ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 81.8MB in the beginning and 81.9MB in the end (delta: -19.0kB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. * TraceAbstraction took 304779.67ms. Allocated memory was 211.8MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 81.9MB in the beginning and 2.3GB in the end (delta: -2.2GB). 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-bad-dot-product-alt.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 6fdb5189ea0a06d32886b44c2108d225ef2901fa5113fdc3856a252d0f653190 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:39:40,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:39:40,906 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-01-27 15:39:40,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:39:40,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:39:40,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:39:40,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:39:40,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:39:40,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:39:40,960 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:39:40,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:39:40,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:39:40,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:39:40,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:39:40,964 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:39:40,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:39:40,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:39:40,965 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:39:40,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:39:40,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:39:40,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:39:40,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:39:40,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:39:40,967 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-01-27 15:39:40,968 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-01-27 15:39:40,968 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:39:40,968 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-01-27 15:39:40,969 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:39:40,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:39:40,969 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:39:40,970 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:39:40,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:39:40,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:39:40,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:39:40,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:39:40,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:39:40,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:39:40,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:39:40,973 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-01-27 15:39:40,973 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-01-27 15:39:40,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:39:40,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:39:40,974 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:39:40,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:39:40,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:39:40,975 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-01-27 15:39:40,975 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 -> 6fdb5189ea0a06d32886b44c2108d225ef2901fa5113fdc3856a252d0f653190 [2024-01-27 15:39:41,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:39:41,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:39:41,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:39:41,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:39:41,339 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:39:41,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2024-01-27 15:39:42,668 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:39:42,881 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:39:42,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2024-01-27 15:39:42,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6126948ed/bd331c49f39540ef961264efd12ef775/FLAG4fc90cedd [2024-01-27 15:39:42,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6126948ed/bd331c49f39540ef961264efd12ef775 [2024-01-27 15:39:42,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:39:42,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:39:42,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:39:42,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:39:42,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:39:42,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:39:42" (1/1) ... [2024-01-27 15:39:42,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@615e4d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:39:42, skipping insertion in model container [2024-01-27 15:39:42,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:39:42" (1/1) ... [2024-01-27 15:39:42,954 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:39:43,167 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c[3221,3234] [2024-01-27 15:39:43,186 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:39:43,199 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-01-27 15:39:43,212 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:39:43,252 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c[3221,3234] [2024-01-27 15:39:43,257 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:39:43,261 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:39:43,305 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c[3221,3234] [2024-01-27 15:39:43,308 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:39:43,333 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:39:43,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:39:43 WrapperNode [2024-01-27 15:39:43,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:39:43,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:39:43,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:39:43,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:39:43,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:39:43" (1/1) ... [2024-01-27 15:39:43,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:39:43" (1/1) ... [2024-01-27 15:39:43,422 INFO L138 Inliner]: procedures = 30, calls = 74, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 368 [2024-01-27 15:39:43,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:39:43,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:39:43,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:39:43,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:39:43,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:39:43" (1/1) ... [2024-01-27 15:39:43,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:39:43" (1/1) ... [2024-01-27 15:39:43,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:39:43" (1/1) ... [2024-01-27 15:39:43,492 INFO L175 MemorySlicer]: Split 36 memory accesses to 6 slices as follows [2, 2, 2, 2, 24, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 7 writes are split as follows [0, 1, 1, 1, 3, 1]. [2024-01-27 15:39:43,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:39:43" (1/1) ... [2024-01-27 15:39:43,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:39:43" (1/1) ... [2024-01-27 15:39:43,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:39:43" (1/1) ... [2024-01-27 15:39:43,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:39:43" (1/1) ... [2024-01-27 15:39:43,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:39:43" (1/1) ... [2024-01-27 15:39:43,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:39:43" (1/1) ... [2024-01-27 15:39:43,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:39:43,562 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:39:43,563 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:39:43,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:39:43,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:39:43" (1/1) ... [2024-01-27 15:39:43,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:39:43,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:39:43,598 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-01-27 15:39:43,605 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-01-27 15:39:43,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:39:43,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-01-27 15:39:43,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-01-27 15:39:43,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-01-27 15:39:43,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-01-27 15:39:43,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-01-27 15:39:43,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-01-27 15:39:43,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-01-27 15:39:43,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-01-27 15:39:43,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-01-27 15:39:43,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-01-27 15:39:43,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-01-27 15:39:43,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-01-27 15:39:43,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:39:43,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-01-27 15:39:43,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-01-27 15:39:43,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-01-27 15:39:43,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-01-27 15:39:43,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-01-27 15:39:43,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-01-27 15:39:43,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-01-27 15:39:43,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-01-27 15:39:43,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-01-27 15:39:43,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-01-27 15:39:43,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-01-27 15:39:43,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-01-27 15:39:43,659 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:39:43,659 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:39:43,659 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:39:43,660 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:39:43,660 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 15:39:43,660 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 15:39:43,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:39:43,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:39:43,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 15:39:43,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:39:43,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:39:43,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:39:43,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-01-27 15:39:43,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-01-27 15:39:43,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-01-27 15:39:43,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-01-27 15:39:43,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-01-27 15:39:43,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-01-27 15:39:43,665 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:39:43,860 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:39:43,863 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:39:44,598 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:39:44,599 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:39:45,112 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:39:45,113 INFO L320 CfgBuilder]: Removed 7 assume(true) statements. [2024-01-27 15:39:45,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:39:45 BoogieIcfgContainer [2024-01-27 15:39:45,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:39:45,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:39:45,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:39:45,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:39:45,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:39:42" (1/3) ... [2024-01-27 15:39:45,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f809d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:39:45, skipping insertion in model container [2024-01-27 15:39:45,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:39:43" (2/3) ... [2024-01-27 15:39:45,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f809d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:39:45, skipping insertion in model container [2024-01-27 15:39:45,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:39:45" (3/3) ... [2024-01-27 15:39:45,124 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product-alt.wvr.c [2024-01-27 15:39:45,133 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:39:45,143 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:39:45,143 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:39:45,144 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:39:45,247 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-27 15:39:45,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 41 transitions, 103 flow [2024-01-27 15:39:45,308 INFO L124 PetriNetUnfolderBase]: 7/38 cut-off events. [2024-01-27 15:39:45,308 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:39:45,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 38 events. 7/38 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-01-27 15:39:45,311 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 41 transitions, 103 flow [2024-01-27 15:39:45,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 37 transitions, 92 flow [2024-01-27 15:39:45,323 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:39:45,329 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;@1810d31b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:39:45,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-01-27 15:39:45,345 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:39:45,346 INFO L124 PetriNetUnfolderBase]: 7/36 cut-off events. [2024-01-27 15:39:45,346 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:39:45,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:39:45,347 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] [2024-01-27 15:39:45,348 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-01-27 15:39:45,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:39:45,352 INFO L85 PathProgramCache]: Analyzing trace with hash 587595652, now seen corresponding path program 1 times [2024-01-27 15:39:45,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:39:45,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352626245] [2024-01-27 15:39:45,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:39:45,368 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-01-27 15:39:45,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:39:45,370 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-01-27 15:39:45,431 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-01-27 15:39:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:39:45,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-27 15:39:45,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:39:45,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:39:45,904 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:39:45,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:39:45,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352626245] [2024-01-27 15:39:45,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352626245] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:39:45,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:39:45,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:39:45,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972398493] [2024-01-27 15:39:45,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:39:45,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:39:45,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:39:45,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:39:45,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:39:45,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 41 [2024-01-27 15:39:45,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-01-27 15:39:45,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:39:45,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 41 [2024-01-27 15:39:45,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:39:46,695 INFO L124 PetriNetUnfolderBase]: 1303/1884 cut-off events. [2024-01-27 15:39:46,695 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2024-01-27 15:39:46,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3922 conditions, 1884 events. 1303/1884 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7573 event pairs, 335 based on Foata normal form. 1/1555 useless extension candidates. Maximal degree in co-relation 3272. Up to 1333 conditions per place. [2024-01-27 15:39:46,712 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 53 selfloop transitions, 4 changer transitions 1/59 dead transitions. [2024-01-27 15:39:46,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 267 flow [2024-01-27 15:39:46,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:39:46,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:39:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-01-27 15:39:46,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5772357723577236 [2024-01-27 15:39:46,727 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 92 flow. Second operand 3 states and 71 transitions. [2024-01-27 15:39:46,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 267 flow [2024-01-27 15:39:46,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 59 transitions, 245 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-27 15:39:46,738 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 106 flow [2024-01-27 15:39:46,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2024-01-27 15:39:46,744 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2024-01-27 15:39:46,744 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 106 flow [2024-01-27 15:39:46,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-01-27 15:39:46,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:39:46,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:39:46,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-01-27 15:39:46,950 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-01-27 15:39:46,950 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-01-27 15:39:46,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:39:46,951 INFO L85 PathProgramCache]: Analyzing trace with hash -140277194, now seen corresponding path program 1 times [2024-01-27 15:39:46,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:39:46,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644356164] [2024-01-27 15:39:46,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:39:46,952 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-01-27 15:39:46,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:39:46,954 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-01-27 15:39:46,956 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-01-27 15:39:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:39:47,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-27 15:39:47,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:39:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:39:47,265 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:39:47,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:39:47,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644356164] [2024-01-27 15:39:47,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644356164] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:39:47,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:39:47,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:39:47,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450943881] [2024-01-27 15:39:47,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:39:47,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:39:47,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:39:47,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:39:47,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:39:47,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 41 [2024-01-27 15:39:47,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:39:47,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:39:47,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 41 [2024-01-27 15:39:47,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:39:48,017 INFO L124 PetriNetUnfolderBase]: 1552/2224 cut-off events. [2024-01-27 15:39:48,017 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2024-01-27 15:39:48,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5019 conditions, 2224 events. 1552/2224 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9427 event pairs, 583 based on Foata normal form. 0/1906 useless extension candidates. Maximal degree in co-relation 1490. Up to 1306 conditions per place. [2024-01-27 15:39:48,028 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 55 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2024-01-27 15:39:48,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 60 transitions, 278 flow [2024-01-27 15:39:48,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:39:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:39:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2024-01-27 15:39:48,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2024-01-27 15:39:48,031 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 106 flow. Second operand 5 states and 75 transitions. [2024-01-27 15:39:48,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 60 transitions, 278 flow [2024-01-27 15:39:48,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 60 transitions, 270 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-27 15:39:48,034 INFO L231 Difference]: Finished difference. Result has 41 places, 41 transitions, 116 flow [2024-01-27 15:39:48,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=41, PETRI_TRANSITIONS=41} [2024-01-27 15:39:48,035 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-01-27 15:39:48,035 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 41 transitions, 116 flow [2024-01-27 15:39:48,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:39:48,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:39:48,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:39:48,048 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-01-27 15:39:48,241 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-01-27 15:39:48,241 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:39:48,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:39:48,242 INFO L85 PathProgramCache]: Analyzing trace with hash 101357782, now seen corresponding path program 1 times [2024-01-27 15:39:48,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:39:48,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511964564] [2024-01-27 15:39:48,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:39:48,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:39:48,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:39:48,245 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-01-27 15:39:48,248 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-01-27 15:39:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:39:48,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:39:48,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:39:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:39:48,529 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:39:48,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:39:48,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511964564] [2024-01-27 15:39:48,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511964564] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:39:48,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:39:48,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:39:48,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358537328] [2024-01-27 15:39:48,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:39:48,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:39:48,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:39:48,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:39:48,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:39:48,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 41 [2024-01-27 15:39:48,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 41 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-01-27 15:39:48,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:39:48,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 41 [2024-01-27 15:39:48,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:39:49,257 INFO L124 PetriNetUnfolderBase]: 1555/2232 cut-off events. [2024-01-27 15:39:49,257 INFO L125 PetriNetUnfolderBase]: For 638/638 co-relation queries the response was YES. [2024-01-27 15:39:49,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5287 conditions, 2232 events. 1555/2232 cut-off events. For 638/638 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8802 event pairs, 1190 based on Foata normal form. 1/1975 useless extension candidates. Maximal degree in co-relation 1835. Up to 2224 conditions per place. [2024-01-27 15:39:49,270 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 38 selfloop transitions, 4 changer transitions 6/49 dead transitions. [2024-01-27 15:39:49,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 228 flow [2024-01-27 15:39:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:39:49,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:39:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2024-01-27 15:39:49,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32195121951219513 [2024-01-27 15:39:49,271 INFO L175 Difference]: Start difference. First operand has 41 places, 41 transitions, 116 flow. Second operand 5 states and 66 transitions. [2024-01-27 15:39:49,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 228 flow [2024-01-27 15:39:49,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 222 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 15:39:49,274 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 138 flow [2024-01-27 15:39:49,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2024-01-27 15:39:49,274 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2024-01-27 15:39:49,275 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 138 flow [2024-01-27 15:39:49,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-01-27 15:39:49,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:39:49,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:39:49,283 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 (4)] Ended with exit code 0 [2024-01-27 15:39:49,480 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-01-27 15:39:49,480 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-01-27 15:39:49,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:39:49,481 INFO L85 PathProgramCache]: Analyzing trace with hash 78981546, now seen corresponding path program 1 times [2024-01-27 15:39:49,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:39:49,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769356903] [2024-01-27 15:39:49,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:39:49,482 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-01-27 15:39:49,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:39:49,483 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-01-27 15:39:49,486 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-01-27 15:39:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:39:49,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:39:49,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:39:49,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:39:49,962 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:39:50,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:39:50,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:39:50,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769356903] [2024-01-27 15:39:50,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769356903] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:39:50,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:39:50,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-01-27 15:39:50,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789830589] [2024-01-27 15:39:50,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:39:50,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-27 15:39:50,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:39:50,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-27 15:39:50,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-01-27 15:39:50,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 41 [2024-01-27 15:39:50,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 138 flow. Second operand has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 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-01-27 15:39:50,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:39:50,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 41 [2024-01-27 15:39:50,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:39:52,078 INFO L124 PetriNetUnfolderBase]: 2953/4181 cut-off events. [2024-01-27 15:39:52,080 INFO L125 PetriNetUnfolderBase]: For 682/682 co-relation queries the response was YES. [2024-01-27 15:39:52,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9810 conditions, 4181 events. 2953/4181 cut-off events. For 682/682 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 18139 event pairs, 297 based on Foata normal form. 0/3773 useless extension candidates. Maximal degree in co-relation 9784. Up to 830 conditions per place. [2024-01-27 15:39:52,105 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 143 selfloop transitions, 33 changer transitions 0/177 dead transitions. [2024-01-27 15:39:52,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 177 transitions, 846 flow [2024-01-27 15:39:52,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-27 15:39:52,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-27 15:39:52,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 223 transitions. [2024-01-27 15:39:52,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41838649155722324 [2024-01-27 15:39:52,117 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 138 flow. Second operand 13 states and 223 transitions. [2024-01-27 15:39:52,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 177 transitions, 846 flow [2024-01-27 15:39:52,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 177 transitions, 836 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-01-27 15:39:52,125 INFO L231 Difference]: Finished difference. Result has 62 places, 72 transitions, 377 flow [2024-01-27 15:39:52,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=377, PETRI_PLACES=62, PETRI_TRANSITIONS=72} [2024-01-27 15:39:52,127 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2024-01-27 15:39:52,127 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 72 transitions, 377 flow [2024-01-27 15:39:52,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 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-01-27 15:39:52,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:39:52,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:39:52,140 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-01-27 15:39:52,333 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-01-27 15:39:52,333 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-01-27 15:39:52,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:39:52,334 INFO L85 PathProgramCache]: Analyzing trace with hash 2035194420, now seen corresponding path program 1 times [2024-01-27 15:39:52,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:39:52,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110896257] [2024-01-27 15:39:52,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:39:52,335 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-01-27 15:39:52,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:39:52,336 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-01-27 15:39:52,365 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-01-27 15:39:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:39:52,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:39:52,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:39:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:39:52,828 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:39:52,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:39:52,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110896257] [2024-01-27 15:39:52,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110896257] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:39:52,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:39:52,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:39:52,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012223503] [2024-01-27 15:39:52,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:39:52,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:39:52,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:39:52,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:39:52,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:39:52,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 41 [2024-01-27 15:39:52,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 72 transitions, 377 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-01-27 15:39:52,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:39:52,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 41 [2024-01-27 15:39:52,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:39:53,861 INFO L124 PetriNetUnfolderBase]: 2999/4270 cut-off events. [2024-01-27 15:39:53,862 INFO L125 PetriNetUnfolderBase]: For 7990/7990 co-relation queries the response was YES. [2024-01-27 15:39:53,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14597 conditions, 4270 events. 2999/4270 cut-off events. For 7990/7990 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 18243 event pairs, 1980 based on Foata normal form. 32/4054 useless extension candidates. Maximal degree in co-relation 14558. Up to 4175 conditions per place. [2024-01-27 15:39:53,895 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 71 selfloop transitions, 3 changer transitions 13/88 dead transitions. [2024-01-27 15:39:53,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 88 transitions, 613 flow [2024-01-27 15:39:53,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:39:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:39:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2024-01-27 15:39:53,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-01-27 15:39:53,897 INFO L175 Difference]: Start difference. First operand has 62 places, 72 transitions, 377 flow. Second operand 4 states and 69 transitions. [2024-01-27 15:39:53,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 88 transitions, 613 flow [2024-01-27 15:39:53,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 573 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-01-27 15:39:53,928 INFO L231 Difference]: Finished difference. Result has 63 places, 73 transitions, 364 flow [2024-01-27 15:39:53,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=364, PETRI_PLACES=63, PETRI_TRANSITIONS=73} [2024-01-27 15:39:53,930 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 23 predicate places. [2024-01-27 15:39:53,931 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 73 transitions, 364 flow [2024-01-27 15:39:53,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-01-27 15:39:53,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:39:53,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:39:53,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-01-27 15:39:54,137 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-01-27 15:39:54,138 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-01-27 15:39:54,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:39:54,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1590236256, now seen corresponding path program 1 times [2024-01-27 15:39:54,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:39:54,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517655822] [2024-01-27 15:39:54,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:39:54,140 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-01-27 15:39:54,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:39:54,141 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-01-27 15:39:54,173 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-01-27 15:39:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:39:54,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:39:54,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:39:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:39:54,683 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:39:54,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:39:54,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517655822] [2024-01-27 15:39:54,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517655822] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:39:54,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:39:54,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:39:54,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447911545] [2024-01-27 15:39:54,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:39:54,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:39:54,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:39:54,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:39:54,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:39:54,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 41 [2024-01-27 15:39:54,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 73 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-01-27 15:39:54,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:39:54,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 41 [2024-01-27 15:39:54,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:39:55,592 INFO L124 PetriNetUnfolderBase]: 3001/4276 cut-off events. [2024-01-27 15:39:55,592 INFO L125 PetriNetUnfolderBase]: For 8398/8398 co-relation queries the response was YES. [2024-01-27 15:39:55,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14647 conditions, 4276 events. 3001/4276 cut-off events. For 8398/8398 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 18361 event pairs, 1980 based on Foata normal form. 45/4320 useless extension candidates. Maximal degree in co-relation 14605. Up to 4178 conditions per place. [2024-01-27 15:39:55,622 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 69 selfloop transitions, 4 changer transitions 17/91 dead transitions. [2024-01-27 15:39:55,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 91 transitions, 614 flow [2024-01-27 15:39:55,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:39:55,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:39:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2024-01-27 15:39:55,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2024-01-27 15:39:55,624 INFO L175 Difference]: Start difference. First operand has 63 places, 73 transitions, 364 flow. Second operand 5 states and 75 transitions. [2024-01-27 15:39:55,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 91 transitions, 614 flow [2024-01-27 15:39:55,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 609 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 15:39:55,646 INFO L231 Difference]: Finished difference. Result has 68 places, 74 transitions, 390 flow [2024-01-27 15:39:55,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=390, PETRI_PLACES=68, PETRI_TRANSITIONS=74} [2024-01-27 15:39:55,647 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2024-01-27 15:39:55,647 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 74 transitions, 390 flow [2024-01-27 15:39:55,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-01-27 15:39:55,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:39:55,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:39:55,654 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-01-27 15:39:55,852 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-01-27 15:39:55,853 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-01-27 15:39:55,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:39:55,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1403825445, now seen corresponding path program 1 times [2024-01-27 15:39:55,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:39:55,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817794929] [2024-01-27 15:39:55,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:39:55,854 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-01-27 15:39:55,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:39:55,856 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-01-27 15:39:55,857 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-01-27 15:39:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:39:56,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 49 conjunts are in the unsatisfiable core [2024-01-27 15:39:56,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:39:56,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-01-27 15:39:59,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:39:59,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:39:59,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:39:59,044 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-27 15:39:59,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:39:59,046 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-27 15:39:59,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:39:59,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:39:59,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:39:59,053 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-27 15:39:59,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:39:59,061 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-27 15:40:00,835 INFO L349 Elim1Store]: treesize reduction 2100, result has 4.6 percent of original size [2024-01-27 15:40:00,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 6 disjoint index pairs (out of 276 index pairs), introduced 34 new quantified variables, introduced 276 case distinctions, treesize of input 981 treesize of output 391 [2024-01-27 15:40:00,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 65 [2024-01-27 15:40:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:40:01,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:40:03,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:40:03,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1201 treesize of output 904 [2024-01-27 15:41:23,976 WARN L293 SmtUtils]: Spent 1.27m on a formula simplification. DAG size of input: 1694 DAG size of output: 1358 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-01-27 15:41:23,978 INFO L349 Elim1Store]: treesize reduction 1144, result has 82.9 percent of original size [2024-01-27 15:41:23,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 32 select indices, 32 select index equivalence classes, 0 disjoint index pairs (out of 496 index pairs), introduced 40 new quantified variables, introduced 496 case distinctions, treesize of input 1890 treesize of output 5858 Killed by 15