./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a 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 e280ea7002eb926faba3195da50aa743246f3289123bb9a1b445dc9aaf8e8f3d --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 14:47:18,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 14:47:18,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 14:47:18,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 14:47:18,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 14:47:18,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 14:47:18,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 14:47:18,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 14:47:18,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 14:47:18,643 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 14:47:18,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 14:47:18,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 14:47:18,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 14:47:18,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 14:47:18,645 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 14:47:18,645 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 14:47:18,645 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 14:47:18,645 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 14:47:18,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 14:47:18,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 14:47:18,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 14:47:18,647 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 14:47:18,647 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 14:47:18,647 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 14:47:18,647 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 14:47:18,648 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 14:47:18,648 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 14:47:18,648 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 14:47:18,648 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 14:47:18,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 14:47:18,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 14:47:18,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 14:47:18,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:47:18,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 14:47:18,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 14:47:18,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 14:47:18,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 14:47:18,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 14:47:18,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 14:47:18,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 14:47:18,652 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 14:47:18,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 14:47:18,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 14:47:18,653 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 -> e280ea7002eb926faba3195da50aa743246f3289123bb9a1b445dc9aaf8e8f3d Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 14:47:18,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 14:47:18,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 14:47:18,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 14:47:18,968 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 14:47:18,969 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 14:47:18,970 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-02-19 14:47:20,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 14:47:20,183 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 14:47:20,184 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2024-02-19 14:47:20,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a3d3f72/16ca70b0f2c64adcbe6205a3c240b4a3/FLAGedd910de1 [2024-02-19 14:47:20,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a3d3f72/16ca70b0f2c64adcbe6205a3c240b4a3 [2024-02-19 14:47:20,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 14:47:20,215 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 14:47:20,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 14:47:20,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 14:47:20,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 14:47:20,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:47:20" (1/1) ... [2024-02-19 14:47:20,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4815ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:20, skipping insertion in model container [2024-02-19 14:47:20,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:47:20" (1/1) ... [2024-02-19 14:47:20,253 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 14:47:20,431 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[3182,3195] [2024-02-19 14:47:20,440 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:47:20,451 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 14:47:20,487 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[3182,3195] [2024-02-19 14:47:20,489 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:47:20,512 INFO L206 MainTranslator]: Completed translation [2024-02-19 14:47:20,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:20 WrapperNode [2024-02-19 14:47:20,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 14:47:20,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 14:47:20,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 14:47:20,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 14:47:20,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:20" (1/1) ... [2024-02-19 14:47:20,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:20" (1/1) ... [2024-02-19 14:47:20,577 INFO L138 Inliner]: procedures = 28, calls = 74, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 375 [2024-02-19 14:47:20,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 14:47:20,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 14:47:20,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 14:47:20,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 14:47:20,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:20" (1/1) ... [2024-02-19 14:47:20,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:20" (1/1) ... [2024-02-19 14:47:20,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:20" (1/1) ... [2024-02-19 14:47:20,622 INFO L175 MemorySlicer]: Split 36 memory accesses to 6 slices as follows [2, 4, 24, 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, 1, 3, 1, 1, 1]. [2024-02-19 14:47:20,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:20" (1/1) ... [2024-02-19 14:47:20,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:20" (1/1) ... [2024-02-19 14:47:20,643 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:20" (1/1) ... [2024-02-19 14:47:20,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:20" (1/1) ... [2024-02-19 14:47:20,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:20" (1/1) ... [2024-02-19 14:47:20,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:20" (1/1) ... [2024-02-19 14:47:20,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 14:47:20,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 14:47:20,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 14:47:20,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 14:47:20,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:20" (1/1) ... [2024-02-19 14:47:20,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:47:20,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:47:20,717 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-02-19 14:47:20,725 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-02-19 14:47:20,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 14:47:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-02-19 14:47:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-02-19 14:47:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-02-19 14:47:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-02-19 14:47:20,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-02-19 14:47:20,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-02-19 14:47:20,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 14:47:20,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 14:47:20,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 14:47:20,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 14:47:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 14:47:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-19 14:47:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-02-19 14:47:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 14:47:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 14:47:20,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 14:47:20,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 14:47:20,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-19 14:47:20,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-02-19 14:47:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-02-19 14:47:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-02-19 14:47:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-02-19 14:47:20,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-02-19 14:47:20,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-02-19 14:47:20,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-02-19 14:47:20,765 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 14:47:20,765 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 14:47:20,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 14:47:20,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 14:47:20,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-19 14:47:20,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-19 14:47:20,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 14:47:20,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 14:47:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 14:47:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 14:47:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-19 14:47:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-02-19 14:47:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 14:47:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 14:47:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 14:47:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 14:47:20,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 14:47:20,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 14:47:20,769 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 14:47:20,920 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 14:47:20,922 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 14:47:21,354 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 14:47:21,354 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 14:47:21,654 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 14:47:21,654 INFO L320 CfgBuilder]: Removed 7 assume(true) statements. [2024-02-19 14:47:21,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:47:21 BoogieIcfgContainer [2024-02-19 14:47:21,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 14:47:21,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 14:47:21,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 14:47:21,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 14:47:21,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 02:47:20" (1/3) ... [2024-02-19 14:47:21,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313b7268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:47:21, skipping insertion in model container [2024-02-19 14:47:21,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:20" (2/3) ... [2024-02-19 14:47:21,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313b7268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:47:21, skipping insertion in model container [2024-02-19 14:47:21,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:47:21" (3/3) ... [2024-02-19 14:47:21,662 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product-alt.wvr.c [2024-02-19 14:47:21,676 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 14:47:21,676 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 14:47:21,676 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 14:47:21,729 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-19 14:47:21,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 41 transitions, 103 flow [2024-02-19 14:47:21,775 INFO L124 PetriNetUnfolderBase]: 7/38 cut-off events. [2024-02-19 14:47:21,775 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 14:47:21,777 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 43 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-02-19 14:47:21,777 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 41 transitions, 103 flow [2024-02-19 14:47:21,779 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 37 transitions, 92 flow [2024-02-19 14:47:21,785 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:47:21,790 INFO L369 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=All, 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;@1696baf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:47:21,790 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-19 14:47:21,800 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:47:21,801 INFO L124 PetriNetUnfolderBase]: 7/36 cut-off events. [2024-02-19 14:47:21,801 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 14:47:21,801 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:21,801 INFO L234 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-02-19 14:47:21,802 INFO L432 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-02-19 14:47:21,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:21,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1520528807, now seen corresponding path program 1 times [2024-02-19 14:47:21,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:21,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11262750] [2024-02-19 14:47:21,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:47:22,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:22,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11262750] [2024-02-19 14:47:22,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11262750] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:47:22,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:47:22,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:47:22,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569699631] [2024-02-19 14:47:22,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:47:22,145 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:47:22,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:22,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:47:22,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:47:22,165 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-02-19 14:47:22,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:47:22,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:22,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-02-19 14:47:22,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:47:22,497 INFO L124 PetriNetUnfolderBase]: 1240/1728 cut-off events. [2024-02-19 14:47:22,497 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2024-02-19 14:47:22,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3573 conditions, 1728 events. 1240/1728 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 7505 event pairs, 206 based on Foata normal form. 1/1255 useless extension candidates. Maximal degree in co-relation 2979. Up to 1465 conditions per place. [2024-02-19 14:47:22,510 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 47 selfloop transitions, 4 changer transitions 1/56 dead transitions. [2024-02-19 14:47:22,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 249 flow [2024-02-19 14:47:22,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:47:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:47:22,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-02-19 14:47:22,520 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6016260162601627 [2024-02-19 14:47:22,524 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2024-02-19 14:47:22,524 INFO L507 AbstractCegarLoop]: Abstraction has has 42 places, 56 transitions, 249 flow [2024-02-19 14:47:22,525 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:47:22,525 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:22,525 INFO L234 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-02-19 14:47:22,525 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 14:47:22,525 INFO L432 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-02-19 14:47:22,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:22,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1515677555, now seen corresponding path program 1 times [2024-02-19 14:47:22,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:22,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292781679] [2024-02-19 14:47:22,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:22,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 14:47:22,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:22,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292781679] [2024-02-19 14:47:22,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292781679] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:47:22,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:47:22,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:47:22,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292448740] [2024-02-19 14:47:22,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:47:22,749 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:47:22,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:22,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:47:22,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:47:22,751 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-02-19 14:47:22,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 56 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:47:22,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:22,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-02-19 14:47:22,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:47:23,049 INFO L124 PetriNetUnfolderBase]: 1246/1741 cut-off events. [2024-02-19 14:47:23,050 INFO L125 PetriNetUnfolderBase]: For 144/160 co-relation queries the response was YES. [2024-02-19 14:47:23,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5327 conditions, 1741 events. 1246/1741 cut-off events. For 144/160 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 7478 event pairs, 206 based on Foata normal form. 0/1270 useless extension candidates. Maximal degree in co-relation 4422. Up to 1715 conditions per place. [2024-02-19 14:47:23,058 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 49 selfloop transitions, 4 changer transitions 12/69 dead transitions. [2024-02-19 14:47:23,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 69 transitions, 431 flow [2024-02-19 14:47:23,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:47:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:47:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2024-02-19 14:47:23,059 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-02-19 14:47:23,060 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2024-02-19 14:47:23,060 INFO L507 AbstractCegarLoop]: Abstraction has has 46 places, 69 transitions, 431 flow [2024-02-19 14:47:23,060 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:47:23,060 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:23,060 INFO L234 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-02-19 14:47:23,060 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 14:47:23,060 INFO L432 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-02-19 14:47:23,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:23,061 INFO L85 PathProgramCache]: Analyzing trace with hash 392071675, now seen corresponding path program 1 times [2024-02-19 14:47:23,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:23,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035014620] [2024-02-19 14:47:23,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:23,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 14:47:23,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:23,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035014620] [2024-02-19 14:47:23,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035014620] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:47:23,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353718130] [2024-02-19 14:47:23,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:23,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:47:23,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:47:23,180 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-02-19 14:47:23,208 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-02-19 14:47:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:23,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 14:47:23,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:47:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 14:47:23,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:47:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 14:47:23,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353718130] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 14:47:23,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-19 14:47:23,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-02-19 14:47:23,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970425878] [2024-02-19 14:47:23,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:47:23,400 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:47:23,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:23,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:47:23,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-02-19 14:47:23,401 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-02-19 14:47:23,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 69 transitions, 431 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:47:23,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:23,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-02-19 14:47:23,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:47:23,686 INFO L124 PetriNetUnfolderBase]: 1302/1822 cut-off events. [2024-02-19 14:47:23,686 INFO L125 PetriNetUnfolderBase]: For 528/552 co-relation queries the response was YES. [2024-02-19 14:47:23,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7237 conditions, 1822 events. 1302/1822 cut-off events. For 528/552 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7788 event pairs, 82 based on Foata normal form. 0/1406 useless extension candidates. Maximal degree in co-relation 6891. Up to 1718 conditions per place. [2024-02-19 14:47:23,702 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 69 selfloop transitions, 5 changer transitions 16/93 dead transitions. [2024-02-19 14:47:23,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 93 transitions, 758 flow [2024-02-19 14:47:23,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:47:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:47:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2024-02-19 14:47:23,707 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4195121951219512 [2024-02-19 14:47:23,708 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2024-02-19 14:47:23,709 INFO L507 AbstractCegarLoop]: Abstraction has has 50 places, 93 transitions, 758 flow [2024-02-19 14:47:23,709 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:47:23,709 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:23,709 INFO L234 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-02-19 14:47:23,721 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-02-19 14:47:23,916 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:47:23,917 INFO L432 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-02-19 14:47:23,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:23,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1165013571, now seen corresponding path program 1 times [2024-02-19 14:47:23,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:23,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224308790] [2024-02-19 14:47:23,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:23,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 14:47:24,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:24,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224308790] [2024-02-19 14:47:24,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224308790] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:47:24,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:47:24,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:47:24,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137316230] [2024-02-19 14:47:24,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:47:24,027 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:47:24,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:24,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:47:24,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:47:24,030 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-02-19 14:47:24,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 93 transitions, 758 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-02-19 14:47:24,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:24,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-02-19 14:47:24,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:47:24,341 INFO L124 PetriNetUnfolderBase]: 1395/1979 cut-off events. [2024-02-19 14:47:24,341 INFO L125 PetriNetUnfolderBase]: For 1491/1491 co-relation queries the response was YES. [2024-02-19 14:47:24,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9542 conditions, 1979 events. 1395/1979 cut-off events. For 1491/1491 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8117 event pairs, 96 based on Foata normal form. 0/1618 useless extension candidates. Maximal degree in co-relation 9112. Up to 1800 conditions per place. [2024-02-19 14:47:24,355 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 97 selfloop transitions, 6 changer transitions 16/122 dead transitions. [2024-02-19 14:47:24,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 122 transitions, 1234 flow [2024-02-19 14:47:24,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 14:47:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 14:47:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2024-02-19 14:47:24,359 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-02-19 14:47:24,360 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2024-02-19 14:47:24,360 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 122 transitions, 1234 flow [2024-02-19 14:47:24,360 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-02-19 14:47:24,360 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:24,360 INFO L234 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-02-19 14:47:24,360 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 14:47:24,361 INFO L432 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-02-19 14:47:24,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:24,361 INFO L85 PathProgramCache]: Analyzing trace with hash -386228097, now seen corresponding path program 1 times [2024-02-19 14:47:24,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:24,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421760728] [2024-02-19 14:47:24,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:24,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 14:47:24,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:24,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421760728] [2024-02-19 14:47:24,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421760728] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:47:24,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:47:24,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:47:24,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638780577] [2024-02-19 14:47:24,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:47:24,638 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:47:24,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:24,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:47:24,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:47:24,639 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-02-19 14:47:24,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 122 transitions, 1234 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:47:24,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:24,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-02-19 14:47:24,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:47:24,893 INFO L124 PetriNetUnfolderBase]: 1423/2044 cut-off events. [2024-02-19 14:47:24,894 INFO L125 PetriNetUnfolderBase]: For 3081/3094 co-relation queries the response was YES. [2024-02-19 14:47:24,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11695 conditions, 2044 events. 1423/2044 cut-off events. For 3081/3094 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8456 event pairs, 99 based on Foata normal form. 24/1700 useless extension candidates. Maximal degree in co-relation 10851. Up to 1838 conditions per place. [2024-02-19 14:47:24,907 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 102 selfloop transitions, 3 changer transitions 44/153 dead transitions. [2024-02-19 14:47:24,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 153 transitions, 1857 flow [2024-02-19 14:47:24,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 14:47:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 14:47:24,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2024-02-19 14:47:24,911 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4573170731707317 [2024-02-19 14:47:24,911 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2024-02-19 14:47:24,911 INFO L507 AbstractCegarLoop]: Abstraction has has 56 places, 153 transitions, 1857 flow [2024-02-19 14:47:24,912 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:47:24,912 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:24,912 INFO L234 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-02-19 14:47:24,912 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 14:47:24,912 INFO L432 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-02-19 14:47:24,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:24,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1983671507, now seen corresponding path program 1 times [2024-02-19 14:47:24,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:24,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156403739] [2024-02-19 14:47:24,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:24,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 14:47:25,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:25,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156403739] [2024-02-19 14:47:25,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156403739] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:47:25,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:47:25,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:47:25,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616173409] [2024-02-19 14:47:25,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:47:25,224 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:47:25,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:25,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:47:25,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:47:25,225 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-02-19 14:47:25,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 153 transitions, 1857 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:47:25,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:25,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-02-19 14:47:25,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:47:25,583 INFO L124 PetriNetUnfolderBase]: 1473/2134 cut-off events. [2024-02-19 14:47:25,583 INFO L125 PetriNetUnfolderBase]: For 6501/6505 co-relation queries the response was YES. [2024-02-19 14:47:25,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14169 conditions, 2134 events. 1473/2134 cut-off events. For 6501/6505 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9161 event pairs, 90 based on Foata normal form. 32/1788 useless extension candidates. Maximal degree in co-relation 12770. Up to 1911 conditions per place. [2024-02-19 14:47:25,607 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 98 selfloop transitions, 9 changer transitions 79/190 dead transitions. [2024-02-19 14:47:25,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 190 transitions, 2688 flow [2024-02-19 14:47:25,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:47:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:47:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-02-19 14:47:25,608 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-02-19 14:47:25,610 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2024-02-19 14:47:25,610 INFO L507 AbstractCegarLoop]: Abstraction has has 60 places, 190 transitions, 2688 flow [2024-02-19 14:47:25,611 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:47:25,611 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:25,611 INFO L234 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-02-19 14:47:25,611 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-19 14:47:25,614 INFO L432 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-02-19 14:47:25,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:25,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2089997866, now seen corresponding path program 1 times [2024-02-19 14:47:25,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:25,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452836691] [2024-02-19 14:47:25,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:25,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:27,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 14:47:27,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:27,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452836691] [2024-02-19 14:47:27,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452836691] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:47:27,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484424811] [2024-02-19 14:47:27,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:27,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:47:27,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:47:27,414 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-02-19 14:47:27,416 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-02-19 14:47:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:27,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 46 conjunts are in the unsatisfiable core [2024-02-19 14:47:27,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:47:27,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-02-19 14:47:27,715 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-02-19 14:47:27,717 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-02-19 14:47:28,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2024-02-19 14:47:28,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-02-19 14:47:28,078 INFO L349 Elim1Store]: treesize reduction 80, result has 44.8 percent of original size [2024-02-19 14:47:28,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 83 [2024-02-19 14:47:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 14:47:28,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:47:32,953 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 131 treesize of output 127 [2024-02-19 14:47:32,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:47:32,968 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 474 treesize of output 442 [2024-02-19 14:47:32,978 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 418 treesize of output 402 [2024-02-19 14:47:32,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:47:32,996 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 1238 treesize of output 1038 [2024-02-19 14:47:39,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:47:39,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 963 treesize of output 955 [2024-02-19 14:47:39,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:47:39,614 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 222 treesize of output 200 [2024-02-19 14:47:40,097 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 14:47:40,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 89 [2024-02-19 14:47:40,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:47:40,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 328 treesize of output 340 [2024-02-19 14:47:41,472 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-19 14:47:41,693 INFO L349 Elim1Store]: treesize reduction 304, result has 0.3 percent of original size [2024-02-19 14:47:41,694 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 9 new quantified variables, introduced 21 case distinctions, treesize of input 1254 treesize of output 1 [2024-02-19 14:47:41,704 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-02-19 14:47:41,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1008 treesize of output 1 [2024-02-19 14:47:41,720 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-02-19 14:47:41,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2329 treesize of output 1 [2024-02-19 14:47:41,734 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-02-19 14:47:41,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1735 treesize of output 1 [2024-02-19 14:47:41,750 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-02-19 14:47:41,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2551 treesize of output 1 [2024-02-19 14:47:41,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:47:41,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1622 treesize of output 1552 [2024-02-19 14:47:41,885 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-02-19 14:47:41,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 11 [2024-02-19 14:49:53,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:49:53,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 289 treesize of output 387 [2024-02-19 14:53:02,973 WARN L293 SmtUtils]: Spent 3.15m on a formula simplification that was a NOOP. DAG size: 2752 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-02-19 14:53:02,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 14:53:02,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 38 select indices, 38 select index equivalence classes, 0 disjoint index pairs (out of 703 index pairs), introduced 38 new quantified variables, introduced 703 case distinctions, treesize of input 2566 treesize of output 15084 Killed by 15